Alphabeta Math
ExampleConstruction: AI-adaptedVerification: Not suppliedaudited 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.

The full Möbius table of the Boolean lattice 2[3]

Example

Let [3]={1,2,3} and order 2[3] by inclusion (The Boolean lattice of subsets of a finite set and its rank levels). The complete table is determined by

μ(A,B)=(−1)∣B∖A∣(A⊆B)

(For A⊆B in a finite Boolean lattice, μ(A,B)=(−1)∣B∖A∣). Thus the value is 1 on the diagonal, −1 when B adds one element, 1 when it adds two elements, and −1 from ∅ to [3].

Equivalently, the comparable pairs split as follows:

| ∣B∖A∣ | number of pairs | μ(A,B) | |---:|---:|---:| | 0 | 8 | 1 | | 1 | 12 | −1 | | 2 | 6 | 1 | | 3 | 1 | −1 |

For a cover A⊂A∪{i} the recurrence reads 1+(−1)=0. For the top interval it reads 1+3(−1)+3(1)+(−1)=0, in agreement with The Möbius recurrence: μP(x,x)=1 and both interval sums of μP vanish when x<y.

;f1gf2gf3gf1;2gf2;3gf1;3gf1;2;3g¹(;;B)=1¹(;;B)=¡1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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