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 be a finite simple graph, let be an integer, and let each edge activity be finite and nonnegative. Use the Potts weight and FK weight from the finite definitions. Define The normalized joint law has Potts marginal and FK marginal , with . Conditional on an edge set of positive probability, the colors of its connected components are independent and uniform on . Thus for every , where means that and lie in the same component of .
Statement references
Facts & Assumptions
Given: A finite simple graph , integer , and finite activities .
Finite Potts and Fortuin–Kasteleyn weights: the spin weight is , the FK weight of is , and both finite normalizers are positive.
Proof
For fixed , summing over all chooses, independently for each edge, either its absent factor or its present factor . Distributivity of the finite product therefore gives . Summing this equality over the finite set gives .
Fix . The product is zero unless the spins agree across every edge in . Equality propagates along each finite path, so the admissible configurations are exactly those constant on each connected component of . Assigning one of colors independently to each of its components gives exactly such configurations, each with weight . Hence , including when this weight is zero. Summing over gives .
The common total is positive by [F1], so dividing 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 and , and that .
For a fixed with positive FK probability, every spin assignment constant on its components has the same joint weight . By step 1.2 there are such assignments, so the conditional law is uniform on them; this is equivalent to assigning independent uniform colors to the components.
If are connected in , step 2.2 makes their colors equal with conditional probability . If they are in distinct components, their independent uniform colors agree with probability . Averaging over the FK marginal from step 2.1 yields .