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.
Finite FK boundary wiring
Definition
Let be a finite simple graph, let be an integer, and give each edge a finite activity . Choose a set of boundary vertices and an equivalence relation on . The relation specifies which boundary vertices are identified before any edges are occupied. For , let be the least equivalence relation on containing every pair in and both endpoints of every edge in . Write and , with empty product . Define The free boundary choice is the discrete relation on (each boundary vertex is a singleton); the wired classes are the equivalence classes of , with a fully wired boundary given by one class when . Thus counts components after the prescribed identifications and occupied edges, including isolated vertices and boundary classes. The sum is finite and positive because its empty-edge term is . For discrete , and . This is a mathematical partition polynomial; no wired Potts spin marginal is asserted.