Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-28
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.

Kirchhoff's formula gives τ(K4)=16

Example

The complete graph K4 has exactly 16 spanning trees.

Facts & Assumptions

Given: The complete graph K4.

[L1]

For a regular graph, τ(G)=1∣V(G)∣∏j=2∣V(G)∣(d−λj) (The matrix-tree theorem becomes an eigenvalue product formula).

[L2]

The adjacency eigenvalues of K4 are 3,−1,−1,−1 (The complete graph Kn has adjacency spectrum {n−1,(−1)n−1}).

Verification

technique · direct
1.1L1L2algebra

The graph K4 is 3-regular and has four vertices, so [L1] and [L2] give τ(K4)=14(3−(−1))3=14⋅43=16.

2.1step 1.1∎

Therefore Kirchhoff's product formula recovers the count τ(K4)=16.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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