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
Example
The complete graph has exactly spanning trees.
Facts & Assumptions
Given: The complete graph .
For a regular graph, (The matrix-tree theorem becomes an eigenvalue product formula).
The adjacency eigenvalues of are (The complete graph has adjacency spectrum ).
Verification
The graph is -regular and has four vertices, so [L1] and [L2] give .
Therefore Kirchhoff's product formula recovers the count .
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
- Richard P. Stanley, MIT 18.314 handout, Example 1.11 (standard reference, not scraped)