Length-preserving extensions of semimodular lattices by lowering join-irreducible elements
G\'abor Cz\'edli

TL;DR
This paper introduces a method to extend semimodular lattices while preserving length, allowing for the lowering of join-irreducible elements, and provides shorter proofs for several known extension results.
Contribution
It develops a length-preserving extension technique for semimodular lattices, generalizes the correspondence with Faigle geometries, and simplifies proofs of existing theorems.
Findings
Established a lowering construction for join-irreducible elements.
Proved a general theorem on length-preserving extensions.
Unified and shortened proofs of previous extension results.
Abstract
We prove that if is a join-irreducible element of a semimodular lattice of finite length and in such that does not cover , then can be "lowered" to a covering of by taking a length-preserving semimodular extension of but not changing the rest of join-irreducible elements. With the help of our "lowering construction", we prove a general theorem on length-preserving semimodular extensions of semimodular lattices, which implies some earlier results proved by G. Gr\"atzer and E. W. Kiss (1986), M. Wild (1993), and G. Cz\'edli and E. T. Schmidt (2010) on extensions to geometric lattices, and even an unpublished result of E. T. Schmidt on higher dimensional rectangular lattices. Our method offers shorter proofs of these results than the original ones. To obtain the main tool used in the paper, we extend the bijective correspondence between finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · semigroups and automata theory
