The length of chains in modular algebraic lattices

Abstract: We study how the existence in an algebraic lattice

L

of a chain of a given type is reflected in the join-semilattice

K (L)

of its compact elements. We show that for every chain

a l p h a

of size

k a p p a

, there is a set

B

of at most

2^{k a p p a}

join-semilattices, each one having a least element such that an algebraic lattice

L

contains no chain of order type

I (a l p h a)

if and only if the join-semilattice

K (L)

of its compact elements contains no join-subsemilattice isomorphic to a member of

B

. We show that among the join-subsemilattices of

[o m e g a]^{< o m e g a}

belonging to

B

, one is embeddable in all the others. We conjecture that if

a l p h a

is countable, there is a finite set

B

.

Cites Work

Cited In (7)

This page was built for publication: The length of chains in modular algebraic lattices