The tag has no usage guidance.

learn more… | top users | synonyms

2
votes
0answers
41 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
62 views

Properties of Coefficients of Order Polynomials

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 ...
15
votes
0answers
428 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 ...
1
vote
1answer
44 views

Does order-preserving equal continuous? [on hold]

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?
3
votes
0answers
28 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 ...
5
votes
1answer
68 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$?
5
votes
1answer
122 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: ...
2
votes
0answers
93 views

Generalizing disjointness

The following definition generalizes set-theoretic disjointess: Definition 0. (Autonomy). Given a Lawvere theory $\mathsf{T}$, a $\mathsf{T}$-algebra $X$, and an indexed family $S$ of subalgebras ...
4
votes
1answer
87 views

Surjectively rigid partially ordered sets

This question is related to a question recently asked by Joel David Hamkins. Let $(P,\leq)$ be a poset. We call it surjectively rigid if the only order-preserving surjective map $f:P\to P$ is the ...
1
vote
2answers
107 views

Is there a name for a partial order in which there is a countable chain which “dominates” the whole space?

Is there a name for a partial order $\preceq$ on a set $X$ with the following property: "there exists a countable set $S \subset X$ such that for all $x \in X$ there exists $y \in S$ with $x \preceq ...
1
vote
2answers
118 views

Complete non-isomorphic lattices with injective complete homomorphisms between them?

Are there complete lattices $L, K$ such that $L\not\cong K$; there are injective complete lattice homomorphisms $i:L\to K$ and $j: K\to L$ ?
1
vote
1answer
73 views

Does ${\cal Id}(L) \cong {\cal Id}(K)$ imply $L\cong K$?

For any lattice $L$ we denote the complete lattice of the ideals of $L$ by ${\cal Id}(L)$. Are there non-isomorphic lattices $L\not \cong K$ such that ${\cal Id}(L) \cong {\cal Id}(K)$?
4
votes
1answer
50 views

Simplyfing join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_L f(S).$ Is the ...
10
votes
2answers
257 views

Posets isomorphic to their endomorphism poset

Let $(P,\leq)$ be a poset. We set $$\text{End}(P)=\{f: P\to P: f\text{ is order-preserving}\}$$ and order $\text{End}(P)$ pointwise. Is there a poset with more than 1 point such that $P\cong ...
2
votes
1answer
51 views

Lattice homomorphism from ${\cal Id}(L)$ onto $L$

For any lattice $L$ we denote the complete lattice of the ideals of $L$ by ${\cal Id}(L)$. If $L$ is complete, is there a lattice homomorphism from ${\cal Id}(L)$ onto $L$?
3
votes
2answers
110 views

Join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_L f(S).$ Suppose ...
6
votes
1answer
83 views

Incomplete lattice homomorphisms between complete lattices (2)

Let $L, K$ be complete lattices. A lattice homomorphism $f: L\to K$ is said to be incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_K f(S).$ Consider the ...
3
votes
1answer
98 views

Incomplete lattice homomorphisms between complete lattices

Let $L, K$ be complete lattices. A lattice homomorphism $f: L\to K$ is said to be incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_K f(S).$ Suppose that ...
0
votes
0answers
49 views

Antichains in subgroups up to group automorphism

