Lattices are partially ordered sets such that a least upper bound and a greatest lower bound can be found for any subset consisting two elements. Lattice theory is an important subfield of order theory.

learn more… | top users | synonyms

0
votes
1answer
11 views

Every subgroup of a cyclic group is characteristic (using lattice theory).

I want to show for $n\in\Bbb N$, which is not square-free, that every subgroup of $Z_n=\langle x\;|\;x^n\rangle$ is characteristic. But I want to show it in a convoluted way. Every automorphism ...
0
votes
0answers
22 views

Any projection of a complete semilattice is a homomorphism

Let $\langle D, \leqslant \rangle$ be a poset. A mapping $\psi \colon D \to D$ is called a projection (or kernel operator) if it satisfies the following conditions: $\psi(x) \leqslant x$, $x ...
2
votes
2answers
91 views

Equivalence between middle excluded law and double negation elimination in Heyting algebra

It's well-know that in intuitionistic logic, middle excluded law and double negation elimination are equivalent. For example, in Johnstone - Topo theory, I read that, in a Heyting algebra, $p\vee\neg ...
2
votes
0answers
86 views
+50

Uniqueness of the direct product decomposition of inclusions of finite groups

This post is a generalization of Uniqueness of the direct product decomposition of finite groups. Here we look inclusions of finite groups $(H \subset G)$ instead of just finite groups. Definition: ...
1
vote
1answer
30 views

Irreducible elements in a Lattice.

Let $L$ be a lattice. We say that $a\in L$ is irreducible if for every $b,c\in L$ such that $a=b\vee c$ we can conclude that $a=b$ or $a=c$. If $L$ is a finite lattice prove that every element ...
3
votes
1answer
81 views

A conjecture about filters and finite unions of cartesian products

Let $U$ be some set. Let $\Gamma$ be the set of all finite joins of cartesian products ($X_1 \times Y_1 \cup \dots \cup X_n \times Y_n$) of sets on $U$. Obviously, $\Gamma$ is a a distributive ...
0
votes
1answer
8 views

closedness of a sublattice under complements

Let $A$ be a bounded sublattice of the bounded lattice $(X,\le)$ with $$\max A=\max X, ~~\min A=\min X$$ Let $a,b\in X$ be complements and $a\in A$. Is $b\in A$?
0
votes
1answer
21 views

Finite Linearly Ordered Abelian Monoids

This question concerns the proper definition of the phrase "finite linearly ordered abelian monoids". The sequence A030453 of OEIS counts the number of "finite linearly ordered abelian monoids". The ...
0
votes
0answers
10 views

A standard terminology for different definitions of complete sublattice

Let $(X,\le)$ be a complete lattice and $A\subseteq X$. I'm trying to find a standard terminology for special types of sublattice. What is $A$ called if $(A,\le_A)$ is a complete lattice. ...
4
votes
1answer
105 views

Who first studied semilattices?

Historically, who first studied semilattices, as opposed to lattices or Boolean algebras? (With or without identity, I do not mind.)
0
votes
0answers
31 views

traingular matrix

I am not much in to the matrices. so I am sorry if I can not put forward the question properly. Assume $G_{n\times n}$ is a rank $n$ matrix (Indeed $G$ is the generator matrix of a lattice). I need ...
2
votes
1answer
29 views

Lattice homomorphism induced by topology homeomorphism?

My book mentions this. However, I am not seeing why 1. and 2. are true. I guess part of the problem is that the lattice (homomorphic) map induced by the continuous topology map isn't even defined on ...
0
votes
1answer
43 views

Definition of Jordan–Dedekind chain condition

Let $(X,\le)$ be a lattice. Which is the correct definition for Jordan-Dedekind condition: 1) all maximal chains in $X$ have the same cardinality. 2) for any interval $I$ in $X$, all maximal chains ...
1
vote
2answers
35 views

A non-algebraic complete lattice

Do you have an example of a complete lattice which is not algebraic‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌?
1
vote
3answers
43 views

The Mini-Max theorem for lattices

I'm asking for help on an exercise in Davey and Priestleys's Introduction to Lattices and Orders. For those with the book, the exercise is specifically 2.9. Let $A=(a_{ij})$ be an $m\times n$ ...
4
votes
0answers
37 views

Self-duality in a lattice

Is there any finite self-dual lattice $(X,\le)$ such that there is not any self-duality $f:X\to X$ such that $f\circ f = 1_X$? Let $f,g:X\to X$ be a self-dualities. Then $f^{-1}\circ g$ is an ...
1
vote
0answers
25 views

How many Homomorphisms are there from one bounded lattice to another?

for a project that I work on, I need to know how many homomorphisms there are from one finite lattice with 0 and 1 to another. I remember that I already worked it out if one of them is the trivial ...
1
vote
2answers
44 views

Proving that a convex subset of a chain is the intersection of a lower segment and an upper segment of a chain.

