Order, lattices, ordered algebraic structures Lattices: basic notions Concept
Lattice homomorphism
Summary
A lattice homomorphism is a map between two lattices that preserves join and meet. Every lattice homomorphism is monotone, but a monotone map need not preserve joins or meets. Lattice homomorphisms are the morphisms of the category of lattices; their kernels are the lattice congruences, and the bijective ones are the lattice isomorphisms.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | BNVRR925X8 |
|---|---|
| URI | m2://BNVRR925X8 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06B05 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.