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

2
votes
2answers
65 views

Isomorphisms of well ordered sets

Let $A$, $B$ be well ordered sets. If there exist order-preserving functions $f : A \to B$ and $g : B \to A$ (do not need to preserve initial segments), are $A$ and $B$ isomorphic? I know this is not ...
-4
votes
4answers
71 views

Find $A$ and $B$ such that $A⊈B$ and $B⊈A$? [on hold]

I need to prove that the subset relation “$⊆$” on all subsets of $\mathbb Z$ is not a total order and I'm going to do this by finding $A$ and $B$ such that $A⊈B$ and $B⊈A$? Is there a simple solution ...
0
votes
0answers
6 views

Decreasing sequences of cofinals parts

Suppose you are given a directed partially ordered set $(A,<)$ such that $A$ admit no countable cofinal part. Is it then possible that $A$ admits a sequence $(A_1, A_2, \ldots)$ of cofinals parts ...
1
vote
2answers
19 views

Formally real field with two different orders

If $F$ is a formally real field, then there exists a total order relation on $F$ which is compatible with its sum and product, but it needs not be unique. a) How different can be two (compatible with ...
-1
votes
0answers
16 views

Which of these sets is well-ordered with respect to $<$? [on hold]

This question is part from a past analysis of algorithms test paper. Which of these sets is well-ordered with respect to $<$ ? a) Natural numbers that are $> 100$ b) Integers that are ...
0
votes
0answers
41 views

Good ordered set [on hold]

The set [5, $\infty$) $\cap$ N is a good ordered set than the relation "<"? If it is, I must demonstrated it. So, a good ordered set = if any subsets non-empty of it, has an initial element. ...
4
votes
0answers
36 views

Group orderable iff all its finitely-generated subgroups are orderable

I want to proof this specifically using the Compactness Theorem from propositional logic (this is an exercise from Model Theory, Hodges). $G$ orderable means there is a total ordering s. t. $g\leq h$ ...
0
votes
1answer
47 views

Subset relation ⊆ on all subsets of ℤ is a partial order, not a total order.

I need to prove that the subset relation “⊆” on all subsets of ℤ is a partial order but not a total order. I'm not experienced in these kind of proofs and was hoping to see an example of an easier one ...
0
votes
1answer
20 views

Proving that divisibility in an integral domain is a partial ordering

Given that R is an integral domain. I'm trying to prove that divisibility on this set constitutes a partial ordering. In particular, I have defined the relation $y \leq_{\,d} x$ on R by $y|x$. ...
1
vote
0answers
33 views

Why is the symbol for the exterior product a meet rather than a join?

It seems odd that something that looks so much like a join would get given "the wrong symbol". It's even worse when you dualise it and get something called (quite reasonably) the "meet product", but ...
2
votes
1answer
45 views

Turning Preordered Sets into Preordered Monoids (Constructing Preordered Monoids from Preordered Sets)

Question: Referring to the Wikipedia article on Adjoint Functors in Section 2 (Motivation), they talk about "turning rngs into rings" (can be rephrased as "constructing rings from rngs"). I do not ...
0
votes
2answers
91 views

uncountable well-ordered chain in $(\mathcal{P}(\mathbb{N}),\subseteq)$ without $AC$

If we assume $AC$ we can construct an uncountable well-ordered chain of subsets of $\mathbb{N}$ by well-ordering the reals and then using the same Dedekind's cut construction as in this question. ...
1
vote
0answers
44 views

Estimates for the Dedekind number $M(9)$

The Dedekind number $M(n)$ is the number of antichains in the partial order of subsets of $\{1,\dotsc,n\}$. It is only known for $0 \leq n \leq 8$. Question. What are some known upper and lower ...
0
votes
1answer
35 views

Translate this problem to graph theory

Say I have a size $k$ set called $S_k$ with elements that are natural numbers (repetitions are allowed). For instance $\{2, 8, 6, 6, 1, 3\}$ is a valid set for $k = 6.$ I am trying to find the least ...
0
votes
0answers
63 views

Order-Preserving Bijection $f:A\to A^*$?

Let $A$ be a well-quasi-ordered infnite set. Does there exist an order-preserving bijection $f:A\to A^*$, where $A^*$ is the free monoid over $A$ under the subword ordering? Would this subword ...
0
votes
1answer
44 views

Example of discrete set [closed]

Please I need examples of discrete set and non discrete set... am a little confused over this expression. I am thinking of discrete as a finite set but found from another article that, its not ...
0
votes
1answer
144 views

Prove 1 is not the largest integer? [duplicate]

This proof looks extremely flawed, but I'm new to proofs so I'm not completely sure what is allowed and what isn't. Here it is: Let $n$ be the largest positive integer. Then $n$ must be $\geq 1$. ...
3
votes
1answer
38 views

Is there a sequence of with every other sequence as a subsequence?

