Published October 19, 2026 | Version v1

Ascending chains of sublattices in free lattices

  • 1. University of Bologna

Description

We prove that every increasing sequence of free sublattices of bounded finite rank in a free lattice is eventually constant. In particular, there is no infinite strictly increasing chain of copies of the free lattice on three generators, answering negatively a question of R. A. Dean recorded in 1997. Freeness is essential: we construct in the three-generated free lattice an infinite strictly increasing chain of pairwise nonisomorphic retracts, each requiring exactly three generators. The corresponding retractions commute. We also give a proper self-embedding whose fixed-point sublattice contains a free copy of the ambient lattice, and prove that the stable image of every endomorphism of a finitely generated free lattice consists precisely of its periodic points.

GitHub repository

Files

main.pdf

Files (459.6 kB)

Name Size
md5:97b3e5269918027a2b5470ebd8cd95ca
408.6 kB Preview Download
md5:013149258131cbb6c9f8b32532147d65
51.0 kB Download

Additional details

Funding

European Commission
Data Analysis Technologies (DAT) 101077154
Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni
GNSAGA of the Istituto Nazionale di Alta Matematica (INdAM)
University of Bologna