Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-07-31
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Birkhoff representation theorem: every finite distributive lattice is isomorphic to the lattice of order ideals of its join-irreducible poset

Statement

Let L be a nonempty finite distributive lattice and let P=JI⁡(L) be its poset of join-irreducible elements. The map

Φ:L⟶J(P),Φ(x):={j∈P:j≤x},

is a lattice isomorphism. Its inverse sends an order ideal I to ⋁I, with the empty join equal to 0L.

Facts & Assumptions

Given: A nonempty finite distributive lattice L, its join-irreducible poset P, and the map Φ in the Statement.

[L1]

Every x∈L is the join of the join-irreducible elements below it, and L has a bottom 0L (A finite lattice has a bottom and a top, and every element is the join of the join-irreducible elements below it).

[L2]

Every join-irreducible element of a distributive lattice is join-prime (Every join-irreducible element of a distributive lattice is join-prime).

[L3]

The order ideals of a finite poset form a distributive lattice under union and intersection (The order ideals of a finite poset form a distributive lattice under union and intersection).

[F1]

A bijection is a map that is both injective and surjective (Injection, surjection, bijection).

Proof

technique · constructive
1.1

The poset P is finite because it is a subset of L. For every x∈L, the set Φ(x) is an order ideal of P: if j≤x and i∈P satisfies i≤j, then i≤x. Thus Φ is well defined.

givenL3L4
1.2

For an order ideal I∈J(P), construct Ψ(I):=⋁I, taking Ψ(∅)=0L. Then I⊆Φ(Ψ(I)).

givenL1construct
2.1

For x,y∈L, one has Φ(x∧y)=Φ(x)∩Φ(y). Also Φ(x∨y)=Φ(x)∪Φ(y), because a join-irreducible j satisfies j≤x∨y exactly when j≤x or j≤y by [L2].

step 1.1L2L3
2.2

The map Φ is injective. If Φ(x)=Φ(y), then [L1] writes both x and y as the join of the same set of join-irreducibles, so x=y.

step 1.1L1F1
2.3

Conversely, suppose j∈Φ(Ψ(I)). If I=∅, then j≤0L, forcing j=0L, contrary to join-irreducibility. Thus I is nonempty. Repeated application of join-primality [L2] to the finite join j≤⋁I gives j≤i for some i∈I. Since I is an order ideal, j∈I. Hence Φ(Ψ(I))=I.

step 1.2L1L2L4
3.1

Step 2.3 proves that Φ is surjective, while step 2.2 proves injectivity. Step 2.1 shows that it preserves meets and joins. Moreover [L1] gives Ψ(Φ(x))=x, so Ψ is its inverse. Therefore Φ is the asserted lattice isomorphism.

step 2.1step 2.2step 2.3L1F1discharge-construct∎

Depends on

Used by

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources