Order theory deals with properties of orders, usually partial orders or quasi orders but not only those. Questions about properties of orders, general or particular, may fit into this category, as well as questions about properties of subsets and elements of an ordered set.

learn more… | top users | synonyms

5
votes
1answer
72 views

How many ways to order vectors in $\{0,1\}^n$?

How many different rankings can be produced for the vectors in $\{0,1\}^n$ that also respect the usual $\geqq$ ordering of vectors (defined below)? I want to produce a complete ordering where, for ...
2
votes
1answer
14 views

does a lattice have a minimal item

A lattice (L, ≤) is a partially ordered set, where each two elements of the set have a least upper bound and a greatest lower bound. Let's consider the situation where L is finite. I think that this ...
1
vote
1answer
66 views

Can I embed $\mathbb R^{\mathbb N}$ with a partial order into $^\ast\mathbb{R}$ with the linear order?

Define a relation $\prec$ on $\mathbb R^{\mathbb N}$ as, For all $f, g \in \mathbb R^{\mathbb N} $, $f \prec g$, if for all $n \in \mathbb N$, $f(n) \leq g(n)$, and there exists a $m \in \mathbb ...
1
vote
2answers
25 views

Prove that the greatest lower bound of $F$ (in the subset partial order) is $\cap F$.

This is one of the question I'm working on: Suppose $A$ is a set, $F \subseteq \mathbb{P(A)}$, and $F \neq \emptyset$. Then prove that the greatest lower bound of $F$ (in the subset partial ...
0
votes
1answer
24 views

About characterization of atomistic posets

Fix some poset. Let $\mathscr{A}$ be the map from elements of our poset into the set of atoms under this element. Is it true, that injectivity of $\mathscr{A}$ implies that our poset is atomistic? ...
1
vote
1answer
28 views

Prove if $x$ is greatest lower bound of $U$ then $x$ is the least upper bound of $B$

This is one of the problem I have been solving from Velleman's How to prove book; Suppose $R$ is a partial order on $A$ and $B \subseteq A$. Let $U$ be the ...
7
votes
0answers
103 views

Order-preserving map of regressive functions on $\omega_1$

I posted the following question a year ago on MO. It did receive some attention, but the answer there remains incomplete (as discussed in some detail in its comments). Meanwhile I got the impression ...
0
votes
1answer
31 views

ordering two rational functions

I have read that $$\frac{x^2 +3}{2x+1}$$ is less than $$\frac{2x-1}{2x+1}$$ in an ordered field,in $\mathbb{Q}((x))$, but how is that result computed? How do we compare two rational fractions like ...
7
votes
0answers
76 views

Infinite palindromes in number of nonisomorphic posets is independent of $\mathsf{ZF}$

The following is an "exercise" in P. Stanley's book "Enumerative Combinatorics": Let $f(n)$ be the number of nonisomorphic $n$-element posets (...) let $\mathcal{P}$ denote the statement that ...
0
votes
1answer
31 views

Birkhoff's definition of semilattice?

