# Tagged Questions

A poset or partially ordered set is a set endowed with a partial order, meaning a binary relation $\leq$ which is reflexive ($x \leq x$ for all $x$), antisymmetric ($x\leq y$ and $y\leq x$ implies $x=y$), and transitive ($x\leq y$ and $y\leq z$ implies $x \leq z$).

1k views

### Banach and Knaster-Tarski fixed point theorems — are they related?

It there any known way of obtaining the Banach fixed-point theorem from the Tarski fixed-point theorem or vice-versa?
77 views

### Does the collection of coverings on a set $X$ form a lattice when ordered by refinement?

This is a follow-up question to this question, prompted by a comment in Todd Trimble's answer. Let $X\neq \emptyset$ be a set. We say that $U\subseteq {\cal P}(X)\setminus \{\emptyset\}$ is a proper ...
68 views

322 views

### Principal Order Ideals in the Weak Bruhat Order

Let $\sigma\in S_n$ be a permutation on $n$ elements, and $\mathrm{Inv}(\sigma):=\{(i,j) : 1\leq i<j\leq n\text{ and }\sigma(i)>\sigma(j)\}$ be its set of inversions. In the weak order on ...
83 views

### Weighted maximal number of disjoint singly-generated ideals in the divisibility poset for $\{1,2,\ldots,n\}$

In the mathoverflow question here the asymptotic growth of antichains in the divisibility poset ${\cal P}_n$ of the set of natural numbers $\{1,\ldots,n\}$ is considered. I have a somewhat dual ...
154 views

32 views

3k views

### The category of posets

I am trying to teach myself category theory and, as a begginer, I am looking for examples that I have a hands-on experience with. Almost every introductory text in category theory contains following ...
83 views

### Ideals in strong Bruhat order

Recall that a (lower) ideal in a poset $(P, \le)$ is a subset $I\subset P$ such that $x\in I \Rightarrow y\in I$ for all $y\le x$. In am interested in ideals in finite Coxeter groups $W$ equipped ...
114 views

### An equivalent definition for the adiamond lattices

A lattice is called adiamond if it admits no sublattice equivalent to the diamond lattice $M_3$ below: The top interval of a lattice is the interval between the meet of all the maximal elements and ...
156 views

### Quotients of posets

Let $\mathbf{Poset}$ denote the category of partially ordered sets and order-preserving maps. Does $\mathbf{Poset}$ have quotients?
140 views

### ACC (DCC) implies upper (lower) sets are upper (lower) closure of antichains?

I have read around (e.g. in Wikipedia) that if the ascending (descending) chain condition holds, all upper (lower) sets are the upper (lower) closure of an antichain, but I cannot find a proof. More ...
262 views

259 views

### Posets preserving stationary subsets of $\omega_1$ and no new $\text{cof}(\omega)$ ordinals, but without countable covering property

What are some examples of posets $\mathbb{P}$ which have the following properties? It's OK if the definition uses large cardinals or some other hypothesis. $\mathbb{P}$ preserves stationary subsets ...
147 views

### Optimal strategy for game of 'online sorting' into a poset

Consider a single-player game played with an arbitrary finite poset, and a random number generator with a known distribution: Each turn, the RNG produces a number, and the player must assign that ...
200 views

177 views

### Order dimension of $\omega^\omega/(fin)$

Let $\omega^\omega$ denote the collection of all functions $f:\omega\to\omega$. For $f,g\in\omega$ we say $f\simeq g$ if and only if $\exists N \in \omega$ such that $f(n) = g(n)$ for all $n\geq N$. ...
963 views

### Category = Groupoid x Poset?

Is it possible to split a given category $C$ up into its groupoid of isomorphisms and a category that resembles a poset? "Splitting up" should be that $C$ can be expressed as some kind of extension ...
101 views

87 views

### Is $\{0,1\}^\omega$ the order-preserving image of $\{0,1\}^\omega$ modulo some finiteness relation?

Consider the following equivalence relation on $\{0,1\}^\omega$: $x\simeq y$ iff there is $n\in\omega$ such that $x(k)=y(k)$ for all $k\in\omega$ with $k\geq n$. It is easy to see that ...
If $[n]:=\{1,2,\ldots, n\}$ for some $n\in\mathbb{N}$, then the hypercube digraph of dimension $n$, denoted $H_n$, is the graph whose set of vertices is the power-set $\wp([n])$ where two vertices \$U,...