Alphabeta Math
LemmaStatement: 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.

Cellular component counts and self-dual FK likelihoods on a finite square torus

Statement

For an integer m≥1, let Tm be the labelled square cellulation obtained by quotienting the unit square cellulation of R2 by mZ2. Its vertices are V=(Z/mZ)2. For every (i,j)∈V, retain a horizontal edge label h(i,j) from (i,j) to (i+1,j), a vertical edge label v(i,j) from (i,j) to (i,j+1), and a square face label f(i,j). All indices are modulo m. Distinct labels remain distinct even when their endpoints agree: for m=2 this retains parallel edges, and for m=1 it retains two loops. In a face boundary retain its four edge occurrences before reducing coefficients modulo two. Thus ∣V∣=∣F∣=m2 and ∣E∣=2m2. The dual has vertices f(i,j) and a separate label e∗ crossing each primal label e; specifically h(i,j)∗ joins f(i,j−1) to f(i,j) and v(i,j)∗ joins f(i−1,j) to f(i,j). Its faces correspond to primal vertices and use the dual square cellulation.

Let F2={0,1} be the field with addition and multiplication modulo two. Let C0=F2V, C1=F2E, and C2=F2F have the indicated labelled bases. Define ∂1:C1→C0 by summing the two endpoint occurrences of each edge, so a loop has zero boundary, and define ∂2:C2→C1 by

∂2f(i,j)=h(i,j)+v(i+1,j)+h(i,j+1)+v(i,j).

Then ∂1∂2=0 and H:=ker⁡∂1/im⁡∂2 has dimension two. For A⊆E, let C1(A) be the coordinate subspace generated by its labels, put Z(A)=C1(A)∩ker⁡∂1, and define

r(A):=dim⁡F2im⁡(Z(A)⟶H).

Let k(A) count all components of the spanning graph (V,A), including isolated vertices. Let A∗={e∗:e∈E∖A}, and let k∗(A∗) count all components of this dual spanning graph. Define r∗(A∗) by the same matrix construction on the dual cellulation. Then

r(A)∈{0,1,2},k∗(A∗)−1=∣A∣−∣V∣+k(A)−r(A),r∗(A∗)=2−r(A).

For every real q≥1, set p=q/(1+q). Give both primal and dual graphs the finite FK law with parameter (p,q) and identity boundary partition. Write w(A) and w∗(A∗) for their unnormalized weights, ϕ and ϕ∗ for their laws, and ν for the image of ϕ under A↦A∗. Then

w(A)w∗(A∗)=qr(A)−1.

For every dual configuration B⊆E∗, the two partition functions are equal and the exact normalized likelihood is

ν(B)ϕ∗(B)=q1−r∗(B).

In particular this likelihood lies in [q−1,q], and hence also in [q−2,q2]. For every event E⊆2E∗,

q−2ϕ∗(E)≤ν(E)≤q2ϕ∗(E).

The same event bounds hold after any labelled graph isomorphism identifying the dual torus with the primal torus.

Facts & Assumptions

Given: The labelled primal and dual square cellulations, their finite vector spaces and boundary maps, an open label set A, and, for the probabilistic conclusions, real q≥1 and p=q/(1+q).

[F1]

With the identity boundary partition, the finite FK weight is p∣A∣(1−p)∣E∣−∣A∣qk(A), all weights are positive, and normalization divides by their finite positive sum (Finite FK random-cluster weights for real q and boundary partitions).

Proof

1.1givenalgebra

In the boundary of each face, every vertex occurrence occurs twice after applying ∂1, so ∂1∂2=0. This includes identifications in a thin quotient: occurrences are added in F2, so repeated edges and endpoints cancel with their multiplicity rather than being removed beforehand. Both primal and dual graphs are connected, since horizontal and vertical steps modulo m reach every coordinate pair. For m=1 each graph has a single vertex and is connected even though its edge labels are loops.

1.2givenF1constructalgebra

The labelled graph map sending f(i,j) to (i,j), h(i,j)∗ to v(i,j−1), and v(i,j)∗ to h(i−1,j) is an isomorphism from the dual graph to the primal graph. It is bijective on both vertices and edge labels and preserves both endpoint occurrences; it also retains all parallel labels and loops at m=2 and m=1. The induced bijection on edge subsets preserves their cardinalities and component counts. Consequently the ordinary primal and dual FK partition functions Z and Z∗ are equal.

2.1givenstep 1.1constructalgebra

For any finite multigraph with s vertices and c components, its endpoint-incidence map over F2 has rank s−c. Indeed, within one component every edge vector has even coordinate sum, a subspace of dimension at most one less than the number of vertices. Fix a root in that component. For every other vertex, the sum of edge vectors along a path from the root to that vertex is the vector consisting of the root plus that vertex. These vectors are independent by their nonroot coordinates and attain that dimension. Summing over the disjoint components proves the rank formula; isolated vertices contribute zero rank and loops have zero incidence vector. In particular rank⁡∂1=∣V∣−1, and restriction to C1(A) gives dim⁡Z(A)=∣A∣−∣V∣+k(A).

