algebra universalis

, Volume 10, Issue 1, pp 74–95 | Cite as

Every finite lattice can be embedded in a finite partition lattice

  • Pavel Pudlák
  • Jiří T⫲ma


There are many questions, which arise in connection with the theorem presented. In general, we would like to know more about the class of embeddings of a given lattice in the lattices of all equivalences over finite sets. Some of these problems are studied in [4]. In this paper, an embedding is called normal, if it preserves 0 and 1. Using regraphs, our result can be easily improved as follows:

THEOREM.For every lattice L, there exists a positive integer n 0,such that for every n≥n 0,there is a normal embedding π: L→Eq(A), where |A|=n.

Embedding satisfying special properties are shown in Lemma 3.2 and Basic Lemma 6.2. We hope that our method of regraph powers will produce other interesting results.

There is also a question about the effectiveness of finding an embedding of a given lattice. In particular, the proof presented here cannot be directly used to solve the following.

Problem. Can the dual of Eq(4) be embedded into Eq(21000)?


Triangle Inequality Algebra UNIV Congruence Lattice Boolean Lattice Finite Lattice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Birkhoff,On the Structure of abstract algebras, Proc. Cambridge Phil. Soc.31 (1935), 433–454.zbMATHCrossRefGoogle Scholar
  2. [2]
    G. Birkhoff,Lattice Theory, Amer. Math. Soc. (1948).Google Scholar
  3. [3]
    P. Crawey andR. P. Dilworth:Algebraic theory of lattices, Prentice-Hall, 1973.Google Scholar
  4. [4]
    A. Ehrenfeucht, V. Faber, S. Fajtlowicz andJ. Mycielski,Representations of finite lattices as partition lattices on finite sets, Proc. Univ. of Houston Lattice Theory Conf., Houston, 1973.Google Scholar
  5. [5]
    J. Hartmanis,Two embedding theorems for finite lattices, Proc. Amer. Math. Soc.7 (1956), 571–577.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    J. Hartmanis,Generalized partitions and lattice embeddings theorems, lattice theory, Proc. Sympos. Pure. Math.,2, AMS, Providence (1961), 22–30.Google Scholar
  7. [7]
    B. Jónsson,Algebras whose congruence lattices are distributive, Math. Scand.,21 (1967), 110–121zbMATHMathSciNetGoogle Scholar
  8. [8]
    R. Peele,The Representations of combinatorial circuits as finite partitions, preprintGoogle Scholar
  9. [9]
    W. Poguntke andJ. Rival,Finite four-generated simple lattices contain all finite lattices, Proc. Amer. Math. Soc.55, No 1 (1976), 22–24.zbMATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    P. Pudlák andJ. Tůma,Yeast graphs and fermentation of algebraic lattices. Colloquia Mathematica Societatis Jano, Bolyai, 14. Lattice Theory, Szeged (Hungary), 1974, 301–341.Google Scholar
  11. [11]
    P. M. Whitman,Lattices, equivalence relations, and subgroups, Bulletin of AMS,52 (1946), 507–522.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    East-West, Home is Best, (English proverb)Google Scholar

Copyright information

© Birkhäuser Verlag 1980

Authors and Affiliations

  • Pavel Pudlák
    • 1
    • 2
  • Jiří T⫲ma
    • 1
    • 2
  1. 1.Mathematics InstitutCzechoslovak Academy of SciencePrahaCzechoslovakia
  2. 2.Nuclear Physics FacultyČVUTPrahaCzechoslovakia

Personalised recommendations