Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 1946

The theory of lattices in the sense of order theory. For the number-theoretic notion, use the tag "lattices" instead.

3 votes

Order-preserving image of a complete lattice

No, clearly not, because you could put junk on top. But even if you avoid this by insisting that the map is surjective, there are counterexamples. Consider the map of Eric Wofsey's recent answer, wh …
Joel David Hamkins's user avatar
3 votes

Order (a,b) ≤ (a',b') iff b ≤ a' or (b' = b and a ≤ a') where a≤b and a'≤b'

If the ambient order is a lattice, they your order is indeed a lattice order. To see this, suppose that we have intervals (a,b) and (a',b'), in your sense that $a\le b$ and $a'\le b'$. If $b\lt b'$, t …
Joel David Hamkins's user avatar
3 votes

Proof of glb and lub of lexicographic product of poset

Surely this information is in Ralph Mackenzie's book on universal algebra. But let me just sketch some quick proofs. First, note that you were right to consider complete lattices, since in general t …
Joel David Hamkins's user avatar
1 vote

Minimal (semi)lattice containing a given poset

Every separative partial order $P$ has a unique completion as a complete Boolean algebra, which is of course a complete complemented lattice, and that construction shares certain similarities with the …
Joel David Hamkins's user avatar
3 votes
Accepted

When is this topology compatible with the partial ordering?

One of the standard topologies to consider would be the lower-cone topology, whose basic open sets are the lower cones $i{\downarrow}=\{j\mid j\leq i\}$. In this topology, the open sets are exactly th …
Joel David Hamkins's user avatar
11 votes

LUB and GLB on a lexicographically ordered complete lattice product

There are two natural orders to put on the product of two lattices, the product order and the lexical order. Product order: (a,b) ≤ (a',b') if and only if a ≤ a' and b ≤ b' Lexical order: (a …
Joel David Hamkins's user avatar
18 votes
Accepted

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

Very nice question! They are not isomorphic. What I claim is that when we take the quotient with respect to density, there is a countably infinite antichain above $0$ having a minimal upper bound, b …
Joel David Hamkins's user avatar
9 votes
Accepted

Pseudocomplements in the lattice of topologies

Yes, and in fact, most familiar topologies do not have a pseudo-complement. To see this, notice that that it often happens with a topology $\tau$ on a set $X$ that there are non-open sets $A$ and $B$ …
Joel David Hamkins's user avatar
5 votes
Accepted

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

If there are only finitely many points, it is a lattice, and it is always an upper semi-lattice. But in the infinite case, it is not a lattice. François's comment on Fedor's answer shows that is it a …
Joel David Hamkins's user avatar
3 votes
Accepted

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

The answer is no. To see this, consider the bottoms of $K$ and $\omega^\omega$ under the pointwise $\leq$ order you have described. Both structures have a least element: The constant $0$ function i …
Joel David Hamkins's user avatar
3 votes
Accepted

Does the lattice of coverings embed in the lattice of partitions?

The answer is no, because in general there can be more proper coverings than partitions, which will prevent any injective mapping from coverings to partitions. For example, if $X$ is countably infini …
Joel David Hamkins's user avatar
3 votes

Is every Heyting algebra the Lindenbaum algebra of an intuitionistic first order theory?

Here is a partial answer in the case of complete Boolean algebras, which I claim do all arise as Lindenbaum algebras. Let $\mathbb{B}$ be a complete Boolean algebra, and suppose that $M$ is any $\math …
Joel David Hamkins's user avatar
3 votes
Accepted

Turing Machine which generates order on the set of its states

If the machine transition induces a partial order, then the machine cannot find itself in the same local configuration again after leaving it, since a partial order has no loops. It follows that the l …
Joel David Hamkins's user avatar
17 votes

Knaster Tarski theorem, example needed

You can use this to prove the Cantor-Schröder-Bernstein theorem, which asserts that whenever $A$ injects into $B$ and $B$ injects into $A$, then they are bijective. Namely, suppose that $f:A\to B$ and …
Joel David Hamkins's user avatar
4 votes
Accepted

getting one tower from two

This is a fantastic question! I spent the whole morning thinking about it, and I finally have a solution. The answer is no, not necessarily. To build a counterexample, I claim first that there is a …
Joel David Hamkins's user avatar

15 30 50 per page