Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 G=(V,E) be a finite simple graph, let Q≥2 be an integer, and give each edge a finite activity ve≥0. Choose a set B⊆V of boundary vertices and an equivalence relation ξ on B. The relation ξ specifies which boundary vertices are identified before any edges are occupied. For A⊆E, let ∼ξ,A be the least equivalence relation on V containing every pair in ξ and both endpoints of every edge in A. Write kξ(A):=∣V/∼ξ,A∣ and vA:=∏e∈Ave, with empty product 1. Define wFKξ(A):=Qkξ(A)vA,ZFKξ(Q,v):=∑A⊆EwFKξ(A). The free boundary choice is the discrete relation on B (each boundary vertex is a singleton); the wired classes are the equivalence classes of ξ, with a fully wired boundary given by one class when B≠∅. Thus kξ(A) 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 Qkξ(∅)>0. For discrete ξ, kξ(A)=kG(A) and ZFKξ=ZFK. This is a mathematical partition polynomial; no wired Potts spin marginal is asserted.

Depends on

Dependency tree · 2 levels

Sources