The book I am using is very naive so AC is assumed. Call a subset $S$ of a chain $L$ a lower segment if: $x \in S$ and $a < x$ implies $a \in S$. An upper segment is defined equivalently. Call a ...
1
vote
2answers
40 views

Find the Fixed points (Knaster-Tarski Theorem)

Let $L=\mathcal P(\mathbb N)$ be a complete lattice of subsets of $\mathbb N$. a) Justify that the function $F(X)=\mathbb N \setminus X$ does not have a Fixed Point. I don't know how to solve this. ...
-3
votes
1answer
141 views

Crazy Set Theory Analogies

I think the following analogies are too interesting to be ignored: Union = Least Common Multiple If $G_1,...,G_n$ denote a number of sets of points (either linear or in any number of dimensions), ...
0
votes
1answer
27 views

The lattice of closed subsets of an algebraic closure operator is an algebraic lattice

Let $A$ be a set. Let $C:Su(A)\longrightarrow Su(A)$ be a function, where $Su(A)$ denotes the set of all subsets of $A$. Suppose that 1) $X\subseteq C(X)$ 2) $X\subseteq Y\rightarrow C(X)\subseteq ...
2
votes
1answer
53 views

Lattice Path Spaces.

It is well known that the number of paths from $(0,0)$ to $(n,k)$ in $\mathbb{N^2}$ with the set of steps $\{(1,0),(0,1)\}$ is ${n+k \choose k}$. This is the minimum number of steps needed to get to ...
5
votes
1answer
44 views

In a lattice, does $x \vee y \leq x\vee z$ and $x \wedge y \leq x\wedge z$ imply $y\leq z$?

Let $L$ be a lattice and $x,y,z\in L$. If $y \leq z$, then clearly $x\vee y \leq x\vee z$ and $x\wedge y \leq x\wedge z$. Now I wonder about the reverse direction. In general, $x\vee y \leq x\vee z$ ...
1
vote
1answer
45 views

Distributive lattices and Birkhoff theorem

I am trying to prove the teorem (Birkhoff) $L$ is a nondistributive lattice iff $M_5$ or $N_5$ can be embedded into $L$ The only part of the proof which I can't understand is this (I am copying from ...
3
votes
0answers
52 views

number of Lattice paths from origin to diagonal after removing vertices

i am stuck with the following problem: consider the quarter plane $\mathbb{N}_0^2$ with vertices $(i,j)\in\mathbb{N}_0^d$ and edges from each vertex $(i,j)$ to $(i+1,j)$ and $(i,j+1)$, i.e. one ...
6
votes
1answer
52 views

Lattice-Theoretic Interpretation of the Fundamental Theorem of Arithmetic

When equipping $\mathbb{N}^\ast=\mathbb{N}\setminus \{0\}$ with the divisibility relation, it forms a lattice with minimum 1, supremum given by the least common multiple, and infimum given by the ...
5
votes
0answers
104 views

Is there such a thing as 'overtification' (dual to compactification)?

The dual to the notion of compactness for spaces is overtness. This duality is not manifest in the category of spaces but rather in the quantifiers used to define these notions. Is there a process ...
0
votes
1answer
57 views

Lower bounded lattice to complete lattice

My problem is to show that any lower-bounded lattice satisfying the maximal condition is a complete lattice. Let's call the lattice $L$. I'm having some trouble with this. I have tried to look at it ...
1
vote
2answers
25 views

uniqueness of order-isomorphisms for a finite lattice

Let $(X,\le)$ be a finite lattice and $f,g:(X,\le)\to (X,\le^{-1})$ be order-isomorphisms. Is $f$ the same as $g$‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌‌?
0
votes
1answer
40 views

Help to conceive a name

Filter $F$ is defined by the formula $$A\cap B\in F \Leftrightarrow A\in F\wedge B\in F.$$ Ideal $F$ is defined by the formula $$A\cup B\in F \Leftrightarrow A\in F\wedge B\in F.$$ In my book I ...
0
votes
1answer
49 views

Defining principal elements of every poset. Is this a new idea?

Fix an arbitrary complete lattice $\mathfrak{A}$ with order $\sqsubseteq$. I call elements $a,b\in\mathfrak{A}$ intersecting and denote $a\not\asymp b$ iff there is a non-least element ...
0
votes
1answer
37 views

increasing subset of a partial order and characteristic function

Can someone help me understand this? Suppose that $\preceq$ is a partial order on a set $S$ and that $A\subseteq S$. If $\mathbf{1}_A$ is the indicator function then $A$ is increasing if ...
0
votes
0answers
31 views

the indicator function of a increasing poset [duplicate]

Can someone help me understand this If $X$ is a poset, $X'$ is a subset of $X$, and $X\cap[x,\infty)$ is a subset of $X'$, then $X'$ is an increasing set. Equivalently, a subset $X'$ of a poset $X$ ...
1
vote
1answer
24 views

Are surjective order-homomorphisms necessarily complete lattice homomorphisms?

