Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck pendingjudge pass (gpt-6-luna)
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.

Exact finite-lattice SU(2) Wilson area law in two dimensions

Statement

Assume ACω. Let M,N≥1 be integers and use the finite M-by-N square lattice with free boundary (no periodic identifications and all boundary links retained). Its vertices are (i,j) for 0≤i≤M, 0≤j≤N; its positively oriented edges are eastward hi,j:(i,j)→(i+1,j) for 0≤i<M, 0≤j≤N, and northward vi,j:(i,j)→(i,j+1) for 0≤i≤M, 0≤j<N; and its faces pi,j for 0≤i<M, 0≤j<N have counterclockwise boundary words (hi,j,vi+1,j,hˉi,j+1,vˉi,j). Use the matrix group SU(2)={U∈M2(C):U∗U=I2,det⁡U=1} with matrix multiplication and its identity defining representation. In real coordinates its elements are

U(x)=(x0+ix3x2+ix1−x2+ix1x0−ix3),x∈S3:={x∈R4:∑j=03xj2=1}.

Let σ3 be the induced round surface-area measure on S3, with total area 2π2, and let μ2 be the pushforward of σ3/(2π2) under this map. Each positively oriented edge carries one link matrix; reverse links use inverses. For each face p, Up is the product of its boundary links in traversal order; for a loop C, UC is the analogous ordered edge product. Use the Wilson action Sβ(U)=β∑p(1−12Tr⁡2Up) and normalized loop W(C)=12Tr⁡2UC. Let β=4/g02 for dimensionless g0>0, and restrict to the explicit strong-coupling window 0<β≤1 (equivalently g02≥4). For any axis-aligned rectangle contained in the lattice with corners (a,c) and (b,d), where 0≤a<b≤M and 0≤c<d≤N, let Ca,b;c,d be its boundary traversed counterclockwise from (a,c). Its area in plaquette units is A=(b−a)(d−c). Define Z(SU(2)):={z∈SU(2):zU=Uz for every U∈SU(2)} and χ:Z(SU(2))→{±1} by z=χ(z)I2. Then Z(SU(2))={I2,−I2} and the defining representation has the nontrivial central character χ(I2)=1, χ(−I2)=−1. Put

λ(β):=∫SU(2)12Tr⁡2(U)eβTr⁡2(U)/2 dμ2(U)∫SU(2)eβTr⁡2(U)/2 dμ2(U),

where τ(U)=12Tr⁡2(U). Then 0<λ(β)<1 and the exact finite-lattice expectation is

⟨W(Ca,b;c,d)⟩β=λ(β)A=exp⁡ ⁣(−σlat(β)A),σlat(β):=−log⁡λ(β)>0.

The parameter β and the lattice string tension σlat are dimensionless. The identity holds for every finite container and every stated rectangle; no infinite-area, infinite-volume, or continuum limit is taken, and no continuum confinement or mass-gap claim follows.

Statement references

Facts & Assumptions

Given: ACω, the finite free-boundary square lattice, the defining SU(2) representation, the Wilson action with 0<β≤1, and a rectangular loop Ca,b;c,d.

[A1]

ACω is inherited through the finite non-Abelian lattice datum; the present integration proof uses only finite products and explicit coordinate changes. The Axiom of Countable Choice (ACω)

[F1]

Finite non-Abelian lattice gauge data: link configurations are G-valued, the vertex group acts by endpoint multiplication, and normalized product Haar measure is used on the finite link set.

[F2]

Wilson loop on a finite lattice: W(C)=12Tr⁡2(UC) for the defining representation, with edge matrices multiplied in traversal order.

[F3]

Finite SU(2) Wilson plaquette measure: Sβ=β∑p(1−τ(Up)), τ(U)=12Tr⁡2U, and the one-plaquette law is dνβ=zβ−1eβτdμ2.

[F4]

Independent plaquette variables on a finite planar rectangle: in a chosen tree gauge, the rectangle's plaquette holonomies are independent with law νβ when all face weights are the same Wilson weight.

[F5]

SU(2) one-plaquette matrix average at strong coupling: Eνβ[U]=λ(β)I2 and 0<λ(β)<1.

[F6]

Wilson loop is invariant under vertex gauge transformations: the normalized trace of the original closed-loop holonomy is unchanged by every vertex gauge transformation, including the configuration-dependent transformation to the tree-gauge representative.

[F8]

An integrand bounded by 1 on the finite product probability space is in L1, and Fubini applies to its product-coordinate sections. Measure space and integral Integrable real and complex functions, and their integrals Fubini's theorem for L1 functions on a sigma-finite product

Proof

1.1givenA1F1F3F4algebra

The Wilson action weight is e−βNp∏peβτ(Up), where Np=MN; the constant e−βNp cancels in normalized expectations. By the coordinates in [F3], τ(U)=x0∈R; since U−1=U∗, τ(U−1)=τ(U)‾=τ(U), and cyclicity of trace makes τ conjugation-invariant. Therefore wp(U)=eβτ(U) is positive, continuous, conjugation-invariant and inversion-invariant, so it meets [F4]'s hypotheses. Thus [F4] gives the plaquette law νβ after the tree-gauge change of variables. The inherited axiom base is ACω [A1].

2.1givenF1F2F4F6step 1.1algebra

Let Utree be the unique tree-gauge representative of the original link configuration supplied by [F4]. By [F6], W(C;Utree)=W(C;U) pointwise, so evaluating the original expectation after this configuration-dependent gauge fixing preserves the loop observable; [F4] supplies the corresponding law of its plaquette variables. Choose the vertical tree column equal to the left side x=a of Ca,b;c,d. All horizontal links and the left-side vertical links are then the identity. For each row j, Pi,j=Vi+1,jVi,j−1 and Va,j=I2, so the recursion Vi+1,j=Pi,jVi,j yields Vb,j=Pb−1,j⋯Pa,j. The counterclockwise boundary from (a,c) therefore has ordered holonomy UC=(Pb−1,c⋯Pa,c)(Pb−1,c+1⋯Pa,c+1)⋯(Pb−1,d−1⋯Pa,d−1), a product of exactly A=(b−a)(d−c) plaquette matrices.

3.1F4F5F8step 2.1algebraF7

By [F4] the plaquette variables in this ordered product have the product probability law νβ⊗A. Each defining-representation matrix entry has modulus at most 1, so every entry of the finite matrix-product integrand is bounded and belongs to L1 by [F8]. Fubini applied entry by entry therefore replaces each independent factor by its matrix expectation without changing its order. By [F5] each expectation is λI2, so the expected loop holonomy is (λI2)A=λAI2.

4.1F2F5step 3.1algebra

Taking half the trace gives ⟨W(C)⟩β=λA. Since 0<λ<1 by [F5], σlat=−log⁡λ is positive and λA=e−σlatA for every positive integer area A. The conclusion is the stated finite-lattice model deduction only.

5.1givenalgebra∎

To identify the center, write D=diag⁡(i,−i) and J=(01−10); both belong to SU(2). If A=(abcd)∈Z(SU(2)), then AD=DA forces b=c=0. The conditions A∈SU(2) then give A=diag⁡(z,z−1) with ∣z∣=1, and AJ=JA forces z=z−1, hence z=±1. Conversely, both scalar matrices ±I2 commute with every element of SU(2). Since the defining representation is the identity matrix representation, its character on this center is χ(±I2)=±1, as stated.

Depends on

Dependency tree · 2 levels

Sources