Skip to main content
Log in

The automorphism group of a function lattice: A problem of Jónsson and McKenzie

  • Published:
Algebra universalis Aims and scope Submit manuscript

Abstract

It is shown that Aut(LQ) is naturally isomorphic to Aut(L) × Aut(Q) whenL is a directly and exponentially indecomposable lattice,Q a non-empty connected poset, and one of the following holds:Q is arbitrary butL is ajm-lattice,Q is finitely factorable and L is complete with a join-dense subset of completely join-irreducible elements, orL is arbitrary butQ is finite. A problem of Jónsson and McKenzie is thereby solved. Sharp conditions are found guaranteeing the injectivity of the natural mapv P,Q from Aut(P) × Aut(Q) to Aut(PQ)P andQ posets), correcting misstatements made by previous authors. It is proven that, for a bounded posetP and arbitraryQ, the Dedekind-MacNeille completion ofPQ,DM(PQ), is isomorphic toDM(P)Q. This isomorphism is used to prove that the natural mapv P,Q is an isomorphism ifvDM(P),Q is, reducing a poset problem to a more tractable lattice problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bauer, H.,Garben und Automorphismen geordneter Mengen, Dissertation, Technische Hochschule Darmstadt, 1982.

  2. Bauer, H.Keimel, K. andKöhler, R.,Verfeinerungs- und Kürzungssätze für Produkte geordneter topologischer Räume und für Funktionen (-halb-) verbände, Lecture Notes in Mathematics, eds. B. Banaschewski and R.-E. Hoffmann, vol.871, Springer-Verlag, 1981, pp. 20–44.

    Google Scholar 

  3. Birkhoff, G.,Generalized arithmetic, Duke Mathematical Journal9 (1942), 283–302.

    Article  MathSciNet  Google Scholar 

  4. Birkhoff, G.,Lattice Theory, American Mathematical Society, Providence, Rhode Island, 1967.

    MATH  Google Scholar 

  5. Chang, C. C., Jónsson, B. andTarski, A.,Refinement properties for relational structures, Fundamenta Mathematicae55 (1964), 249–281.

    Article  MathSciNet  Google Scholar 

  6. Cornish, W. H.,Ordered topological spaces and the coproduct of bounded distributive lattices, Colloquium Mathematicum36 (1976), 27–35.

    Article  MathSciNet  Google Scholar 

  7. Davey, B. A.,Free products of bounded distributive lattices, Algebra Universalis4 (1974), 106–107.

    Article  MathSciNet  Google Scholar 

  8. Davey, B. A. andDuffus, D.,Exponentiation and duality, Ordered Sets, ed. I. Rival, D. Reidel, Holland, 1982, pp. 43–95.

    Chapter  Google Scholar 

  9. Davey, B. A. andPriestley, H. A.,Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.

    MATH  Google Scholar 

  10. Duffus, D.,Automorphisms and products of ordered sets, Algebra Universalis19 (1984), 366–369.

    Article  MathSciNet  Google Scholar 

  11. Duffus, D.,Powers of ordered sets, Order1 (1984), 83–92.

    Article  MathSciNet  Google Scholar 

  12. Duffus, D., Jónsson, B. andRival, I.,Structure results for function lattices, Canadian Journal of Mathematics30 (1978), 392–400.

    Article  MathSciNet  Google Scholar 

  13. Duffus, D. andRival, I.,A logarithmic property for exponents of partially ordered sets, Canadian Journal of Mathematics30 (1978), 797–807.

    Article  MathSciNet  Google Scholar 

  14. Duffus, D. andWille, R.,Automorphism groups of function lattices, Colloquia Mathematica Societatis János Bolyai29 (1977), 203–207.

    MathSciNet  MATH  Google Scholar 

  15. Erné, M.,Compact generation in partially ordered sets, Journal of the Australian Mathematical Society42 (1987), 69–83.

    Article  MathSciNet  Google Scholar 

  16. Hashimoto, J.,On the product decomposition of partially ordered sets, Mathematica Japonicae1 (1948), 120–123.

    MathSciNet  MATH  Google Scholar 

  17. Jónsson, B.,Arithmetic of ordered sets, Ordered Sets, ed. I. Rival, D. Reidel, Holland, 1982, pp. 3–41.

    Chapter  Google Scholar 

  18. Jónsso, B.,Powers of partially ordered sets: the automorphism group, Mathematica Scandinavica51 (1982), 121–141.

    Article  MathSciNet  Google Scholar 

  19. Jónsson, B. andMcKenzie, R.,Powers of partially ordered sets: cancellation and refinement properties, Mathematica Scandinavica51 (1982), 87–120.

    Article  MathSciNet  Google Scholar 

  20. Lawson, J. D.,The versatile continuous order, Lecture Notes in Computer Science, eds. M. Mainet al., vol.298, Springer-Verlag, 1988, pp. 134–160.

    Chapter  Google Scholar 

  21. MacNeille, H. M.,Partially ordered sets, Transactions of the American Mathematical Society42 (1937), 416–460.

    Article  MathSciNet  Google Scholar 

  22. Markowsky, G.,The factorization and representation of lattices, Transactions of the American Mathematical Society203 (1975), 185–200.

    Article  MathSciNet  Google Scholar 

  23. Novotny, M.,Über gewisse Eigenschaften von Kardinaloperationen, Spisy P¯rírodov¯edecké Fakulty University v Brne (1960), 465–484.

  24. Priestley, H. A.,Representation of distributive lattices by means of ordered Stone spaces, The Bulletin of the London Mathematical Society2 (1970), 186–190.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The author would like to thank his supervisor, Dr. H. A. Priestley, for her direction and advice as well as his undergraduate supervisor, Prof. Garrett Birkhoff, and Dr. P. M. Neumann for comments regarding the paper. This material is based upon work supported under a (U.S.) National Science Foundation Graduate Research Fellowship and a Marshall Aid Commemoration Commission Scholarship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Farley, J.D. The automorphism group of a function lattice: A problem of Jónsson and McKenzie. Algebra Universalis 36, 8–45 (1996). https://doi.org/10.1007/BF01192707

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01192707

1991 Mathematics Subject Classification

Keywords and phrases

Navigation