Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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 Edwards–Sokal coupling and correlation identity

Statement

Let G=(V,E) be a finite simple graph, let Q≥2 be an integer, and let each edge activity ve be finite and nonnegative. Use the Potts weight wP(σ)=∏e={ue,we}(1+ve1{σ(ue)=σ(we)}) and FK weight wFK(A)=QkG(A)∏e∈Ave from the finite definitions. Define W(σ,A):=∏e∉A1∏e∈Ave1{σ(ue)=σ(we)},(σ,A)∈[Q]V×2E. The normalized joint law ν(σ,A):=W(σ,A)/∑τ,BW(τ,B) has Potts marginal wP/ZP and FK marginal wFK/ZFK, with ZP=ZFK=∑τ,BW(τ,B). Conditional on an edge set A of positive probability, the colors of its connected components are independent and uniform on [Q]. Thus for every x,y∈V, P(σ(x)=σ(y))=1Q+(1−1Q)PFK(x↔y), where x↔y means that x and y lie in the same component of GA.

Facts & Assumptions

Given: A finite simple graph G=(V,E), integer Q≥2, and finite activities ve≥0.

[F1]

Finite Potts and Fortuin–Kasteleyn weights: the spin weight is ∏e(1+ve1{σ(ue)=σ(we)}), the FK weight of A is QkG(A)∏e∈Ave, and both finite normalizers are positive.

Proof

technique · direct
1.1givenF1algebra

For fixed σ, summing W(σ,A) over all A⊆E chooses, independently for each edge, either its absent factor 1 or its present factor ve1{σ(ue)=σ(we)}. Distributivity of the finite product therefore gives ∑AW(σ,A)=wP(σ). Summing this equality over the finite set [Q]V gives ∑σ,AW(σ,A)=ZP.

1.2F1algebra

Fix A⊆E. The product W(σ,A) is zero unless the spins agree across every edge in A. Equality propagates along each finite path, so the admissible configurations are exactly those constant on each connected component of GA. Assigning one of Q colors independently to each of its kG(A) components gives exactly QkG(A) such configurations, each with weight ∏e∈Ave. Hence ∑σW(σ,A)=wFK(A), including when this weight is zero. Summing over A gives ∑σ,AW(σ,A)=ZFK.

2.1F1step 1.1step 1.2algebra

The common total is positive by [F1], so dividing W by it defines a probability law. The finite marginal sums in steps 1.1 and 1.2 show that its spin and edge marginals are respectively wP/ZP and wFK/ZFK, and that ZP=ZFK.

2.2step 1.2algebra

For a fixed A with positive FK probability, every spin assignment constant on its components has the same joint weight ∏e∈Ave. By step 1.2 there are QkG(A) such assignments, so the conditional law is uniform on them; this is equivalent to assigning independent uniform colors to the components.

3.1step 2.1step 2.2algebra∎

If x,y are connected in GA, step 2.2 makes their colors equal with conditional probability 1. If they are in distinct components, their independent uniform colors agree with probability 1/Q. Averaging over the FK marginal from step 2.1 yields P(σ(x)=σ(y))=PFK(x↔y)+Q−1PFK(x↮y)=Q−1+(1−Q−1)PFK(x↔y).

Depends on

Dependency tree · 2 levels

Sources