Let $X$ and $Y$ denote complete lattice, and suppose $f : X \rightarrow Y$ is a surjective order-homomorphism. Does $f$ necessarily preserve arbitrary suprema, therefore being a complete lattice ...
0
votes
2answers
32 views

Show that B has infimum

Let $(A,\leq)$ is a lattice. if $B\subseteq A$ and $|B|=3$ then show that there is $\inf(B)$ If A is a lattice we know for every $x,y\in A$ there are $\inf\{x,y\}=x\wedge y $ and ...
1
vote
1answer
38 views

Dense Boolean subalgebras

I was reading this page and, in the third part of the first remark I found the definition of dense sub-algebra of a Boolean algebra. It is stated that there are various equivalent definitions of this ...
0
votes
1answer
24 views

Monotone log-supermodular function is supermodular.

Let $X$ and $Y$ be lattices. Let $f: X \times Y \rightarrow \Re$. Function $f$ is log-supermodular if for all $x'>x$ and $y'> y$ \begin{equation} f\left(x', y'\right)f\left(x, y\right) \geq ...
4
votes
0answers
47 views

Closure operators and complete lattices.

A closure operator on a set $A$ is a function $C: \mathcal{P}(A) \to \mathcal{P}(A)$ satisfying following axioms: $X ⊆ Y \implies C(X) ⊆ C(Y)$ $X ⊆ C(X)$ It may also satisfy some additional ...
0
votes
1answer
27 views

Lattice inside a finite dimensional vector space

I have an integral domain $R$ and its field of fractions $K$. Let $V$ be a finite dimensional $K$ vector space. Let $M$ be a finitely generated $R$-module contained in $V$. Why is $K\cdot M=V$ ...
3
votes
2answers
37 views

All tree orders are lattice orders?

Say that a set is tree ordered if the downset $\downarrow a =\{b:b\leq a\}$ is linearly ordered for each $a$. In a comment, Keinstein says that such sets are also semi-lattices, provided they are ...
4
votes
4answers
68 views

Number of join-irreducible elements of a lattice: is it monotonic?

Let $\mathcal L$ be a sub-lattice of $\mathcal P(X)$, where $X$ is a finite set. Denote by $\mathcal I(\mathcal L)$ the set of union-irriducible elements of $\mathcal L$ (i.e. $A\in \mathcal ...
1
vote
1answer
54 views

What is $|Aut(D_n,|)|$?

Let $n=p_1^{\alpha_1}\dots p_k^{\alpha_k}$ with the $p_i$ distinct primes and $ \alpha_i\in \Bbb N$. Just to check if I'm correct, is it true that $k!$ is the number of order-isomorphisms of the form ...
2
votes
3answers
67 views

Example of a bounded lattice that is NOT complete

I know that every complete lattice is bounded. Is there a simple example for a bounded lattice that is not complete? Thank you
0
votes
1answer
115 views

Is every sub-lattice of $\mathcal P(X)$ isomorphic to a sub-lattice of $\mathcal P(X')$ containing singleton sets?

Let $X$ be a finite set. $\mathcal{P}(X)$ denotes the set of all subsets of $X$. Let $\Gamma$ be a sub-lattice of $\mathcal{P}(X)$, i.e. $\Gamma$ is a collection of subsets of $X$ closed under union ...
1
vote
0answers
19 views

Proving isomorphism in lattices

The question is as follows: Let f be a monomorphism from a lattice $L$ to a lattice $M$.Show that $L$ is isomorphic to a sublattice of $M$. My attempt: Since $f$ is a monomorphism from a lattice ...
1
vote
1answer
13 views

extension of an increasing function over a lattice

Let $X$ be a finite set. $\mathcal{P}(X)$ denotes the set of all subsets of $X$. Let $\Gamma$ be a sub-lattice of $\mathcal{P}(X)$, i.e. $\Gamma$ is a collection of subsets of $X$ closed under union ...
2
votes
0answers
31 views

Lattice with $3$ operations.

If $R$ is a commutative ring and $\mathcal I(R)$ denotes its set of ideals then I know that $\mathcal I(R)$ can be looked at as a complete lattice with intersection $I\cap J$ and addition $I+J$ as ...
0
votes
0answers
49 views

Exercise 1.17 from Bell & Slomson's Models and Ultraproducts

I'm attempting to prove the following theorem left as an exercise from Bell & Slomson's Models & Ultraproducts (1969). I'd like to know whether my attempted proof is correct, and if not, I'd ...
3
votes
2answers
84 views

Examples of Stone algebras which are not Boolean algebras

Grätzer, in his Lattice Theory: Foundation, describes a Stone algebra as a distributive lattice with pseudocomplementation $L$ which satisfies the Stone identity: for every $a \in L$, $\neg a \vee ...
1
vote
2answers
50 views

When do DeMorgan's laws hold in a Heyting algebra

I'm working a bit with Heyting algebras (which are pseudocomplemented distributive lattives, right?) and I have a question about DeMorgan's laws. I know that, in general, it's not the case that $-(X ...