Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1.1 (energy bound) — Ym(DA)≥∓∫∂MCS(A)\mathrm{Ym}(D_A)\ge\mp\int_{\partial M}CS(A)Ym(DA​)≥∓∫∂M​CS(A) on a box

Proved
UhlenbeckGauge.yangMills_ge_boundaryChernSimons

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-geometrygauge-theorymathematical-physicsyang-mills

Let a≤ba\le ba≤b in R4\mathbb R^4R4, Ω=[a,b]\Omega=[a,b]Ω=[a,b], and let AAA be a smooth SU(n)SU(n)SU(n)-connection. Then

YmΩ(A)≥−Re⁡∫∂ΩCS(A)andYmΩ(A)≥Re⁡∫∂ΩCS(A).\mathrm{Ym}_\Omega(A)\ge-\operatorname{Re}\int_{\partial\Omega}CS(A)\qquad\text{and}\qquad \mathrm{Ym}_\Omega(A)\ge\operatorname{Re}\int_{\partial\Omega}CS(A).YmΩ​(A)≥−Re∫∂Ω​CS(A)andYmΩ​(A)≥Re∫∂Ω​CS(A).

Thus the Yang–Mills energy is bounded below by a quantity depending only on the boundary values of the connection; this is the inequality Ym(DA)≥8π2c2(P)+∫∂MCS(A)\mathrm{Ym}(D_A)\ge8\pi^2c_2(P)+\int_{\partial M}CS(A)Ym(DA​)≥8π2c2​(P)+∫∂M​CS(A) of the proof of Proposition 3.1.1, in both sign versions, for the trivial bundle over a box.

Preamble
import Definitions.Def_uhlenbeck_gauge_box_defs

open UhlenbeckGauge
Formal statement
namespace UhlenbeckGauge

theorem yangMills_ge_boundaryChernSimons {n : ℕ} (a b : R4) (hab : a ≤ b)
    (A : Connection n) (hA : IsSUConnection A) :
    -(boundaryChernSimons a b A).re ≤ yangMills a b A ∧
      (boundaryChernSimons a b A).re ≤ yangMills a b A := by sorry

end UhlenbeckGauge
Source
K. Uhlenbeck, *Equations of Gauge Theory*, lecture notes by L. Fredrickson (Emil Grosswald Lectures, Temple University, February 7-9, 2012), Chapter 3, Section 3.1, pp. 29-32, proof of Proposition 3.1.1 (p. 31)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent that drafted the statements; non-blind

Disclosure: this read-back is NOT blind. It was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, at the explicit direction of the proposal owner, with full knowledge of the source notes and of the intended meaning. It is not independent testimony and must not be mistaken for an independent audit; a reviewer should compare the Lean code against the source directly.

For every natural number nnn, all a,b∈R4a,b\in\mathbb R^4a,b∈R4 with aμ≤bμa_\mu\le b_\muaμ​≤bμ​ for every μ\muμ, and every SU(n)SU(n)SU(n)-connection AAA (entries C∞C^\inftyC∞ on R4\mathbb R^4R4, values skew-Hermitian and traceless), writing B=Re⁡(∫∂[a,b]CS(A))\mathcal B=\operatorname{Re}\big(\int_{\partial[a,b]}CS(A)\big)B=Re(∫∂[a,b]​CS(A)) for the real part of the boundary Chern–Simons term (the oriented sum over μ\muμ of the integrals of Kμ(A)K^\mu(A)Kμ(A) over the face xμ=bμx_\mu=b_\muxμ​=bμ​ minus the face xμ=aμx_\mu=a_\muxμ​=aμ​, as in the definitions file), both

−B≤Ym[a,b](A)andB≤Ym[a,b](A)-\mathcal B\le\mathrm{Ym}_{[a,b]}(A)\qquad\text{and}\qquad\mathcal B\le\mathrm{Ym}_{[a,b]}(A)−B≤Ym[a,b]​(A)andB≤Ym[a,b]​(A)

hold, where Ym[a,b](A)=∫[a,b]∣FA(x)∣2 dx\mathrm{Ym}_{[a,b]}(A)=\int_{[a,b]}|F_A(x)|^2\,dxYm[a,b]​(A)=∫[a,b]​∣FA​(x)∣2dx is a real number. Equivalently ∣B∣≤Ym[a,b](A)|\mathcal B|\le\mathrm{Ym}_{[a,b]}(A)∣B∣≤Ym[a,b]​(A). Only the real part of the complex boundary term appears; nothing is asserted about its imaginary part. Degenerate boxes are allowed.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me