Let's say we have a set $S$. Is there a sequence $u:\mathbb N \to S$ such that every other sequence $v$ is a subsequence of $u$? Here is what I have so far: If $S=\emptyset$, then no (there are no ...
0
votes
0answers
8 views

History and motivation for Continuous Posets.

Can anyone point to me resources that motivates discusses the history and development of continuous posets? I would really like to know what 'concrete' objects that were studied that gives rise to ...
0
votes
1answer
33 views

Embedding tuples of natural numbers into real numbers

I'm looking for a pointer to common techniques to map tuples of natural numbers into real or rational numbers such that the ordering is preserved (I assume tuples are ordered lexicographically). I'm ...
0
votes
0answers
22 views

Interpreting N vector function

For $\mathcal{N} = \mathcal{N} \bigcup\{ \bot_{\mathcal{N}} , \top_{\mathcal{N}} \} $ and $\mathcal{N}^\vec{} = \mathcal{N} \vec{} \mathcal{N} $ (monotonic function over $ \mathcal{N} $), how ...
2
votes
1answer
51 views

Partial orders that can be realized by prime ideals of commutative rings

Is there a general criterion for which partial orders can be realized by the prime ideals of commutative rings (like we have for topological spaces - https://en.wikipedia.org/wiki/Spectral_space)? ...
1
vote
1answer
32 views

Does there exist a poset whose “quasiwidth” strictly exceeds its width?

Let $P$ denote a poset. Then the width of $P$ is defined as the supremum of the set of all cardinal numbers $\kappa$ such that $P$ has an antichain of cardinality $\kappa$. By the quasiwidth of $P$, ...
1
vote
0answers
36 views

Are ($Q$, $\leq$) and ($Q \times Q$, $\leq _e$) isomorphic? [duplicate]

I can't really tell if ($Q$, $\leq$)$\cong$($Q \times Q$, $\leq _e$), where $\leq_e$ denotes the left lexicographic order. Neither have a last/first element, both are dense and have the same ...
3
votes
1answer
54 views

Find a poset with no infinite antichains and that can only be covered by infinitely many chains.

So far I'm struggling to find such a poset. I first considered $(\mathbb{Z}, \leq )$ because it doesn't have any antichains so there aren't any infinite ones. The problem is that whilst the chain ...
1
vote
1answer
29 views

Can every countable Boolean algebra be embedded into $\mathcal{P}(\mathbb{N})$?

Can every countable Boolean algebra be embedded into $\mathcal{P}(\mathbb{N})$? And if so, is the same true for countable semi-lattices?
0
votes
1answer
52 views

Interpreting functions for poset

I'm stuck at a question with the following expression of poset $(\mathcal{N}, \sqsubseteq)$: $$\forall x, y \in \mathcal{N}: x \sqsubseteq y \mbox{ iff } (x = y \vee x = \bot_{\mathcal{N}} \vee y = ...
1
vote
1answer
23 views

The lattice of partial partitions

In perusing A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices I have gotten confused over what seems a very elementary point. The beginning of section 2 of the paper is ...
1
vote
0answers
24 views

Interesting orderings open sets of a topology

Let X be a set of points an $\mathcal{Q}$ be a partition on X. The intuition I want to model is that X is a set of worlds considered possible by an agent and $\mathcal{Q}$ is a question whose ...
2
votes
1answer
44 views

Different Zorn's lemma statements

Given a chain-complete poset $P$, every $x\in P$ lies below some maximal element. Every inductive poset has enough maximal elements a maximal element. Chain-complete means every chain has a least ...
1
vote
1answer
47 views

Proving a total-order is a well-order if and only if every initial segment is determined by an element

I managed to prove the $\longrightarrow$ part, but I'm not entirely sure how to prove the second part. I can assume by contradiction that the total order $(X, \leq)$ is not a well-order, which means ...
0
votes
1answer
53 views

Algebraic lattices and distributivity over joins of upward directed sets

I am reading Burris & Sankappanavar, Chapter 1 on lattices, and I am doing Exercise 6 in Section §4: If $L$ is an algebraic lattice and $D$ a subset of $L$ such that for each $d_1$, $d_2 \in D$ ...
2
votes
1answer
34 views

Alternate definitions of width (of a partial order) without Choice?

Say an antichain of a poset $P$ is a set of pairwise incomparable elements of $P.$ Typically, the width of a partial order is defined to be the supremum of the cardinalities of antichains of $P.$ When ...
4
votes
3answers
35 views

Ordered sets $\langle \mathbb{N} \times \mathbb{Q}, \le_{lex} \rangle$ and $\langle \mathbb{Q} \times \mathbb{N}, \le_{lex} \rangle$ not isomorphic

I'm doing this exercise: Prove that ordered sets $\langle \mathbb{N} \times \mathbb{Q}, \le_{lex} \rangle$ and $\langle \mathbb{Q} \times \mathbb{N}, \le_{lex} \rangle$ are not isomorphic ($\le_{lex}$ ...
0
votes
0answers
14 views

Question about partially ordered sets and how to order them?

If I had a partially ordered set (E, ≤) where E = {1,2,3}, how would I order it? In other words, if I wanted to show the set, would I need to conform to the definition of ≤? So would it be {(1,2), ...
0
votes
2answers
96 views

what does ≼ or ≺ mean?

I was reading a paper about well-orderings and this came up: Suppose (E, ≤) and (F, ≼) are isomorphic well-orderings. Then there exists a unique isomorphism for (E, ≤) to (F, ≼). I've been scouring ...
0
votes
0answers
53 views

Difficulty with exercise 24.12 in Jech

Exercise 24.12 in Jech's Set Theory (3d Millenium Edition): The lexicographical ordering $\omega \times {\omega}_1$ does not have true cofinality. True cofinality is defined (p.461) as the least ...
1
vote
1answer
65 views

“Minimal upper bounds” in a categorical setting

It is well-known that partial orders can be seen as very simple categories (those where there is at most one morphism between every two objects). Then, the notion of "(binary) join of two elements ...
0
votes
0answers
15 views

Is there a common notation for $x \sqcap Yy\neq \bot$

Is there a commonly used shorthand to express the following relation: $x R y \iff X \sqcap Y \neq \bot$? That is, the greatest lower bound of the two elements is not bottom. In terms of sets, the ...
-1
votes
3answers
51 views

Define well-order on finite subsets of $\mathbb{N}$ [closed]

Define a well-order $\le$ in $P_\text{fin}(\mathbb{N})$ - (it's the set of all finite subsets of $\mathbb{N}$, the natural numbers) that: $ A, B \in P_\text{fin}(N) (A \subseteq B \rightarrow A \le B ...
0
votes
0answers
17 views

Examples of adjoint order morphisms

Given posets $(X, \leq)$, and $(Y, \leq)$, an order morphism is a map $f : X \to Y$ such that $x \leq y$ implies $f(x) \leq f(y)$. Given two order morphism $f: X \to Y$ and $g: Y \to X$, we say that ...
1
vote
3answers
43 views

Well ordering of order types

Notice: in this problem I shouldn't use any properties of the ordinals, and order types are not defined as ordinals. Let $A,B$ be well ordered sets. We say that $otp(A) = otp(B)$, if $A,B$ are ...
1
vote
2answers
38 views

Fundamental question concerning Partial/Total Orders

Often when reading various texts involving total/partial orders, I come across statements like: "...thus $\leq$ is a total order on $\mathbb{Z}$ when $a \leq b$ is given its usual meaning." Is there ...
0
votes
0answers
22 views

A property of product order

Let $\mathfrak{A}$ be a poset, let $a\in\mathfrak{A}$. By definition $$\star a = \{ x\in\mathfrak{A} \mid \text{there exists non-least } y\in\mathfrak{A} \text{ such that } y\le a \text{ and } y\le ...
5
votes
1answer
113 views

On the order of natural functions {f:N→N}

Define a partial order on natural-valued functions (or sequences, depends on how you see it): $f<g$ iff $\exists x:\forall n(n>x\rightarrow f(n)<g(n))$. Intuitively, $f<g$ if $g$ ...
2
votes
2answers
106 views

Can every non-empty set satisfying the axioms of $\sf{ZF}$ be totally ordered?

Let us first propose the following axiom, Axiom of Ordering $(\sf{AO})$. If $S$ be a non-empty set. Let $a,b\in S$. Then the set $\{a,b\}$ can be totally ordered. Now let us consider $\sf{ZFO}$ ...
-1
votes
0answers
34 views

Quick way to describe a 'top 10' subset

I have a finite ordered set $\mathcal{X}$ and some weight $f:\mathcal{X}\rightarrow \mathbb{R}$ and I wish to quickly specify a subset of it $S_{N}(a)$ which is "The $N$ elements of $\mathcal{X}$ ...
1
vote
1answer
25 views

closed monoidal posets

Let $X$ be a set, regarded as discrete category. if $X$ has structure of closed monoidal category $(X,\cdot,e)$, then it is easy to show that $X$ is a group: since all the morphisms are identities, ...
2
votes
1answer
78 views

Which of the sets are well ordered? Which ones are isomorphic?

I'm new to StackExchange and I'd like to ask you for help. I have been trying to solve this exercise: $$A = \left\{3 - \frac{1}{2n} : n \in \mathbb{N} - \left\{ 0 \right\} \right\}$$ $$ B = \left\{ ...
2
votes
2answers
21 views

Prove a fact about a mapping of complete poset to itself

Let M be a poset such that any its totally ordered subset has an upper bound: $\forall U \subseteq M$, $U$ is totally ordered $\exists m \in M: \forall u \in U \ \ u \leq m$. And let $f: M \to M$ be a ...