could anyone provide me with the original definition of semilattice by Garrett Birkhoff in his book on lattices? If you could also provide, page number and edition, it would be great (as well as some ...
0
votes
0answers
36 views

Concept of Boundedness

I noticed there are two notions of boundedness, one in the context of order theory and other in the context of metric spaces. In a metric space (X,d) , we talk about subsets of X being bounded iff ...
4
votes
1answer
53 views

Generalisation of posets

The notion of (set) monoid can be generalised to that of monoid object in a monoidal category. Can the notion of poset be generalised in a similar fashion? How?
3
votes
1answer
86 views

Recognizing linear orders embeddable in $\Bbb R^2$ ordered lexicographically

Let $(C, \leq_C)$ be any chain: binary relation $\leq_C$ on $C$ is reflexive, antisymmetric, transitive, and total. Give $\mathbb{R}^2$ the lexicographic order: for all real numbers $a,b,c,d$, $(a,b) ...
7
votes
0answers
72 views

Showing that poset of set of supports of a vector space is semimodular

Let $W$ be a subspace of the vector space $\mathbb{K}^n$, where $\mathbb{K}$ is a field of characteristic $0$. The support of a vector $v = (v_1,\ldots, v_n) \in \mathbb{K}^n$ is given by ...
0
votes
0answers
45 views

What would be the join and meet of this lattice?

I'm working on the following problem: Let $W$ be a subspace of the vector space $\mathbb{K}^n$, where $\mathbb{K}$ is a field of characteristic $0$. Let $L$ denote the set of supports of all vectors ...
1
vote
1answer
34 views

What is reverse inclusion?

I'm learning about posets for the first time. What does it mean for a collection of sets to be "ordered by reverse inclusion"? Thank you.
1
vote
1answer
32 views

Topology and Monotone Convergence Theorem

I'm looking on the Monotone Convergence Theorem and asking myself whether it is the property of ANY order topology induced by some total order that is dedekind complete ( basis are the open-intervals ...
0
votes
1answer
19 views

Find if relation is partial / total ordered

These are two problems of the Velleman's How to prove book in which it has been asked to find if $R$ is an partial order or/and an total order: $R1 = \{(x,y) \in A ...
2
votes
0answers
25 views

Nested Interval Property and Ordered Fields

I have been given the following as a general version of the Nested Interval Property, which is a predicate whose free-variable F ranges through the universe of all ordered fields : Every ...
1
vote
0answers
31 views

Order and Metric

Consider the Reals as a totally ordered set via its natural order ( linear continuum ). Such order induces an order topology ( basis is the collection of open-intervals of that order), which ...
0
votes
1answer
32 views

Drawing a Hasse Diagram

I am trying to draw a Hasse diagram and wanted to see if anyone can let me know if I am doing it right. Let R = {(a,b) | a divides b} be a relation over the set {1, 2, 3, 4, 5, 12} That is what I ...
0
votes
1answer
23 views

Fact related to non-paracompactness in well-ordered spaces

Let $\omega_1$ be the first uncountable ordinal. Look at the set $X=[0,\omega_1[$, the set of all ordinals $<\omega_1$. It is a well-ordered set with a smallest element. Since any ordinal strictly ...
0
votes
1answer
25 views

Order Type of Positive Reals.

Let (M,d) be a metric space , $\varepsilon>0$ be a real number . Fix $p \in M$ and denote $U_\varepsilon(p) $ = {$x \in M$ : $ d(p,x) < \varepsilon$ }. Now define the order $\leq$ on the ...
0
votes
2answers
39 views

Order and Topology

Given any set, a total order on that set can induce a topology on that same set. Does the opposite also work ? Given a topology on a set, can it induce an order ( perharps total ) on that set ? ...
0
votes
1answer
23 views

How do the interval and lower topologies relate when generated by an arbitrary poset?

At first glance, it would seem that the lower topology (and the upper topology, for that matter) would be a subset of the interval topology for a partially ordered set P, since the open-ended ...
0
votes
1answer
24 views

Finding smallest set of real numbers according to a property

This is one of the example problem that has been solved in Velleman's How to prove book: Find the smallest set of real numbers X such that $5 \in X$ and for all real numbers $x$ and $y$, if $x ...
0
votes
0answers
23 views

Binomial-like expansion for non-commuting operators

I would like to evaluate the following and express it in a compact form: $(\hat{a}^\dagger(x)+\hat{a}(x))^n\,\vert0\rangle$, where the $n^{\text{th}}$ power of the sum of the annihilation and creation ...
0
votes
1answer
47 views

Understanding Dilworth's theorem

One formulation of Dilworth's theorem(for finite partially ordered sets) states that : There exists an antichain A, and a partition of the order into a family P of chains, such that the number of ...
1
vote
1answer
35 views

Construct an sequence in order set

Assume that we have an uncountable ordered set $\Theta$. Can we construct a sequence $(x_n)$ which $x_1<x_2<...<x_n<...$. In addition, for each $x\in \Theta$, there exists $n$ such that ...
3
votes
1answer
27 views

Can we define Möbius functions on preordered sets?

(From Rota's paper): Let $P$ be a locally finite poset. The incidence algebra of $P$ is the set of all real-valued functions $f$ of two variables $x$ and $y$ in $P$ with the property that $f(x, y) = ...
0
votes
0answers
28 views

Conditions for monotone function to take maximal chains to maximal chains srujectively

Suppose that $P$ and $Q$ are graded (with rank function $r$) connected posets with least elements and suppose that all maximal chains of $P$ and $Q$ have length $n$. Let $f:P \to Q$ be a surjective ...
0
votes
1answer
38 views

Help with the definition of ordinal sum

"Given two ordinals $\alpha$ and $\beta$, let $A = (\alpha$ x {0}) $\cup$ $(\beta$ x {1}). Then, define a well ordering on A by: $(v, i) <_{A} (\tau, j) \iff (i \lt j) \lor (i = j$ $\land$ $v ...
0
votes
1answer
43 views

show that N(G) is a lattice?

if $G$ is a group let N(G) be the set of normal subgroups of $G$ define $\wedge$ and $\vee$ on$ N(G)$ by $N_{1}\wedge N_{2}=N_{1}\cap N_{2}$ and $N_{1}\vee N_{2}=N_{1} N_{2}=\{n_{1}n_{2}:n_{1}\in ...
1
vote
1answer
34 views

Natural Ordering of the Class of Hermitian Preserving Maps

I am trying to understand Man-Duen Choi's remark 3 in his paper Completely Positive Linear Maps on Complex Matrices: For a linear map $\Phi : \mathcal{M}_{n} \to \mathcal{M}_{m}$, it is obvious that ...
-1
votes
1answer
21 views

Strengthening of a theorem about filters vs a counter-example

Let $S$ be a non-empty set of filters on a meet-semilattice. If our semilattice is a distributive lattice, then the supremum (on the poset of filters ordered by set-theoretic inclusion) of $S$ is the ...
2
votes
1answer
39 views

$f\colon \mathbb R\to\mathbb R$ Knaster-Tarski Theorem

Knaster-Tarski Theorem says that for a function $f\colon L\to L$, where $L$ is a complete lattice, and $f$ is a increasing function, then a $f$ has a fixed point. Question: For a function $f\colon ...
0
votes
1answer
18 views

A question on order theory (an ordered set and its subset)

Filtrator is a pair $(\mathfrak A; \mathfrak Z)$ of a poset $\mathfrak A$ and it subset $\mathfrak Z$. Let $a\in\mathfrak A$. Then by definition $\operatorname{up} a = \{x\in\mathfrak Z \mid x\ge a ...
0
votes
0answers
25 views

equivalence of ordering properties

The wikipedia page on weak orderings states that Transitivity of incomparability (together with transitivity) can also be stated in the following forms: If x < y, then for all z, either x ...
-1
votes
1answer
82 views

What is $|\emptyset|$? [closed]

What is $|\emptyset|$? Intuitively I would say $0$, but the number of partitions of $0$ is $1$, which is established due to the elegance of the generating function for partition numbers.
0
votes
1answer
34 views

Is A∩B has Maximum?

Consider $A=(0,1)∪\{2\}$ and $B=(0,1)∪\{3\}$. Both sets have maxima, $2$ and $3$ respectively. But $A∩B=(0,1)$ which has no maximum. How can we say that $A∩B=(0,1)$ does not have any maximum. ...
1
vote
1answer
38 views

Stochastic dominance characterization

Consider two probability measures on $\Bbb R$ given by $\mu$ and $\nu$. We write $\mu\leq \nu$ if there exists a joint distribution $P$ with the latter marginals such that $P(x\leq y) = 1$. In ...
2
votes
1answer
57 views

Bijection on Preordered Sets Implies Homeomorphism

Prove that if $X$ and $Y$ are finite, then the "converse" of one of my other questions Homeomorphism on a Preordered Set is true: if $h: X \to Y$ is bijective and satisfies $\forall a,b \in X, ...
1
vote
1answer
16 views

Proof that $S$ is a partial order when it is the reflexive closure of a strict partial order

Suppose $R$ is a strict partial order on $A$. Let $S$ be the reflexive closure of $R$. Show that $S$ is a partial order on A. ("How to Prove it", Chapter 4.5 exercise 4.a) To prove that $S$ is a ...
0
votes
1answer
58 views

Does the empty set have a minimum if it is a subset of R?

True or False: As a subset of $\bf{R}$: $\emptyset$ has a minimum. What is the difference between a supremum and the maximum? are they used interchangeably?
1
vote
2answers
36 views

What is subset partial order

This is one of the example problem solved in Velleman's How to prove book: Find the smallest set of real numbers X such that $5 \in X$ and for all real numbers $x$ and $y$, if $x \in X$ and $x ...
1
vote
1answer
27 views

Number of directed acyclic graphs with specific topological sort

Given a topological sorting $>$ over a set of elements $N$, how many possible DAGs with vertex set $N$ that are consistent with $>$ ? ( note that a DAG may be consistent with other orders in ...
1
vote
1answer
22 views

A Directed Preorder from a Local Base

Prove that if $\mathscr{A}$ is a local base at point $p \in (X, \mathscr{T})$, then $\supset$ (the superset relation) is directed on $\mathscr{A}$. Here are the definitions I am given for this ...
-4
votes
1answer
36 views

Supremum And infimum True or false

If the sets A and B have maxima and A ∩ B $\neq$ 0 , then A ∩ B has a maximum. Is this statement is true or false ? How to do these kind of problems
0
votes
0answers
41 views

Homeomorphism on a Preordered Set

Prove that if $h$ is a homeomorphism from $(X,\mathscr{S})$ to $(Y,\mathscr{T})$, then $\forall a, b \in X \left( a \trianglelefteq_{\mathscr{S}} b \iff h(a) \trianglelefteq_{\mathscr{T}} h(b) ...
2
votes
1answer
52 views

Are all finitely distributive and join-complete lattices infinitely distributive?

The infinite distributive law on a join-complete lattice $L$ is as follows: $\displaystyle a \wedge\left( \bigvee_{b \in B} b \right) = \bigvee_{b \in B}(a \wedge b) $ for all $a \in L$ and $B ...