All Questions
Tagged with order-theory lattice-orders
538
questions
0
votes
1
answer
37
views
Galois connections give rise to complete lattices
I am reading Introduction to Lattices and Order, second edition, by Davey and Priestly. On page 161, it says
Every Galois connection $(^\rhd,^\lhd)$ gives rise to a pair of closure operators, $^{\rhd\...
-2
votes
0
answers
23
views
The supermodularity of probability of intersection [closed]
Given a finite sample space $E$, let $E=\{A_1,A_2,\dots,A_n\}$ be a collection of random events.Then, is $f(S)=\mathbb{P}\{\cap_{A_i\in S}A_i\}$ a supermodular function for $S\subseteq E$?
0
votes
0
answers
22
views
If sub-universe $S$ of lattice has congruence $\theta$, does the lattice have a congruence $\lambda = \theta \cap S^2$? [duplicate]
Let $(L, \lor , \land )$ be a lattice and $S$ a sub-universe of the lattice. A sub-universe of a lattice will be any subset of the lattice set that is non-empty and closed under $\land$ and $\lor$. ...
0
votes
0
answers
41
views
Understanding the definition of congruences over a lattice
Let $(L, \land, \lor)$ a lattice and $\theta$ a binary relation over $L$. We say $\theta$ is a congruence iff
$$
x_0\theta x_1, y_0 \theta y_1 \Rightarrow (x_0 \lor y_0)\theta(x_1 \lor y_1)
$$
(and ...
0
votes
1
answer
45
views
Number of lattices over a finite set
I'm interested in finding a general formula for the number of lattices possible over a finite set $S$ as a function of the set's cardinality.
For instance, how many lattices over $\{1, 2, 3\}$ are ...
0
votes
0
answers
53
views
Extending the $M_3,N_5$ theorem from distributive lattices to frames
It is known that a lattice $L$ is distributive if and only if it does not contain the diamond $M_3$ or the pentagon $N_5$ as sublattices.
A complete lattice is one in which every subset has an infimum ...
0
votes
1
answer
50
views
Congruences on the pentagon lattice $\mathcal{N}_5$
Let $\mathcal{N}_5$ refer to the Pentagon lattice, or the lattice generated by the set $\{0, a, b, c, 1\}$ subject to $1 > a$, $1 > c$, $a > b$, $b > 0$ and $c > 0$.
My aim is to find ...
1
vote
1
answer
52
views
Lattice with supermodular height function is lower semimodular
Question
Let $(L,\leq)$ be a lattice of finite length and let its height function $h$ be supermodular, meaning that
$$h(x \wedge y) + h(x \vee y) \geq h(x) + h(y) \quad \forall x,y\in L.$$
Does it ...
1
vote
1
answer
27
views
How to get the distributive law for an l-group?
In Birkhoff an l-group G is defined as a group that is also a poset and in which group translation is isotone:
\begin{gather*}
x\leq y\implies a+x+b\leq a+y+b\;\forall a,x,y,b\in G,
\end{gather*}
and ...
2
votes
1
answer
56
views
How to get the height function for modular lattices?
In these notes, it is said that for modular lattices of finite lengths the height function
\begin{gather*}
h(x)=lub\{l(C):C=\{x_0,...,x_n:x_0=O\prec...\prec x_n=x\}\}
\end{gather*}
obeys
\begin{gather*...
1
vote
1
answer
51
views
Alternative characterization of distributive lattice
Let $(X,{\leq},{\wedge},{\vee})$ be a lattice.
The lattice is called distributive if for all $x,y,z\in X$ both distributive laws hold:
$$
x \wedge (y \vee z) = (x \wedge z) \vee (y \wedge z)
\quad\...
2
votes
1
answer
53
views
Möbius function of distributive lattice only takes values $\pm 1$ and $0$.
In this Wikipedia article, I found the statement
[...] shares some properties with distributive lattices: for example, its Möbius function takes on only values 0, 1, −1.
My question is: How it can ...
2
votes
1
answer
42
views
The join of two set partitions in the refinement order
Let $X$ be a set. The set $\Pi_X$ of all partitions of $X$ is partially ordered via the refinement order, which is defined by $\alpha \leq \beta$ if and only if for each block $A\in \alpha$ there is a ...
0
votes
1
answer
36
views
Reconstructing a closure operator from a set of fixed points
Let $L$ be a lattice, not necessarily complete. We define a closure operator as a function $f\colon L\to L$ which is:
idempotent, $f(f(x)) = f(x)$,
isotone, $x\leq y \Rightarrow f(x) \leq f(y)$,
...
4
votes
0
answers
72
views
Zorn's lemma: counterexample to chain with upper bound?
The premise required for invoking Zorn's lemma is that every chain in $X$ have an upper bound. So that makes me wonder: what is a good example of a poset $X$ for which that property is false? That is ...