Representing some families of monotone maps by principal lattice congruences

DOI10.1007/S00012-016-0419-7zbMATH Open1420.06008arXiv1403.7821OpenAlexW2253007330MaRDI QIDQ509530FDOQ509530

Authors: Gábor Czédli 

Publication date: 17 February 2017

Published in: Algebra Universalis (Search for Journal in Brave)

Abstract: For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small category of bounded ordered sets as objects and some 0-separating {0,1}-preserving monotone maps as morphisms such that every hom-set consists of at most one morphism. We prove the converse: each small category of bounded ordered set with these properties is representable by principal lattice congruences in the above sense.

Full work available at URL: https://arxiv.org/abs/1403.7821

Recommendations

• Representing a monotone map by principal lattice congruences
• On lattices of monotonic maps and generalized topologies
• The lattice of convex subsets of a monounary algebra
• On the representation of monoids by multivalued mappings
• Representing an isotone map between two bounded ordered sets by principal lattice congruences
• Monomial maps on and their arithmetic dynamics
• The lattice of convexities of partial monounary algebras
• Publication:3033812
• Representation of generalized monotone multimaps
• ON MONOIDS OF ISOTONE MAPPINGS

zbMATH Keywords

functororderordered setposetmonotone mappreorderingprincipal congruencequasiorderingcategorified latticelattice categorylattice congruencelifting diagramsquasi-colored lattice

Mathematics Subject Classification ID

Partial orders, general (06A06) Lattice ideals, congruence relations (06B10) Representation theory of lattices (06B15) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Cites Work

• Lattice Theory: Foundation
• Jónsson's contributions to lattice theory
• A solution to Dilworth's congruence lattice problem
• A technical lemma for congruences of finite lattices
• The ordered set of principal congruences of a countable lattice.
• The order of principal congruences of a bounded lattice
• Congruence Lattices of Finite Semimodular Lattices
• Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices
• Title not available (Why is that?)
• Free trees and the optimal bound in Wehrung's theorem
• Title not available (Why is that?)
• Notes on planar semimodular lattices. III. Rectangular lattices
• Planar Lattices
• Diagrams and rectangular extensions of planar semimodular lattices
• An independence theorem for ordered sets of principal congruences and automorphism groups of bounded lattices
• An extension theorem for planar semimodular lattices.
• Congruences and prime-perspectivities in finite lattices.
• On congruence lattices of lattices
• From objects to diagrams for ranges of functors
• Homomorphisms of Distributive Lattices as Restrictions of Congruences
• Homomorphisms of Distributive Lattices as Restrictions of Congruences. II. Planarity and Automorphisms
• On the distributivity of a lattice of lattice-congruences
• Isotone maps as maps of congruences. I: Abstract maps
• Isotone maps as maps of congruences. II. Concrete maps
• Schmidt and Pudlák’s Approaches to CLP
• Zur Konstruktion vollständiger Polaritätsverbände.
• Representing a monotone map by principal lattice congruences
• Finite distributive lattices are congruence lattices of almost-geometric lattices

Cited In (10)

• Representing an isotone map between two bounded ordered sets by principal lattice congruences
• The ordered set of principal congruences of a countable lattice.
• On the set of principal congruences in a distributive congruence lattice of an algebra
• Characterizing fully principal congruence representable distributive lattices
• Homomorphisms and principal congruences of bounded lattices. III. The independence theorem
• Homomorphisms and principal congruences of bounded lattices. II. Sketching the proof for sublattices
• Cometic functors and representing order-preserving maps by principal lattice congruences
• Some preliminary results on the set of principal congruences of a finite lattice
• On the largest numbers of congruences of finite lattices
• Representing a monotone map by principal lattice congruences

This page was built for publication: Representing some families of monotone maps by principal lattice congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509530)