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

1
vote
1answer
17 views

Lexicographic product of chains is a chain

Let $A_i$ be a partially ordered set and $C_i$ a chain of $A_i$. Order $A_1\times A_2$ lexicographically. Prove that $C_1\times C_2$ is a chain of $A_1\times A_2$. This is a set theory proof ...
0
votes
1answer
15 views

Look for the group members $\left ( (\mathbb Z/24\mathbb Z)^*,\underset{24}{\odot} \right )$ and calculate their orders.

Look for the group members $\left ( (\mathbb Z/24\mathbb Z)^*,\underset{24}{\odot} \right )$ and calculate their orders. The elements are $\overline1,\overline2,\ldots,\overline{23}$. Have the ...
0
votes
1answer
16 views

Evidence about the group $\left ( (\mathbb{Z}/p\mathbb{Z})^*,\underset{p}{ \odot} \right )$

Be $p$ an odd prime number. Show that the group $\left ( (\mathbb{Z}/p\mathbb{Z})^*,\underset{p}{ \odot} \right )$ has a unique element of order $2$, namely $\overline{p-1}$, and show that ...
1
vote
1answer
17 views

Be $G=\{ e,g_1,g_2,\ldots, g_n \}$, $|G|=n+1$. Suppose $G$ has a unique element of order $2$, say $g_1$. Show that $eg_1g_2\ldots g_n=g_1$.

Be $G=\{ e,g_1,g_2,\ldots, g_n \}$ an abelian group of order $n+1$. Suppose $G$ has a unique element of order $2$, say $g_1$. Show that $eg_1g_2\ldots g_n=g_1$. I have serious difficulties with ...
0
votes
1answer
16 views

Proving questions about posets

How do I tackle a proof about posets? I have know idea how to approach this problem. Thanks! Prove that if all subsets of a poset P have least upper bounds, then all subsets of P have greatest lower ...
4
votes
0answers
28 views

Prove that for every 2 elements in the set F of all functions from N to N, there's an element in F that's bigger than both

let there be $\ F$ the set of all functions from $\ N \rightarrow N$. K is a relation on F, for every f,g$\in$F , (f,g)$\in$K $\leftrightarrow$ for all $\ n\in N$, $\ f(n)\leq g(n)$ Prove that for ...
0
votes
1answer
23 views

How to show a quasi-order ~ on a set S with relation // induces a partially ordered relation?

Let ~ be the quasi-order relation. and let // be defined as the relation s~t and t~s(s,t elements of S). Show that ~ induces a partially ordered relation on the set of equivalence classes relation //, ...
0
votes
1answer
17 views

Building an antichain in a finite poset

Given some finite poset $P$ we would like to find an antichain $A$ which intersects each maximal chain. How to do that? Note that each chain $C$ and each antichain $A$ intersects at one element as ...
1
vote
1answer
67 views

Order of cycles in graph

In a school assignment, I am to use contradiction to prove that if a graph is bipartite then all of its cycles have even order. In this context, what does it mean for a cycle to have even order? I ...
1
vote
1answer
56 views

How many ways can we totally order a set $X$ (but not necessarily the whole set $X$, perhaps just a subset) up to isomorphism?

Here's Attempt #2 at asking this question. Suppose $X$ is a set (not necessarily finite), and let $T$ denote the collection of all totally ordered sets $(A,\leq)$ such that $A \subseteq X.$ Now let ...
3
votes
2answers
20 views

Isomorphism of intervals of a distributive lattice

