Math 2.0

Order, lattices, ordered algebraic structures Lattices: basic notions Concept

Prime ideal of a lattice

Summary

A prime ideal of a lattice is a proper ideal that contains one of xx or yy whenever it contains their meet x∧yx \wedge y. It is the lattice analogue of a prime ideal of a commutative ring, with the meet in the role of the product. The complement of a prime ideal is a prime filter. Prime ideals are the points of the spaces used to represent distributive lattices and Boolean algebras.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ideal_(order_theory)
About this page
TagQKWVXJWHP6
URIm2://QKWVXJWHP6
Kindconcept
WritingW0 stub
MSC06B10, 06D05
SpecializesLattice ideal
Changed2 November 2026

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.

What links here

Definitions

Results about this

Used by