3.1givenstep 1.1step 2.1algebra

Write a two-chain as c=∑fcff. Its coefficient on a primal edge with incident face occurrences f,g is cf+cg, including the zero sum when those faces agree. Thus ∂2c=0 exactly when the coefficients agree across every edge of the connected dual graph. Such coefficients are constant on all faces, and conversely every constant two-chain has zero boundary. Hence dim⁡ker⁡∂2=1 and rank⁡∂2=∣F∣−1. Together with ∣E∣=2m2 and ∣V∣=∣F∣=m2, step 2.1 gives dim⁡H=(∣E∣−∣V∣+1)−(∣F∣−1)=2. The dimension formulas used here follow by taking a basis of the kernel of a finite linear map and extending it to a basis of its domain: the images of the added vectors form a basis of its image. The corresponding quotient dimension is obtained by extending a basis of its subspace.

4.1givenstep 3.1algebra

A two-chain c satisfies ∂2c∈C1(A) exactly when its coefficients agree across every dual edge crossing a primal label outside A. These are precisely the labels of A∗. Its coefficients may therefore be chosen independently, and constantly, on the k∗(A∗) connected components of the dual spanning graph. The vector space UA:={c∈C2:∂2c∈C1(A)} has dimension k∗(A∗). The restriction of ∂2 to UA has image im⁡∂2∩C1(A) and kernel ker⁡∂2, the one-dimensional space of constant chains. Therefore dim⁡(im⁡∂2∩C1(A))=k∗(A∗)−1.

5.1givenstep 1.1step 2.1step 3.1step 4.1algebra

Because ∂1∂2=0, the kernel of Z(A)→H is exactly im⁡∂2∩C1(A). Its image has dimension r(A) by definition, so steps 2.1 and 4.1 give k∗(A∗)−1=∣A∣−∣V∣+k(A)−r(A). The image is a subspace of the two-dimensional space H, so r(A)∈{0,1,2}. This proves the component identity without assuming that any open component is cellular or that any open boundary is a simple curve.

6.1givenstep 1.1step 2.1step 3.1step 4.1step 5.1algebra

The dual cellulation is again a labelled square cellulation with ∣V∗∣=∣F∣=m2 and ∣E∗∣=2m2. Its endpoint and face-boundary maps have the same incidence descriptions used in the preceding matrix argument, including all thin-quotient occurrences. Applying the proved component identity to its open set A∗, whose complementary double-dual set is A, gives k(A)−1=∣A∗∣−∣F∣+k∗(A∗)−r∗(A∗). Substitute ∣A∗∣=2∣V∣−∣A∣, ∣F∣=∣V∣, and the identity from step 5.1; the resulting equality is k(A)−1=k(A)+1−r(A)−r∗(A∗). Thus r∗(A∗)=2−r(A).

6.2F1givenstep 5.1algebra

At the stated parameter, p/(1−p)=q. By [F1], ∣A∗∣=∣E∣−∣A∣, and ∣E∣=2∣V∣, the primal-to-dual weight ratio is w(A)/w∗(A∗)=(p/(1−p))2∣A∣−∣E∣qk(A)−k∗(A∗)=q∣A∣−∣V∣+k(A)−k∗(A∗). The component identity in step 5.1 makes this exponent r(A)−1. This proves the asserted exact unnormalized ratio.

7.1givenF1step 5.1step 6.1step 6.2step 1.2algebra

For a fixed dual configuration B, let A be its unique complement-edge preimage. The definition of pushforward gives ν(B)=w(A)/Z, while ϕ∗(B)=w∗(B)/Z∗. By steps 6.2 and 1.2 their ratio is qr(A)−1. Step 6.1 gives r(A)−1=1−r∗(B), proving the exact normalized likelihood. Since 0≤r∗(B)≤2 and q≥1, that likelihood belongs to [q−1,q]⊆[q−2,q2]. Positivity in [F1] ensures every denominator is nonzero.

8.1F1step 1.2step 7.1algebra∎

Multiply the weaker pointwise bounds of step 7.1 by ϕ∗(B) and sum over B∈E to obtain the stated event comparison, including empty events. Any labelled graph isomorphism of the dual torus with the primal torus preserves the ordinary FK weights by the same cardinality and component-count argument as in step 1.2. Pushing both laws and the event through that bijection therefore preserves the event bounds. This completes all claims.

Remarks

This is a finite matrix and component-count proof of the torus-sector correction. It does not assume any RSW crossing estimate or any mixed-boundary reflection construction.

The primary source was read through its complete Sections 1--2, printed pp. 3--14, including equations (1.5)--(1.6), Theorem 5, Lemmas 6--7, and Proposition 8. Its Sections 3--5 and cited references were not checked. The proof here replaces its net/cycle sector description by the explicit finite-matrix rank r(A) and proves every component identity used above locally.

Depends on

Dependency tree · 2 levels

Sources