Let $P$ be a distributive lattice and let for $a,b \in P$ by $a \land b$ and $a \lor b$ denote the usual notion of infimum and supremum. How can I show the following isomorphism? $$[a \land b , a ...
0
votes
1answer
125 views

Show that a particular set is a poset

I would like to know if my understanding of the concept of a poset is correct. From what I've learnt from the class: A poset must be transitive, reflexive, and antisymmetric. Am I right? Therefore, ...
0
votes
1answer
14 views

Going down from filters to sets for specific relations

Let $\mathfrak{A}$ be a bounded lattice. I call a $2$-staroid a relation $f\in\mathscr{P}(\mathfrak{A}\times\mathfrak{A})$ such that $i\sqcup j \mathrel{f} b\Leftrightarrow i\mathrel{f} b\vee ...
1
vote
2answers
27 views

Lattice from Preorder

I have seen many examples defining a lattice over a partially ordered set $(P, \sqsubseteq)$ together with a greatest lower bound $\sqcap$, a least upper bound $\sqcup$ and a top $\top$, and bottom ...
1
vote
1answer
39 views

Factor congruences of non trivial Lattices

A pair of congruences $\theta$ and $\theta^*$ are called factor congruences if $\theta \vee \theta^*$ = full congruence. $\nabla$ $\theta \wedge \theta^*$ = trivial congruence. $\triangle$ I need ...
0
votes
1answer
19 views

Chains of Well-ordered sets

Let $\{X_i\mid i\in I\}$ be a chain of sets and $\{R_i\mid i\in I\}$ be the corresponding chain of relations such, $R_i$ well orders $X_i$. Show that $\bigcup_{i\in I}R_i$ well orders $\bigcup_{i\in ...
2
votes
1answer
47 views

Does the empty set have a supremum or infimum? [duplicate]

I actually dont need this question to be answered for university or something, it was just a discussion I had with a friend. Does the empty set have an upper or lower bound? Since the supremum is ...
1
vote
1answer
36 views

define an order relation with respect to which …

Let $(S;<)$ and $(T;<')$ be two well-ordered sets. On $S \times T$, define an order relation with respect to which it becomes a well-ordered set. Give proofs for your answer. I was thinking ...
0
votes
0answers
22 views

Help with Quotient Groups, Order in D4.

What group is D4/ isomorphic? |D4/| = 8/2 = 4 so it can be isomorphic to V or Z4. How can I determine which group is it isomorphic to? I know that V (Klein-4 Group) is noncyclic and abelian and Z4 ...
0
votes
0answers
15 views

Order and Quotient Group Help

How do I find the order of 2+<6> in Z15/<6>? I know that |Z15/<6>| = 3 which is isomorphic to Z3, but I do not know how to find the order of 2 + <6>.
5
votes
2answers
90 views

If a finite poset has greatest and least elements, is it a lattice?

Let $P$ be a finite partially ordered set with elements $0$ and $1$ such that $0 \le x \le 1$ for any $x \in P$. Does it follow that $P$ is a lattice? If not, what is a counterexample? I believe this ...
0
votes
0answers
19 views

What is total number of inversions in a permutation that is sorted except at indices that are a multiple of a certain number.

So say we have a permutation of integers that is indexed from 0 to n-1, and it is sorted in ascending order except for indices that are a multiple of a number call it x where x is smaller than all ...
0
votes
0answers
30 views

How to show a directed set always has a “largest element” using induction

I know induction from my lower division classes, but have no idea what to do when it comes to sets. For example a directed set is such that every two elements has an upperbound. We are looking at ...
0
votes
1answer
18 views

Find a voting system - possibly Schulze Method

I remember the Schulze Method from back when I was studying Econ... that was years ago and my math isn't the greatest, go easy on me. We are piloting a project to make a to-do list app for teams, I'm ...
0
votes
0answers
24 views

Prove that this partial order relation is a chain with infinite length.

The natural numbers are denoted as a divisibility partial order prove that this relation is a chain with infinite length.
0
votes
1answer
20 views

Prime order of a number

Prove that if $a^p=e$ where $p$ is a prime number, then $a$ has order $p$ ($a\ne e$). Perhaps I should prove this using the contrapositive? Assume that $p$ is not the order of $a$, meaning there ...
1
vote
1answer
28 views

Notation/terminology: Existence of a nonleast element which is less of any element of a set

Let $A$ is a subset of a partial order $X$. Are there any name and/or notation for the following predicate $P(A)$? $P(A)$ iff there is a non-least element $x$ of $X$ which is a subelement of each ...
3
votes
1answer
61 views

What are some examples of “homogeneous” linear orders, other than $\mathbb{R}$ and $\mathbb{Q}$?

Let $L$ denote a linear order that is unbounded. Then it may or may not satisfy: Globally homogeneous. For all $x,y \in L \cup \{-\infty,\infty\}$, if $x < y$ then the interval $(x,y)$ is ...
1
vote
3answers
37 views

For a set $\mathbb{X}$ given order relation extended from that of $\mathbb{R}$, if $\mathbb{X} \supseteq \mathbb{R}$ then $\mathbb{X} = \mathbb{R}$?

For a set $\mathbb{X}$ given order relation extended from that of $\mathbb{R}$, if $\mathbb{X} \supseteq \mathbb{R}$ then $\mathbb{X} = \mathbb{R}$ ? Motivation for this question rose from an ...
1
vote
1answer
60 views

A set with a supremum and an infinum inside

What is the name of a set $A$ that has its infimum $i \in A$ and a supremum $s \in A$? Examples: $[0,1]$ has a supremum $1$ and an infimum $0$ which are inside $[0,1]$. $\{0,1,2,3\}$ has a supremum ...
-1
votes
0answers
18 views

Determining minimum and maximum elements in partial orders

Let $A$ and $B$ be two subsets of some universe $U$, the partial order is $\langle\mathcal P(U), \subseteq \rangle$. a. does a maximum exists to the group: $\{C: C\subseteq A\text{ and }C\subseteq ...
0
votes
0answers
17 views

Regularization for unordered vectors

Let suppose we have two vectors u, v $\in \mathbb{R}^n$ and we want a function that returns $0$ if the ordering of the elements of both vectors are the same or a positive number otherwise, where the ...
0
votes
0answers
14 views

Recommendation for Order Theory texts

Order Theory, Lattice Theory, or any directly relatable subject is not taught at my university, and quick searches don't give much clue into good textbooks for the subjects. My question is: what are ...
1
vote
0answers
29 views

Order-preserving embeddings

(Follow-up to Existence of a utility function on the reals.) Say we have a totally ordered set $X$ which has a countable, dense subset $C$. I believe we can find an $f:C\to\mathbb R$ which is ...
1
vote
2answers
122 views

On Tarski-Knaster theorem

Let $P(X)$ denote the power set of $X$ (the set of all subsets of $X$) with a partial order given by inclusion. If $F: P(X) \to P(X)$ is monotone (order preserving), then $F$ has a fixed point. How ...
0
votes
1answer
47 views

Definition of finite direct decomposition of elements and indecomposable elements at arbitrary lattice

How can i define finite direct decomposition of elements and indecomposable elements at arbitrary lattice . I think i can say an element of lattice is finite direct decomposition of elements if it be ...
3
votes
1answer
51 views

isomorphism between divisible, totally ordered, abelian groups

Let $G$, $H$ be divisible, abelian, linearly ordered groups, whose cardinalities are equal and satisfy $\mu := |G|=|H|>\aleph_{0}$. These are supposed to be (order!) isomorphic. And just about ...
3
votes
1answer
33 views

Not having c.c.c. implies existence of sequence of open sets with strictly increasing closures?

Suppose a topological space $X$ does not satisfy the countable chain condition (by that I mean that there exists an uncountable family of pairwise disjoint non-empty open subsets of $X$). Does it ...
4
votes
1answer
67 views

Infinite linear order with endpoints which is non-dense

In the process of answering questions about normal models, I had to prove the following: Any normal model of $\chi$ is a non-dense linear order with a least and greatest element. The next question ...
5
votes
1answer
114 views

Two topologies over the same set which are carried to each other by a lattice isomorphism induce homeomorphic spaces?

This is a question that I've been turning in my head and haven't been able to come up with a way to proceed to either prove it or construct a counter-example: Let $X$ be a set and $\mathfrak{T}_X$ ...
0
votes
0answers
37 views

Particular “upper bound” and “lower bound” of sequence

Is it possible to define the following? Let $a:\Bbb{N} \to \Bbb{R}$, and $M \in \Bbb{R}$, $M$ is ? if $$\exists n \in \Bbb{N}(\forall p \in \Bbb{N}(p\geq n \to a(p)\leq M))$$ Let $a:\Bbb{N} \to ...
2
votes
2answers
314 views

Can it be proven/disproven that every set can be well-ordered to have a maximal element?

Can we prove or disprove that every set can be well-ordered to have a maximal element in ZF or ZFC? Or is it the area where different models have different answers to this?
1
vote
0answers
22 views

Does an homeorphism function maps an interval in X to an interval in Y?

Let $(X,\leq_X)$ and $(Y,\leq_Y)$ be two well-ordered sets. Let $f:X\rightarrow Y$ be an homeorphism between $X$ and $Y$ and their order topology (relative to $\leq_X$ and $\leq_Y$). My question is, ...
2
votes
2answers
82 views

Strictly Convex and Strictly Monotonic Preferences

On the assumptions for a well behaved preference, I read recently that a preference must be complete, transitive, continuous, strictly monotonous (if the vectors x≥y and x≠y, then x is strictly ...
1
vote
1answer
57 views

Proving the dual and self-dual of a poset.

The dual of a poset $(S \leq)$ is the poset $(S, \geq)$, where for all $x,y \in S$ $x \leq y$ if and only if $ y \geq x$. A poset is self-dual if it is isomorphic to its dual. Questions: Verify ...
0
votes
1answer
12 views

Diagonal Relation as a poset I - establishing the result by vacous truth

I have a problem with the logic behind the fact that, given a nonempty set X, the diagonal relation $D_X := \{ (x,x) : x \in X \}$ is a partial order on $X$. More specifically, my problem is with ...
1
vote
1answer
20 views

How to talk about overlapping partitions of a set?

If I have a set $A$ and a number of sets $A_\sigma$ for each $\sigma \in \Sigma$ such that $$A = \bigcup_{\sigma \in \Sigma}A_\sigma$$ Is there a concise and eloquent way of saying this in plain ...
4
votes
1answer
39 views

Problems with a proof that -in a linear order- a minimal element is the smallest element

I have a problem with a proof I found in Velleman's "How to prove it". This is sort of interesting, because it is the very first time I cannot see the structure of a proof presented in the book. The ...
2
votes
1answer
67 views

A well order on $\mathbb Z$ that respects addition?

Does there exists any well-ordering on $\mathbb Z$ that respects addidtion that is if $a < b$ then $a +c < b+c$ for all $c$ in $\mathbb Z$?
0
votes
0answers
92 views

A function that is both log-supermodular and submodular?

Functions that are log-supermodular and submodular do they have some special name? Or any special properties? Any references? Is the function below log-super-modular and sub-modular? Consider ...