Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unique normalized holomorphic regular-singular gauge

Open
QAlgorithms.Papers.Independent.Intakenext100.P41.analyticGauge

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥1d\ge1d≥1, m≥0m\ge0m≥0, R>0R>0R>0, and let B(t,z)B(t,z)B(t,z) be a jointly holomorphic d×dd\times dd×d matrix family on Cm×{∣z∣<R}\mathbb C^m\times\{|z|<R\}Cm×{∣z∣<R}. Set A(t,z)=B(t,z)/zA(t,z)=B(t,z)/zA(t,z)=B(t,z)/z for z≠0z\ne0z=0 and A0(t)=B(t,0)A_0(t)=B(t,0)A0​(t)=B(t,0). Let UUU consist of the parameters at which no two eigenvalues of A0(t)A_0(t)A0​(t) differ by a positive integer. There exists a holomorphic invertible matrix family ggg on U×{∣z∣<R}U\times\{|z|<R\}U×{∣z∣<R}, uniquely determined there by g(t,0)=Ig(t,0)=Ig(t,0)=I and

g(t,z)−1A(t,z)g(t,z)−g(t,z)−1∂g∂z(t,z)=A0(t)z(0<∣z∣<R).g(t,z)^{-1}A(t,z)g(t,z)-g(t,z)^{-1}\frac{\partial g}{\partial z}(t,z)=\frac{A_0(t)}{z}\qquad(0<|z|<R).g(t,z)−1A(t,z)g(t,z)−g(t,z)−1∂z∂g​(t,z)=zA0​(t)​(0<∣z∣<R).

The source proof explicitly imposes g0(t)=Ig_0(t)=Ig0​(t)=I, omitted from the printed uniqueness statement. The holomorphic family B=zAB=zAB=zA encodes the locally normally convergent Laurent family; uniqueness concerns values on the stated domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
Formal statement
noncomputable section

open scoped BigOperators

open MeasureTheory Set

namespace QAlgorithms.Papers.Independent.Intakenext100.P41

/-- §19 proposition, PDF p.26, with g(t,0)=I restored from the proof's g₀(t)=I.
The printed uniqueness claim omits that normalization and is false without it.
B=zA is jointly holomorphic, encoding the locally normally convergent Laurent
family. Uniqueness is on U×{|z|<R}, not on arbitrary outside values. -/
theorem analyticGauge (d m : ℕ) (hd : 0 < d) (R : ℝ) (hR : 0 < R)
    (B : (Fin m → ℂ) × ℂ → Matrix (Fin d) (Fin d) ℂ)
    (hB : DifferentiableOn ℂ B (Set.univ ×ˢ Metric.ball (0 : ℂ) R)) :
    ∃ g : (Fin m → ℂ) × ℂ → Matrix (Fin d) (Fin d) ℂ,
      IsNormalizedGauge R B g ∧
      ∀ h : (Fin m → ℂ) × ℂ → Matrix (Fin d) (Fin d) ℂ,
        IsNormalizedGauge R B h → Set.EqOn h g (gaugeDomain R B) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P41

end
Source
Operator Algebras and Conformal Field Theory III. Fusion of positive energy representations of LSU(N) using bounded operators, arXiv:math/9806031v1, PDF p. 26, §19: Proposition
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers d,md,md,m with d>0d>0d>0, every real number R>0R>0R>0, and every function B:Cm×C→Mat⁡d×d(C)B:\mathbb C^m\times\mathbb C\to\operatorname{Mat}_{d\times d}(\mathbb C)B:Cm×C→Matd×d​(C) that is complex differentiable on Cm×{z∈C:∣z∣<R}\mathbb C^m\times\{z\in\mathbb C:|z|<R\}Cm×{z∈C:∣z∣<R}, define UUU to be the set of parameters ttt such that λ−μ≠n\lambda-\mu\neq nλ−μ=n for every ordered pair of roots λ,μ\lambda,\muλ,μ of the characteristic polynomial of B(t,0)B(t,0)B(t,0) and every positive integer nnn, and put D={(t,z):t∈U, ∣z∣<R}D=\{(t,z):t\in U,\ |z|<R\}D={(t,z):t∈U, ∣z∣<R}. There exists a function ggg on all of Cm×C\mathbb C^m\times\mathbb CCm×C with values in Mat⁡d×d(C)\operatorname{Mat}_{d\times d}(\mathbb C)Matd×d​(C) such that ggg is complex differentiable on DDD, det⁡g(t,z)≠0\det g(t,z)\neq0detg(t,z)=0 on DDD, g(t,0)=Idg(t,0)=I_dg(t,0)=Id​ for every t∈Ut\in Ut∈U, and g(t,z)−1(z−1B(t,z))g(t,z)−g(t,z)−1ddzg(t,z)=z−1B(t,0)g(t,z)^{-1}\bigl(z^{-1}B(t,z)\bigr)g(t,z)-g(t,z)^{-1}\frac{d}{dz}g(t,z)=z^{-1}B(t,0)g(t,z)−1(z−1B(t,z))g(t,z)−g(t,z)−1dzd​g(t,z)=z−1B(t,0) whenever t∈Ut\in Ut∈U and 0<∣z∣<R0<|z|<R0<∣z∣<R, with the derivative taken while holding ttt fixed. Moreover, every globally defined matrix-valued function hhh satisfying these same differentiability, invertibility, normalization, and differential-equation requirements agrees with ggg at every point of DDD. This uniqueness assertion concerns agreement on DDD only. The case m=0m=0m=0 is included, with a single parameter tuple; if UUU is empty, all the stated requirements on ggg and the agreement requirement are vacuous.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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