Published October 28, 2026 | Version 4

Area law for three-dimensional U(1) lattice gauge theory with the Wilson action at every coupling

Authors/Creators

Description

We prove that three-dimensional U(1) lattice gauge theory with the Wilson action confines static charges at every coupling: rectangular Wilson loops obey an area law, uniformly in the finite box, with an explicit lower bound on the string tension at weak coupling. For the Villain action, confinement at every coupling is the theorem of Göpfert and Mack; for the Wilson action the question had remained open. The Wilson weight is a mixture of Villain weights, so Ginibre's inequality bounds the Wilson loop by an average of Villain loops at a coupling larger by a fixed factor, in which a sparse random set of plaquettes is frozen at angle zero; after this set is regularized, the multiscale analysis of Göpfert and Mack, made uniform in it, and a Peierls estimate give the area law. As corollaries, the area law holds at every coupling for all closed subgroups of U(n) containing the scalars, also with a Higgs field blind to the centre of U(n), and for the Georgi–Glashow model at infinite Higgs coupling.

The main theorem (Theorem 1.2), its corollaries for other gauge groups and for the Georgi–Glashow model (Corollaries 1.3 and 1.4), Fröhlich's comparison inequality (Proposition 9.1) and all results of Appendix E, on comparing Wilson and Villain loops, are formalized in Lean 4 with Mathlib and checked by the Lean kernel, with no hypotheses beyond those of the statements and using only Lean's three standard axioms, propext, Classical.choice and Quot.sound. The companion paper describes the formalization, and its record, https://doi.org/10.5281/zenodo.23480809, contains the Lean code with the instructions for checking it.

Files:

  • u1-wilson-area-law.pdf: the paper, with Parts S1 and S2 of its supplementary material. S1 lists the constants and the arithmetic behind them, and S2 completes individual proofs that the main text sketches.
  • u1-wilson-area-law-S4.pdf: Part S4 of the supplementary material. It proves in full, in the order of the main text, the parts of the argument that we adapt from the literature (chiefly from Göpfert–Mack, Brydges–Federbush, Brydges and Barlow) or state in compressed form, without relying on the sources, which serve only as a guide.
  • source.zip: the LaTeX source of both PDF files.
  • scripts.zip: Python scripts with their outputs. cube_amonotone.py carries out the exact computation in the proof of Theorem E.8, which shows that Wilson loops are not monotone in the character coefficients of the plaquette weights. That proof is the only one in the paper that depends on a script; in the formalization, the Lean kernel decides its two sign conditions from rational enclosures. The other scripts compute the threshold K* = 377.38 of Lemma 2.6 and check several statements of the paper numerically. The README in scripts.zip describes each script and how to run it, and the numerical checks that earlier versions gave as Part S3.

Mathematics Subject Classification (2020): 81T25, 82B20, 60K35.

Notes

The results of version 3 are unchanged, and every theorem, lemma, proposition and equation keeps its number. The abstract is new and the introduction revised; the former Part S3 is dropped, and its numerical checks are described in the README in scripts.zip; Tables S1.3 and S1.4 are written out in Section S1.6 and Remark S1.1; and Part S4 is shortened where it re-proved a standard formula, gave a second proof or made a point twice, its introduction saying in a table which of its sections completes which part of the main text. Version 4 corrects the following statements of version 3; the arguments of the proofs are unchanged.

Statements that a reader may have quoted or used, in the order of the paper:

  • Abstract: for the Villain action, Göpfert and Mack proved that a string tension defined by an iterated limit is positive at every coupling; version 3 credited them with the area law uniform in the box, which is stronger.
  • Section 1.2: through Fröhlich's comparison, an area law at every coupling for the closed subgroups of U(n) containing the scalars requires the Wilson case of U(1); version 3 stated this for groups with a central U(1), without restricting it to that comparison.
  • Section 5, first sentence: the probability is at most 2^(4|C|+5) e^(−RT), as in Theorem 5.1, not e^(−RT).
  • Section 8.1, opening: the min-cut lower tail bounds the exponential moment of the area deficit, and the averaged bound is e^(−σ_V(1−η_S)RT + c_N(R+T)) · E_D e^(σ_V(RT − A_{G′}(C))); version 3 equated the two and wrote e^(−σRT) · E_D e^(σ(RT − A)) with an undefined σ.
  • Remark 8.1: the claim, made without proof, that the right side of Theorem 2.5 is not monotone in β is withdrawn; the remark now says that raising β raises τ and lowers δ, which push that side in opposite directions.
  • Section 8.2, end: the constants fixed before K depend on τ at most through m̃, the scales of item 11 of the ordered list (Section S1.1.1) and c_dep; version 3 said that they do not depend on τ.
  • Proof of Proposition 9.1: the remark of Messager, Miracle-Solé and Pfister (p. 21) states the bound for every α; version 3 said that it is stated only for α equal to the phase of the interaction.
  • Introduction of Appendix E: Proposition E.10 is stated with its hypothesis, that a character coefficient of the weight exceeds that of the Villain weight ϑ_t; version 3 stated it without this hypothesis.
  • Remark E.9(iii): the claim that the non-monotonicity of Theorem E.8 needs light tails and large β or t is withdrawn; the remark now says that it comes from them.
  • Section S1.1.4(d): the conditions of Section 8 are η_T + η_S ≤ 1/2 and σ_V ≤ 1, as Section 8.1 already said; version 3 listed only the first, and β₀(K) is unchanged.

Descriptions of the argument:

  • Section 1.3, step (ii): the cut functional of the regularization penalizes leaving blocks crowded with marks unfilled, not the crowded blocks themselves, and the constants of the output are bounded independently of β, K, C and D; version 3 said that they are independent of them.
  • Section 1.3, step (iii): on each output the loop decays exponentially in the min-cut area; version 3 wrote "like the exponential of" it, here and in its abstract (the new abstract omits this step).
  • Proof of Theorem S4.8.36, step (K1): of the two bounds, only this one rests on positivity; version 3 called it the one place where the proof needs positivity, but step 4 uses it too.

Files

scripts.zip

Files (3.6 MB)

Name Size
md5:627d890464ca0867df1c5ee2d4d9b8e9
33.8 kB Preview Download
md5:a901050b3e74930f4ad1f3eaf55b38fb
519.9 kB Preview Download
md5:b44e70e109da0c2a066212b59185c126
1.6 MB Preview Download
md5:d3a9f28929db962f8a2aaff296658989
1.4 MB Preview Download

Additional details

Related works

Is supplemented by
Preprint: 10.5281/zenodo.23480809 (DOI)