The tag has no usage guidance.

learn more… | top users | synonyms

3
votes
0answers
64 views

Extending homomorphisms between ordered abelian groups

Let $\Omega$ be a linearly (i.e. fully) ordered set, and let $\Lambda_{\Omega}$ be the ordered abelian group consisting of those $(\lambda_\omega)_{\omega\in\Omega}\in\mathbb{R}^{\Omega}$ with well-...
7
votes
1answer
171 views

Posets obtained from a semigroup by the definition $x \leq y \iff x \cdot y = x$

A po-groupoid is a groupoid $\langle A,\cdot\rangle $ such that the relation defined by $$ x \leq y \text{ if and only if } x \cdot y = x $$ is a partial order on $A$, the order related to $\langle ...
3
votes
2answers
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 ...
4
votes
2answers
144 views

Spans as binary relations: reflexivity, transitivity, and completeness?

Let $\mathcal{C}$ be a category, let $B$ be an object in $\mathcal{C}$, and let $\mathcal{R}$ be a span from $B$ to itself. (That is: $\mathcal{R}$ is a diagram $B \stackrel{r_1}{\longleftarrow} R \...
1
vote
1answer
68 views

Order on the collection of coverings

Let $X\neq \emptyset$ be a set. We say that $U\subseteq {\cal P}(X)\setminus \{\emptyset\}$ is a proper covering if $\bigcup U = X$, and for $a\neq b\in U$ we have $a\not\subseteq b$. Let $\text{...
2
votes
1answer
98 views

Existentially closed partial orders

Existentially closed linear orders are dense linear orders without endpoints, which are finitely axiomatizable, and occur as order-types of natural mathematical structures such as the rationals or ...
5
votes
1answer
98 views

Is there an exponential map on (Hahn) ordered fields?

If $F$ is an ordered field and $G$ is an ordered abelian group, one can define the Hahn product $F \boxtimes G$ to be the set of formal Laurent series with coefficients in $F$ and exponents in $G$. It ...
0
votes
0answers
31 views

Are atomistic posets satisfying the descending chain condition finitely atomistic?

An atomistic poset $P$ has a minimum $0$ and each element is a join of atoms (elements that cover $0$). When such a poset satisfies the descending chain condition, is it true that every element is a ...
3
votes
0answers
39 views

Does the rank (=height) of a well partial order bound its type (=length, =stature)?

Terminology and context (This should all be standard, but is recalled because terminology sometimes varies, and also to put the question into perspective.) A partially ordered set is called well-...
2
votes
0answers
59 views

Terminology and technique for repeated pairwise removal of elements of posets: “Collapsibility” of a “face poset”

Let $P$ be a poset, or partially ordered set. Let $\le$ denote the reflexive order on $P$, and $<$ the corresponding irreflexive order. Let the phrase "a maximal pair" in $P$ refer to an ordered ...
4
votes
1answer
115 views

Minimal zero-dimensional Hausdorff spaces

A topological space $(X,\tau)$ is said to be zero-dimensional Hausdorff (zdH) if for $x\neq y\in X$ there is $C\subseteq X$ clopen (closed and open) such that $x\in C$, but $y\notin C$. We say a zdH ...
2
votes
1answer
70 views

Topology with no direct lower neighbor

Given any poset $(P,\leq)$ and $x, y\in P$ we set $[x,y] = \{p\in P: x\leq p \leq y\}$. For any set $X$, let $\text{Top}(X)$ denote the set of topologies on $X$. The set $\text{Top}(X)$ is a complete ...
3
votes
1answer
84 views

“Discrete jumps” in the collection of all topologies on a set $X$

Given any poset $(P,\leq)$ and $x, y\in P$ we set $[x,y] = \{p\in P: x\leq p \leq y\}$. For any set $X$, let $\text{Top}(X)$ denote the set of topologies on $X$. The set $\text{Top}(X)$ is a complete ...
10
votes
0answers
278 views

Computing the ordinal of a rational language well-partially-ordered by the subword relation

Let $\Sigma$ be a finite set or "alphabet", $\Sigma^*$ the free monoid on $\Sigma$ or set of "words". If $w,w'\in \Sigma^*$, write $w\leq w'$ when $w$ is a "subword" of $w'$, i.e., can be obtained by ...
0
votes
0answers
59 views

“Downward closed” relation on a poset

I say that a relation $R$ on a poset $P$ is downward closed if for each $(x,y)\in R$, and $x'\le x$, then $(x',y)\in R$. Is there a reference where this thing is studied, maybe under a different name? ...
1
vote
1answer
89 views

Lower neighbors in the lattice of topologies

Given any poset $(P,\leq)$ and $x, y\in P$ we set $[x,y) = \{p\in P: x\leq p < y\}$, and $(x,y]$ is defined in an analogous manner. For any set $X$, let $\text{Top}(X)$ denote the set of topologies ...
3
votes
1answer
201 views

“Lexicographic” ordering on ${\cal P}(\omega)$

For $A\neq B\in {\cal P}(\omega)$ we set $$\mu(A,B) = \min\big((A\setminus B)\cup (B\setminus A)\big).$$ We define $A < B$ if and only if $A \neq B$, and $A = B\cap \mu(A,B)$ (that is $A$ is an ...
5
votes
1answer
122 views

Can There be Rudin-Keisler Immediate Sucessors?

There are several well-studied orderings on the set $\omega^*$ of ultrafilters on the natural numbers. Three popular ones are $\le_i$ for $i = 1,2,3$. We define $\mathcal U \le_i \mathcal V$ to mean ...
2
votes
1answer
158 views

Posets (partially ordered sets) in equational logic

I know about equational logic, cf. https://en.wikipedia.org/wiki/Lattice_(order)#Lattices_as_algebraic_structures, and understood that lattices are expressed equationally, i.e., in terms of equational ...
2
votes
1answer
158 views

Pseudocomplements in the lattice of topologies

Given a set $X\neq \emptyset$ it is well-known that the collection $\text{Top}(X)$ of all topologies on $X$ is a (complete) lattice with respect to $\subseteq$. Let $0$ denote the smallest element of ...
4
votes
1answer
157 views

Is there a short expression for height and width of product and coproduct of posets?

I am trying to derive some basic relations for the height and width of the direct product and the coproduct of posets. I feel that these are very basic and should be written somewhere, however, I ...
3
votes
2answers
290 views

Which ordinals can be embedded into an ordered field?

Let $F$ be an ordered field. What is the least ordinal $\alpha$ such that there is no order-embedding of $\alpha$ into any bounded interval of $F$?
4
votes
1answer
150 views

Generalized ordering on simplicial complex

The vertices of simplicial complexes are usually totally ordered so that face maps of each simplex can be defined easily for the purposes of homology. That gives an "oriented" simplicial complex. But ...
9
votes
1answer
172 views

Are these two quotients of $\omega^\omega$ isomorphic?

Let $\omega^\omega$ denote the set of all functions $f:\omega\to\omega$. For $f,g\in\omega^\omega$ we say $f\simeq_{\text{fin}} g$ if there is $n\in \omega$ such that $f(k) = g(k)$ for all $k\geq n$. ...
15
votes
4answers
465 views

Representation theorem for modular lattices?

Birkhoff's representation theorem implies that every distributive lattice embeds into the lattice of subsets of a set. Is there also some representation theorem for modular lattices? For example, I ...
-1
votes
1answer
221 views

Order-Perserving 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 ...
6
votes
1answer
113 views

Partial Orders realized by Prime Ideals on 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
0answers
100 views

The lattice of graphs under vertex abstractions

I am curious to know if the following structure has been studied, or if anything similar is in the literature. For $n \in \mathbb{N}$, let $G = ([n],E)$ be a digraph. A partition of a subset $V$ of $[...
2
votes
1answer
110 views

Is the interval topology of $(\mathbb{N}^\mathbb{N}, \leq^*)$ connected?

Given a quasi-ordered set $(Q,\leq)$ the interval topology on $Q$ is generated by $$\{Q\setminus\downarrow x : x\in Q\} \cup \{Q\setminus\uparrow x : x\in Q\},$$ where $\downarrow x = \{y\in Q: y\leq ...
-1
votes
1answer
68 views

Interval topology on $(\mathbb{N}^\mathbb{N},\leq^*)$

Given a quasi-ordered set $(Q,\leq)$ the interval topology on $Q$ is generated by $$\{Q\setminus\downarrow x : x\in Q\} \cup \{Q\setminus\uparrow x : x\in Q\},$$ where $\downarrow x = \{y\in Q: y\leq ...
4
votes
0answers
83 views

Face structures of chain polytopes

For a finite poset $P$ the chain polytope $\mathscr C(P)\subset\mathbb{R}^P$ consists of such $g$ that $g(p)\ge 0$ for all $p\in P$ and $$g(p_1)+\ldots+g(p_n)\le 1$$ for any chain $p_1<\ldots<...
5
votes
0answers
121 views

Functoriality of $\mathsf{Cu}$

I have always been happy with the proof of the functoriality of the Cuntz semigroup $\mathsf{Cu}$ given in arXiv:0902.3381, where the isomorphism $$\mathsf{Cu}(A)\cong W(A\otimes K)$$ is used, $A$ ...
5
votes
0answers
81 views

Minimal Hausdorff topologies compatible with a bunch of functions

Let $X$ be an infinite set, let ${\cal F}$ be a set of functions $f: X\to X$. We say that a topology $\tau$ is compatible with ${\cal F}$ if every $f\in {\cal F}$ is a continuous function $f:(X, \tau)\...
1
vote
0answers
65 views

Partial orders on tabloids

Let $n \in \mathbb{N}$ and let $\lambda \vdash n$, a partition of $n$. By a $\lambda$-tabloid I mean a row-tabloid of shape $\lambda$. There is a well-known order on the set of $\lambda$-tabloids, ...
1
vote
0answers
32 views

Form of binary function over poset that is monotone over first and antitone over second argument

if I have a partially ordered set $P$, and I have a function $f: P \times P \to \mathbb{R}$ that is monotone over the first and antitone over the second argument, i.e. for any $a,b,c \in P$ $a ≤ b \...
8
votes
0answers
107 views

Product of Partial Orders

Define the transpose product of a partial order $P$ over a set $S$ in the following way. The direct product of a partial order $P \subseteq S \times S$ and its converse, $P^{op}$, gives a partial ...
0
votes
1answer
80 views

Prime ideals containing the finite members of ${\cal P}(\omega)$

Let ${\frak P}$ denote the collection of prime ideals containing the finite members of ${\cal P}(\omega)$, and order ${\frak P}$ by set inclusion. What is the cardinality of ${\frak P}$, and what's ...
2
votes
1answer
166 views

Boolean algebras and free filters generated by chains

Suppose $\mathbf{B}$ is a complete Boolean algebra with an infinite domain $B$. Suppose $\mathbf{B}$ is atomic (i.e. every element is the supremum of some set of atoms). This algebra contains the co-...
1
vote
1answer
156 views

Quotients of posets

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

Transitive reduction from a linear extension of a partial order

Is there an efficient algorithm to create a transitive reduction from a single linear extension of a given partial order? Update: I'm aware of the time complexity of computing a transitive reduction ...
1
vote
1answer
76 views

“Interval” terminology for (partially) ordered sets

Let $(X,\preceq)$ be a poset. Is there a standard, generally recognised term for a set $A \subset X$ satisfying $$ \forall x,y,z \in X, \ (x \in A \ \textrm{ and } \ z \in A \ \textrm{ ...
1
vote
0answers
110 views

Examples of value quantales

In his paper "Quantales and continuity spaces" R. C. Flagg gives the following examples of value quantales: the lattice $\bf{2}$ of truth values with usual addition, the lattice $\mathbb{R}_{+}$ of ...
0
votes
0answers
92 views

Properties of a specific antichain of a lattice formed by the cartesian product of finite ordered sets

Introduction Let $X$ be a poset of all $n$-tuples, $x = (x_1, x_2, ..., x_n)$, where $0 \leq x_i \leq m_i - 1$ for $i = 1, ..., n$ together with the relation $x \prec y$ defined so that for $y=(y_1,...
1
vote
0answers
83 views

Relationship of ${\cal P}(\omega)/fin$ and ${\cal L}$

Define ${\cal L}$ as in this question: the set of functions $f:\mathbb{N}\rightarrow\mathbb{N}$ such that $f(n)\leq f(n+1)\leq f(n)+1$, where two functions are considered equal if they differ at at ...
1
vote
0answers
89 views

Properties of Coefficients of Order Polynomials [closed]

I am working on a problem involving determining the order polynomial $\Omega_P(k)$ of a partial order $P$, which counts the number of order-preserving transformations/maps from $P$ to the $k$-chain (...
18
votes
0answers
585 views

A Linear Order from AP Calculus

In teaching my calculus students about limits and function domination, we ran into the class of functions $$\Theta=\{x^\alpha (\ln{x})^\beta\}_{(\alpha,\beta)\in\mathbb{R}^2}$$ Suppose we say that $...
0
votes
1answer
70 views

Does order-preserving equal continuous? [closed]

Let $P,Q$ be posets and endow them with the interval topology $\tau_i(P)$ and $\tau_i(Q)$ respectively. Is it true that if $f: P\to Q$ is order-preserving, then it is continuous, and vice versa?
1
vote
1answer
72 views

Path-connected Hausdorff interval topologies

Let $(P,\leq)$ be a poset with more than $1$ point such that the interval topology $\tau_i(P)$ is path-connected and $T_2$. Does this imply that $[0,1]$ order-embeds into $P$? (This is a follow-up ...
3
votes
1answer
93 views

Path-connected interval topologies

Let $(P,\leq)$ be a poset with more than $1$ point such that the interval topology $\tau_i(P)$ is path-connected. Does this imply that $[0,1]$ order-embeds into $P$?
3
votes
1answer
156 views

Properties of the interval topology of the lattice of functions

Let $(P,\leq)$ be a poset. The interval topology $\tau_i(P)$ on $P$ is generated by $$\{P\setminus\downarrow x : x\in P\} \cup \{P\setminus\uparrow x : x\in P\},$$ where $\downarrow x = \{y\in P: y\...