# Tagged Questions

41 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 ...
27 views

52 views

161 views

### Stone duality for ideals and filters (exercise)

In A Course in Universal Algebra (Burris, Sankapannavar), the exercise 4.4.7-8, p.158, says: Let $A$ be a Boolean algebra. Denote $A^\ast:=\{\text{ultrafilters of }A\}$, and give $A^\ast$ the ...
148 views

### correspondence for universal subalgebras of $U/\vartheta$

Let $U$ be a universal algebra of type $T$, and denote $\mathrm{Con}(U)\!=\!\{\text{congruence relations on }U\}$ and $\mathrm{Sub}(U)\!=\!\{\text{subalgebras of }U\}$. Let "$\leq$" mean "subalgebra". ...
133 views

### $M_3$ is a simple lattice

I'd like to prove (exercise 9.5 in Roman's Lattices and Ordered Sets, p.203) that the lattice $M_3$ is simple, meaning that the only congruences on $M_3$ are the trivial ones (the 'equality' ...
114 views

### ideals of a ring form a modular lattice

We know that if $M$ is a left $R$-module, then $(\{\text{submodules of }M\},\subseteq)$ is a modular lattice. Taking $M\!=\!R$, we deduce that $(\{\text{ideals of }R\},\subseteq)$ is a modular ...
214 views

### Lattices are congruence-distributive

$\newcommand{\r}[1]{\mathrel{#1}}$ First, a few definitions. Given a lattice $L$, a congruence on $L$ is an equivalence relation $\theta$, compatible with the lattice operations, i.e. if ...