The tag has no wiki summary.

learn more… | top users | synonyms

9
votes
2answers
302 views

Extending a partial order while preserving an automorphism

It is well known that if $(P, \leq)$ is a partial order then $\leq$ can always be extended to a linear order. This is sometimes called Szpilrajn´s theorem although it had been previously proved by ...
2
votes
2answers
331 views

Embedding a brouwerian lattice into a boolean lattice

I have already asked a similar question at http://math.stackexchange.com/questions/470704/can-a-brouwerian-lattice-be-extended-into-a-boolean-algebra but have received no answer. Sorry, I ask a ...
2
votes
2answers
193 views

When is a filter generated by a (countable) chain?

In any partial order $(P,\leq)$ it is easy to see that every chain generates (i.e., by taking the upwards closure) a filter, and any filter built as a result of the Rasiowa-Sikorski lemma in forcing ...
7
votes
1answer
344 views

A characterization of the poset of filters on a set

For the lattices of all subsets of a given set it is known an axiomatic characterization: A poset is isomorphic to a set of all subsets of some set iff it is a complete atomic boolean algebra. The ...
10
votes
3answers
167 views

Maximal chains in a quasi-order of linear order types

Let $\mathcal{T}_\kappa$ be the set of all linear order types of cardinality $\kappa$. Let $\prec$ denote a binary relation on $\mathcal{T}_\kappa$ representing embeddability of order types (note that ...
7
votes
1answer
270 views

What kind of category is a cyclically ordered set?

Background: A preorder is a binary relation $\leq$ which is reflexive and transitive. We can write the transitive property as ${\leq}(a,b)\wedge{\leq}(b,c)\to{\leq}(a,c)$. There are additional axioms ...
3
votes
1answer
120 views

For what classes of comparability graphs are their complements also comparability graphs?

An interval graph is an intersection graph of real intervals, that is, an undirected graph whose vertices can be labeled with real intervals so that there is an edge between two vertices iff their ...
6
votes
1answer
203 views

Terminology question for poset maps

Is there a standard name for order-preserving maps $f\colon P\to Q$ of posets with the property that the image of a lower set is a lower set, or equivalently if $q\leq f(p)$ then there exists $p'\leq ...
7
votes
1answer
300 views

What should the morphisms in the Category of Directed Sets be?

Directed sets are defined to be sets equipped with a preorder that admit (finitary) upper bounds e.g. pairs $(D, \preceq)$ such that $\forall p,q \in D$ there exists $r \in D$ such that $p \preceq r$ ...
4
votes
2answers
348 views

Projections in a W*-algebra as a continuous lattice?

A continuous lattice is a complete lattice $L$ in which every element $y$ is equal to $\bigvee${$x \in L \mid x \ll y$} where $x \ll y$ ("x approximates y" or "x is way below y") if for any directed ...
2
votes
1answer
103 views

References on countable W*-algebras

In "Operator algebras with a faithful weakly-closed representation" (1955), Kadison describes a countable W*-algebra as a C*-algebra which has a faithful representation as a countably decomposable ...
10
votes
1answer
571 views

Can all aleph_2-dense subsets of R be isomorphic?

Let $\kappa$ be an infinite cardinal. For a subset $A \subseteq \mathbb{R}$, we say that $A$ is $\kappa$-dense if $|A \cap (a, b)| = \kappa$ for every interval $(a, b)$. By Cantor, any two ...
21
votes
3answers
506 views

Is it possible to construct an infinite subset of $\Bbb R$ that is not order isomorphic to any proper subset of itself?

Is it possible to construct an infinite subset of $\Bbb R$ that is not order isomorphic to any proper subset of itself?
11
votes
2answers
424 views

How many subsets of $\mathbb{R}$ are order isomorphic to $\mathbb{Q}$?

How many subsets of $\mathbb{R}$ are order isomorphic to $\mathbb{Q}$? How many subsets of the long line $\omega_1\times[0,1)$ are order isomorphic to $\mathbb{Q}$? I can see that results in ...
12
votes
2answers
317 views

What is the least ordinal than cannot be embedded in $\mathbb{R}^\mathbb{R}$?

Let $\mathbb{R}^\mathbb{R}$ be the set of functions $\mathbb{R}\to\mathbb{R}$ patially ordered by eventual domination. Obviously, every ordinal below $\omega_1$ can be embedded in ...
10
votes
2answers
323 views

Do operations generate well-ordered sets only?

I've read   @TauMu's question   about the set of functions   $\mathbb N\rightarrow\mathbb N$   generated from the identity map by repeatedly applying exponentiation of two already ...
23
votes
2answers
414 views

Order type of the smallest set containing the identity function and closed under exponentiation

Let $E$ be the smallest set of functions $\mathbb{N}^+\to\mathbb{N}^+$ containing the identity function $n \mapsto n$ and closed under exponentiation $(f,g) \mapsto \left(n \mapsto ...
16
votes
2answers
254 views

Is it possible to reconstruct an order type from its initial segments?

Suppose $T$ is a totally ordered set without a maximal element, $\tau$ is the order type of $T$, $S$ is the set of order types of all proper initial segments (downward closed subsets) of $T$. Is ...
10
votes
1answer
222 views

Order dimension and weak poset partitions

The order dimension of a poset $(P,\leq)$ is the least number of linear extensions of $(P,\leq)$ such that the intersection of these extensions is $(P,\leq)$. The wikipedia entry provides some ...
1
vote
0answers
90 views

Set of upper bounds is finite for any finite subset

Is there a term to describe a preordered set $P$ in which any finite subset $S \subset P$ has at most finitely many minimal upper bounds? The preordered sets I'm studying generally aren't ...
0
votes
2answers
236 views

Order-isomorphic down-set lattices

Let $X$ be an ordered set. A down-set (also called a lower set or an order ideal) of $X$ is a subset $D$ of $X$ such that for every $x, y \in D$, if $x \in D$ and $y \leq_X x$, then $y \in D$. The ...
0
votes
1answer
111 views

Counting linear extensions of unlabeled series parallel structures

I am interested in the problem of counting the number of linear extensions of series-parallel structures. The wikipedia article at http://en.wikipedia.org/wiki/Series-parallel_partial_order pointed me ...
5
votes
1answer
255 views

Rotation-invariant strict-inclusion-preserving preorderings on subsets of the circle

Say that a preordering $\le$ on a set of subsets of some space preserves strict inclusion provided that $A\lt B$ whenever $A\subset B$ (where $A\lt B$ iff $A\le B$ and $B \not\le A$). Let the space ...
4
votes
4answers
434 views

Why do we choose the standard total order on the integers?

I understand why the set of natural numbers $\mathbb N = \{ 0, 1, 2, \cdots \}$ is equipped with a total order. Indeed, every monoid has a pre-order, where $$n' \succeq n \quad \mathrm{if~and~only~if} ...
0
votes
2answers
223 views

Reference Book for supremum and infimum theorems

For my work I need many of the very easy and basic properties of suprema and infima. While they are all pretty easy to prove, I would prefer to refer to a standard text book. However I did not find ...
1
vote
0answers
51 views

Looking for a uniform explanation of algebras with canonical generators.

Let $\mathcal{V}$ be a finitary variety i.e. the algebras for a signature whose operations have finite arity and for some arbitrary set of equations. Then any algebra $A \in \mathcal{V}$ has a ...
2
votes
1answer
122 views

Distributive lattice embedding into a finite lattice.

Suppose one has an inclusion $\iota : D \hookrightarrow S$ where $D$ is a finite distributive lattice and $S$ is a finite join-semilattice. If $\iota$ preserves all meets and joins one can show that ...
9
votes
1answer
314 views

Is there a natural measurable structure on the $\sigma$-algebra of a measurable space?

Let $(X, \Sigma)$ denote a measurable space. Is there a non-trivial $\sigma$-algebra $\Sigma^1$ of subsets of $\Sigma$ so that $(\Sigma, \Sigma^1)$ is also a measurable space? Here is one natural ...
2
votes
2answers
312 views

Banach lattice subspace of $C([0,1])$ not a sublattice

This is probably easy, but I did not see it in standard texts. Describe a closed subspace $V$ of $C([0,1])$ such that $V$ is a Banach lattice (in the pointwise ordering), but $V$ is not a sublattice ...
0
votes
1answer
288 views

Lattice ordered group

Does there exist a lattice-ordered group of rational rank $1$? This is true for totally ordered group.
1
vote
1answer
124 views

Covering of a partial order by upwards convex sets

First off: I'm not an expert in order theory, so some of my terms might be off; correct them if you wish. Let me call a subset $A$ of a lattice $(S,\le)$ upwards convex (not sure if that's actually ...
4
votes
2answers
274 views

Cardinality of Equivalence Relation of Eventually Sublinear Functions

Let $\Bbb{R}^{+}\_{0}$ be the set of non-negative real numbers and $\Bbb{R}^{+}$be the set of positive reals. Let us say that a function $f \colon \Bbb{R}^{+}\_{0} \to \Bbb{R}^{+}\_{0}$ is eventually ...
1
vote
0answers
185 views

existence of order preserving map [closed]

suppose A is a linear order set with a copy of rationals in it that is $A=B\cup\{\bar{r}:r\in\mathbb{Q}\cap[0,1]\}$. is there an orde preserving map that preservs sup and inf betwwen A and $[0,1]$ in ...
2
votes
1answer
169 views

Is there research on the notion of co-accessibility?

I want to start off with a disclaimer that I am only a mathematical amateur. Please forgive me for ignorance or any non-standard nomenclature I use here :) Let's start off with some context. Let X ...
5
votes
1answer
224 views

Complete anti-chain lattices and the axiom of choice

Hello, everyone. I'm trying to find out about lattices of anti-chains, and was wondering whether you could help me with getting to grips with a Comp. Sci. paper I'm struggling with. I've been reading ...
2
votes
1answer
222 views

Cardinality of group of order-preserving functions from R to R

The title pretty much says it all. What is the cardinality of $G$, the group of all functions $f: \mathbb{R} \to \mathbb{R}$ such that $\forall x,y\in \mathbb{R} \left( x>y\Rightarrow ...
6
votes
1answer
241 views

Is it possible to decide in polynomial time if a poset is a subposet of another which is given ?

I am reading some theory on partial orders and I wonder something which perhaps has a simple answer : Given two partial orders $G_1,G_2$ (by their hasse diagrams), is it possible to know in ...
4
votes
1answer
312 views

Uncountable orderings

Let $P$ be an uncountable linear ordering. Is it true that either $P$ contains an order-copy of $\omega_1$ or there is $x_0\in P$ such that there exist uncountably many distinct $y\in P$ with $y< ...
4
votes
2answers
296 views

Definition of continuous functions in order theory

If we have a complete partial order (i.e. directed complete) I find frequently the following definition of a continuous function. A function $f:A\to B$ where $A$ and $B$ are cpos is called continuous ...
3
votes
2answers
158 views

A linearly orderable monoid which does not embed into a linearly orderable group

It is known (after an example of A.I. Mal'cev) that there exist cancellative semigroups which do not embed into a group. On the other hand, it is not difficult to see that every linearly orderable ...
0
votes
0answers
218 views

Transitive closures and inductive reasoning [solved]

Let's say that r is an endorelation over A (i.e. $r$ is a subset of $A \times A$), $\bar{r}$ is the transitive closure of r (i.e. the least set containing r and being transitive). Furthermore $r$ has ...
0
votes
1answer
164 views

wellfounded sets and predecessors

Following question: Let's assume that W is a wellfounded set, i.e. it has a partial order and every nonempty subset of W has minimal elements with respect to the order. Now we can easily define a ...
1
vote
0answers
125 views

How many more join-irreducibles can there be in a sub join-semilattice of a finite lattice?

Let $L$ be a finite lattice. Then $L$ is generated by its join-irreducible elements $J(L)$ or alternatively its meet-irreducible elements $M(L)$. If $S \subseteq L$ is a sub join-semilattice then ...
2
votes
0answers
117 views

Generalization of order dimension and interval orders

A partial order $(X, <_X)$ has order dimension $n$ if it can be realized as the product order of $n$ total orders, which means that there is an order-embedding between $(X, \lt_X)$ and $(Y^n, ...
2
votes
3answers
295 views

A characterisation of Boolean algebras

Let $M$ be a meet-semilattice with a least element $0$. Suppose there is an order-reversing involution $a \mapsto -a$ on $M$ such that for all $a, b \in M$, $a \wedge b = 0$ if and only if $b \le ...
1
vote
1answer
192 views

Strictly totally ordered semigroups - Looking for references

Let $\mathfrak A = (A, \cdot)$ be a semigroup (written multiplicatively). We say that $\mathfrak A$ is linearly orderable if there exists a total order $\le$ on $A$ such that $ac < bc$ and $ca < ...
4
votes
1answer
300 views

Characterizing $\omega_1$-like dense linear orderings

I recently came upon the following theorem which was attributed to J. Conway: For each $A\subset \omega_1$, let $\Phi(A)$ be a linear ordering of type $\sum_{\alpha<\omega_1} \tau_\alpha$, where ...
6
votes
1answer
397 views

Strictly order preserving maps into the integers

If $P$ and $P'$ are partial orders, a strictly order preserving map from $P$ to $P'$ is an $f:P\to P'$ satisfying that $x\lt y$ implies $f(x)\lt f(y)$ for all $x,y\in P$. An interval in $P$ is a set ...
3
votes
2answers
435 views

Cantor theorem on orders

It is "a well-known theorem of Cantor", said Sierpinski (circa 1920), that every countable total order can be imbedded in the rationals, and he proceeds to demonstrate that, assuming the continuum ...
0
votes
1answer
376 views

A property of a product of posets

Let $\mathfrak{A}$ is a poset. For $a, b \in \mathfrak{A}$ we will denote $a \curlyvee b$ if only if there is a non-least element $c$ such that $c \leqslant a \wedge c \leqslant b$. I call a poset ...