A family of subgroups of a group G will denote a nonempty collection of subgroups closed under conjugation and further passing to subgroups. In a Noetherian group (any ascending chain of subgroups ...
0
votes
1answer
110 views

Spliting of short exact exact sequences of partially ordered groups

Consider a short exact sequence of partially ordered groups $$0 \longrightarrow H \stackrel{\alpha}{\longrightarrow} G \stackrel{\beta} {\longrightarrow} G/H \longrightarrow 0 ,$$ where $H$ is a ...
3
votes
2answers
120 views

Embedding finite lattices into the lattice of partitions of a finite set

For any set $X$ we denote by $\text{Part}(X)$ the set of all partitions of $X$, ordered by the refinement ordering. It is well known that this is a complete lattice for all sets $X$. Let $L$ be a ...
8
votes
1answer
121 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 ...
2
votes
1answer
124 views

Finitely generated ordered monoids and noetherian subsets

(This question was asked a long time ago on MSE but got no answer so far...) Let $E$ be an additively written cancellable commutative monoid with no non-trivial units. We furnish $E$ with the order ...
12
votes
1answer
336 views

How long can a cycle of antichains in a finite partial order be?

Suppose that $X$ is a finite partially ordered set. Then a subset $A\subseteq X$ is said to be an antichain if there do not exist elements $a,b\in A$ with $a<b$. Let $\mathcal{A}_{X}$ be the set of ...
3
votes
1answer
75 views

Dedekind-MacNeille completion of the strictly increasing members of $\omega^\omega$

Let $\omega^\omega$ denote the set of all functions $f:\omega\to\omega$ ordered by $f\leq g$ iff $f(n) \leq g(n)$ for all $n\in \omega$. Set $K = \{f\in \omega^\omega: m<n\in \omega \implies ...
6
votes
1answer
158 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$. ...
5
votes
1answer
219 views

Can you “combine” Ord and Mon to get Cat?

Mon is the category of moniods, which can be seen as categories with one object. Ord is the category of preorders, which can be seen as categories with up to one morphism in each homset. Is there ...
2
votes
1answer
91 views

Priestley topologizability and connected components

This question is in the spirit of another older question. We say that a poset $(P,\leq)$ is Priestley-topologizable if there is a topology $\tau$ on $P$ such that $(P,\leq,\tau)$ is a Priestley ...
4
votes
0answers
314 views

Order theory as a foundation of mathematics?

I know the followings kinds of formalization of mathematics: based on set theory (e.g. ZFC) based on type theory (e.g. the formalism of Coq proof assistant, as an advanced example) based on category ...
3
votes
0answers
60 views

Is the order convergence topology on a poset always Hausdorff?

In this post two topologies on a poset $(P,\leq)$ were defined: the interval topology $\tau_i(P)$ and the order convergence topology $\tau_o(P)$. It turns out that $\tau_i(P)$ is always $T_1$ and ...
2
votes
1answer
89 views

Interval topology and order convergence topology

Throughout this post, 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 ...
4
votes
2answers
221 views

Counterexample on completely distributive lattices

I would like to see an example of a complete lattice $C$ which is both a frame and a dual-frame, i.e. finite meets distribute over arbitrary joins and finite joins distribute over arbitrary meets ...
-3
votes
2answers
85 views

does a lattice have a minimal item [closed]

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 ...
0
votes
0answers
47 views

Quasi-transitive decomposition of a transitive graph

Let $G=(V,E)$ be a simple digraph that is semi-complete (ie. there's at least one arc between each unordered pair of vertices) and quasi-transitive (ie. its complement is transitive). Is it true that ...
1
vote
1answer
49 views

monotonicity alike functions

assuming we have two smooth function ${f_1},{f_2}:{R^N} \to R$, under what condition, we have ${f_1}\left( {{{\bf{x}}_1}} \right) \ge {f_1}\left( {{{\bf{x}}_2}} \right) \leftrightarrow ...
2
votes
0answers
28 views

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

Suppose that $P$ and $Q$ are graded posets (with rank function $r$) and suppose that all maximal chains of $P$ and $Q$ have length $n$. Let $f:P \to Q$ be a surjective monotone function such that ...
3
votes
0answers
63 views

Is $\mathcal{P}(\omega)/fin$ with the interval topology path-connected?

Is $\mathcal{P}(\omega)/fin$ with the interval topology path-connected? (You find the definition of $\mathcal{P}(\omega)/fin$ here.)
3
votes
2answers
107 views

Continuous image relation on topological spaces

Let $\kappa$ be a cardinal, and let $\text{Top}(\kappa)$ be the set of topological spaces $(X,\tau)$ such that $X\subseteq \kappa$. We pre-order $\text{Top}(\kappa)$ by for $X, Y \in ...
2
votes
1answer
175 views

Normal subgroup of a totally ordered group

A totally ordered group is a group equipped with a compatible total order, that is, $x\leq y$ and $z\leq t$ imply $x+z\leq y+t$ for all $x,y,z,t$ in the group. Is it true that every totally ordered ...
5
votes
1answer
118 views

Is an open map with open relative diagonal necessarily a local homeomorphism?

Let $f : X \to Y$ be an open (and continuous) map of locales. Suppose the relative diagonal $\Delta_f : X \to X \times_Y X$ is an open embedding of locales. Does it follow that $f : X \to Y$ is a ...
5
votes
1answer
169 views

Is $\mathcal{P}(\omega)/fin$ with the interval topology a connected space?

Is $\mathcal{P}(\omega)/fin$ with the interval topology a connected space? (You find the definition of $\mathcal{P}(\omega)/fin$ here.) Remark: According to this, the interval topology of ...
5
votes
3answers
191 views

Antichain on $\mathcal{P}(\omega)/fin$ of cardinality $2^{\aleph_0}$?

We define an equivalence relation on $\mathcal{P}(\omega)$: for $x,y\in\mathcal{P}(\omega)$ we say $$x\simeq_{fin} y \text{ iff there is } n \in \omega \text{ such that } x\setminus \{0,\ldots,n\} = y ...
6
votes
1answer
82 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 ...
4
votes
1answer
228 views

Characterising subsets of the reals as ordered spaces

There are concise and elegant characterisations of the real line as a topological space and as an ordered space in the literature. I am interested in the harder case of characterising subsets of the ...
4
votes
2answers
109 views

Completion of a single totally ordered down-set

This is a follow-up question to Complete sets of incompatible totally ordered down-set in a partially ordered set. Let $(P,\leq)$ be a partially ordered set such that for every $p\in P$ the set ...
3
votes
2answers
185 views

Complete sets of incompatible totally ordered down-set in a partially ordered set

Let $(P,\leq)$ be a partially ordered set. A down-set is a set $d\subseteq P$ such that $x\in d$ and $x'\in P, x'\leq x$ imply $x'\in d$. If the down-set is totally ordered, we say it is a totally ...
3
votes
1answer
132 views

Directed Hypercube Minimal Cuts

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 ...
1
vote
2answers
100 views

Order-preserving image of a complete lattice

If $L$ is a complete lattice and $P$ is a poset and $f: L\to P$ is an order preserving surjective map, does this imply that $P$ is a (complete) lattice?
4
votes
1answer
84 views

Order-preserving images of $(\mathcal{P}(\kappa),\subseteq)$

Is there a cardinal $\kappa \neq \emptyset$ and a connected poset $P$ of cardinality $\leq \kappa$ such that there is no surjective order-preserving map from $(\mathcal{P}(\kappa),\subseteq)$ onto ...
2
votes
0answers
96 views

Isomorphic subcategories of directed graphs and presets

For the purposes of this post, a digraph (directed graph) has neither loops nor multiple parallel edges, and a preset is an ordered pair consisting of a set $S$ and a preorder (viz., a reflexive and ...