Elementary Embeddings and Algebra

Chapter

Abstract

This chapter describes algebraic consequences of the existence of a non-trivial elementary embedding of V λ into itself (Axiom I3). In addition to composition, the family of all elementary embeddings of the considered structure V λ is equipped with a second binary operation essentially consisting in applying one embedding to another one. This operation satisfies the self-distributivity law x(yz)=(xy)(xz) and, if j is a non-trivial elementary embedding as above, the closure of j under application is a free self-distributive system. Moreover, identifying embeddings that coincide up to some level leads to a sequence of finite quotients, the Laver tables. The main applications obtained so far are a solution to the Word Problem of the self-distributivity law, and a proof that the periods in Laver tables go to infinity with the size. Alternative approaches avoiding elementary embeddings have been found in the first case, but the question of whether a large cardinal hypothesis is necessary remains open in the second.

Keywords

Lamination 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    Serge Burckel. The wellordering on positive braids. Journal of Pure and Applied Algebra, 120(1):1–17, 1997. MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Jim Cannon, William Floyd, and Walter Perry. Introductory notes on Richard Thompson’s groups. L’Enseignement Mathématique, 42:215–257, 1996. MATHGoogle Scholar
  3. [3]
    Patrick Dehornoy. \({\Pi}_{1}^{1}\) -complete families of elementary sequences. Annals of Pure and Applied Logic, 38:257–287, 1988. MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Patrick Dehornoy. Sur la structure des gerbes libres. Comptes Rendus de l’Académie des Sciences de Paris, 309:143–148, 1989. MATHMathSciNetGoogle Scholar
  5. [5]
    Patrick Dehornoy. Braid groups and self-distributive operations. Transactions of the American Mathematical Society, 345(1):115–151, 1994. MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    Patrick Dehornoy, Ivan Dynnikov, Dale Rolfsen, and Bert Wiest. Why are Braids Orderable? volume 14 of Panoramas et Synthèses. Société Mathématique de France, Paris, 2002. Google Scholar
  7. [7]
    Randall Dougherty. Critical points in an algebra of elementary embeddings. Annals of Pure and Applied Logic, 65:211–241, 1993. MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    Randall Dougherty. Critical points in an algebra of elementary embeddings (II). In Wilfrid Hodges, editor, Logic: From Foundations to Applications, pages 103–136. Academic Press, San Diego, 1996. Google Scholar
  9. [9]
    Randall Dougherty and Thomas J. Jech. Finite left-distributive algebras and embedding algebras. Advances in Mathematics, 130:201–241, 1997. MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Randall Dougherty and Thomas J. Jech. Left-distributive embedding algebras. Electronic Research Announcements of the American Mathematical Society, 3:23–37, 1997. CrossRefMathSciNetGoogle Scholar
  11. [11]
    Aleš Drápal. Persistence of left distributive algebras. Journal of Pure and Applied Algebra, 105:137–165, 1995. MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    Aleš Drápal. Finite left distributive groupoids with one generator. International Journal for Algebra and Computation, 7(6):723–748, 1997. MATHCrossRefGoogle Scholar
  13. [13]
    Thomas J. Jech. Large ordinals. Advances in Mathematics, 125:155–170, 1997. MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Akihiro Kanamori. The Higher Infinite. Springer Monographs in Mathematics. Springer, Berlin, 2003. Second edition. MATHGoogle Scholar
  15. [15]
    Kenneth Kunen. Elementary embeddings and infinitary combinatorics. The Journal of Symbolic Logic, 36:407–413, 1971. MATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    David Larue. On braid words and irreflexivity. Algebra Universalis, 31:104–112, 1994. MATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    Richard Laver. Elementary embeddings of a rank into itself. Abstracts of the American Mathematical Society, 7:6, 1986. Google Scholar
  18. [18]
    Richard Laver. The left distributive law and the freeness of an algebra of elementary embeddings. Advances in Mathematics, 91(2):209–231, 1992. MATHCrossRefMathSciNetGoogle Scholar
  19. [19]
    Richard Laver. On the algebra of elementary embeddings of a rank into itself. Advances in Mathematics, 110:334–346, 1995. MATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    Richard Laver. Braid group actions on left distributive structures and well-orderings in the braid group. Journal of Pure and Applied Algebra, 108(1):81–98, 1996. MATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    Robert M. Solovay, William N. Reinhardt, and Akihiro Kanamori. Strong axioms of infinity and elementary embeddings. Annals of Mathematical Logic, 13:73–116, 1978. MATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    John R. Steel. The well-foundedness of the Mitchell ordering. The Journal of Symbolic Logic, 58:931–940, 1993. MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.Department of MathematicsUniversité de CaenCaen cedexFrance

Personalised recommendations