Math 2.0

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

Lattice ideal

Summary

An ideal of a lattice is a nonempty subset that is closed downward and closed under joins. The typical example is the principal ideal ↓a={x:x≤a}\downarrow a = \set{x : x \le a} of all elements below a fixed element aa. Lattice ideals are the order-theoretic analogue of ideals of a ring, and the dual notion is the filter. Prime ideals of lattices are the key to representation theorems for distributive lattices and Boolean algebras.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ideal_(order_theory)
About this page
Tag5GW2T2AM1A
URIm2://5GW2T2AM1A
Kindconcept
WritingW0 stub
MSC06B10

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

Used by

Definitions

Special cases