Search Results
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 |
The theory of lattices in the sense of order theory. For the number-theoretic notion, use the tag "lattices" instead.
17
votes
Accepted
Are the Boolean algebras ${\cal P}(\omega)/(\text{fin})$ and ${\cal P}(\omega)/(\text{thin})...
The answer is no.
In the Boolean algebra $P(\omega)/\text{Fin}$ every strictly descending sequence $A_0>A_1>A_2>\cdots$ has a nonzero lower bound, by the famous construction of Hausdorff. Namely, one …
6
votes
Accepted
Is every finite poset a subset of a finite complemented distributive lattice?
As Sam mentioned in the comments, the answer to question 1 is yes. One can map every condition $p$ in the partial order to the lower cone, the set $S_p=\{q\in P\mid q\leq p\}$ of conditions below $p$. …
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 …
13
votes
Accepted
Ultrafilter lemma for arbitrary lattice
It is equivalent to AC.
Consider any collection $A$ of nonempty sets, and let $\newcommand\P{\mathbb{P}}\P$ be the set of partial choice functions, so that $p\in\P$ if and only if $p$ is a partial fun …
2
votes
Infima and suprema in the "transfer" function ordering
Here is a counterexample showing that the quotient of $\text{Fct}(X,Y)$ is not necessarily a lattice.
Let $X=\{0,1,2\}$ and let $Y=\{0,1\}$. Let $g(0)=g(1)=0$ and $g(2)=1$, while $f(0)=0$ and $f(1)=f …
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 …
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 …
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 …
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$ …
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 …
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 …
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 …
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 …
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 …
4
votes
Accepted
Lattice of differences between ultrafilters
I've got it!
Theorem. The lattices of the form
$D(U,V)$ admit a complete classification by the isomorphism classes of $U$ and $V$ and the question of whether $U\neq V$.
The point is that the latti …