A technical lemma for congruences of finite lattices

2013/08/21 by George Grätzer, Grätzer, George
Computer Science · Mathematics · #06B10 #Advanced Algebra and Logic #FOS: Mathematics #Logic, Reasoning, and Knowledge #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic #math.RA #msc:06B10

paper · pdf · doi:10.48550/arxiv.1308.4607

openalex publication_date 2013/08/21 · arxiv created 2013/08/26 · arxiv updated 2013/08/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on finite lattices. This is not difficult to prove either but it has already has proved its usefulness in some applications.

Related

• The Congruences of a Finite Lattice, A "Proof-by-Picture" Approach, third edition
• Representing finite distributive lattices as congruence lattices of lattices
• A note on finite lattices with many congruences
• Some Extremal Values of the Number of Congruences of a Finite Lattice
• Congruences and prime-perspectivities in finite lattices