From join-irreducibles to dimension theory for lattices with chain conditions

Abstract

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\L on J(L). We establish a similar version of this result for the dimension monoid Dim L of L, a natural precursor of Con L. For L join-semidistributive, this result takes the following form: Theorem 1. Let L be a finite join-semidistributive lattice. Then Dim L is isomorphic to the commutative defined by generators D(p), for p in J(L), and relations D(p) +D(q) = D(q), for all p, q in J(L) such that p D\L q . As a consequence, we obtain the following results: Theorem 2. Let L be a finite join-semidistributive lattice. Then L is a lower bounded homomorphic image of a free lattice iff Dim L is strongly separative, iff it satisfies the quasi-identity 2x=x implies x=0. Theorem 3. Let A and B be finite join-semidistributive lattices. Then the box product A B f A and B is join-semidistributive, and Dim(A B) is isomorphic to Dim A Dim B, where denotes the tensor product of commutative monoids.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…