Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 LL be a nonempty finite distributive lattice and let P=JI(L)P=\operatorname{JI}(L) be its poset of join-irreducible elements. The map

Φ:LJ(P),Φ(x):={jP:jx},\Phi:L\longrightarrow J(P),\qquad \Phi(x):=\{j\in P:j\le x\},

is a lattice isomorphism. Its inverse sends an order ideal II to I\bigvee I, with the empty join equal to 0L0_L.

Facts & Assumptions

Given: A nonempty finite distributive lattice LL, its join-irreducible poset PP, and the map Φ\Phi in the Statement.

[L1]

Every xLx\in L is the join of the join-irreducible elements below it, and LL has a bottom 0L0_L (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 PP is finite because it is a subset of LL. For every xLx\in L, the set Φ(x)\Phi(x) is an order ideal of PP: if jxj\le x and iPi\in P satisfies iji\le j, then ixi\le x. Thus Φ\Phi is well defined.

givenL3L4
1.2

For an order ideal IJ(P)I\in J(P), construct Ψ(I):=I\Psi(I):=\bigvee I, taking Ψ()=0L\Psi(\varnothing)=0_L. Then IΦ(Ψ(I))I\subseteq\Phi(\Psi(I)).

givenL1construct
2.1

For x,yLx,y\in L, one has Φ(xy)=Φ(x)Φ(y)\Phi(x\wedge y)=\Phi(x)\cap\Phi(y). Also Φ(xy)=Φ(x)Φ(y)\Phi(x\vee y)=\Phi(x)\cup\Phi(y), because a join-irreducible jj satisfies jxyj\le x\vee y exactly when jxj\le x or jyj\le y by [L2].

step 1.1L2L3
2.2

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

step 1.1L1F1
2.3

Conversely, suppose jΦ(Ψ(I))j\in\Phi(\Psi(I)). If I=I=\varnothing, then j0Lj\le0_L, forcing j=0Lj=0_L, contrary to join-irreducibility. Thus II is nonempty. Repeated application of join-primality [L2] to the finite join jIj\le\bigvee I gives jij\le i for some iIi\in I. Since II is an order ideal, jIj\in I. Hence Φ(Ψ(I))=I\Phi(\Psi(I))=I.

step 1.2L1L2L4
3.1

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

step 2.1step 2.2step 2.3L1F1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 50 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources