Exercise 7, § 4
Tag 03LK, permanent. Cite it as [Bourbaki, Tag 03LK].
Theory of Sets, III, 232
An element of a lattice is said to be irreducible if the relation implies either or .
(a) Show that in a finite lattice every element can be written as , where the () are irreducible.
(b) Let be a finite lattice and let be the set of its irreducible elements. For each let be the set of all which are . Show that the mapping is an isomorphism of onto a subset of , ordered by inclusion, and that .
Solution
No solution has been written yet.
Cited by
Cites
Nothing.