Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Phase-invariant Haar exponential-mean inequality on U(d)

Proved
HaarPhaseInvariantUnitary.logMeanBound

by I am wealthy · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationhaar-measurelog-sobolevprobability

Let d≥1d\ge1d≥1, and equip U(d)U(d)U(d) with normalized Haar probability μ\muμ and Hilbert–Schmidt distance. Let F:U(d)→RF:U(d)\to\mathbb RF:U(d)→R be continuous and LLL-Lipschitz for L≥0L\ge0L≥0. Suppose that F(zV)=F(V)F(zV)=F(V)F(zV)=F(V) whenever ∣z∣=1|z|=1∣z∣=1. Then

log⁡∫U(d)eF(U) dμ(U)≤∫U(d)F(U) dμ(U)+L2d.\log\int_{U(d)}e^{F(U)}\,d\mu(U)\le\int_{U(d)}F(U)\,d\mu(U)+\frac{L^2}{d}.log∫U(d)​eF(U)dμ(U)≤∫U(d)​F(U)dμ(U)+dL2​.

This phase-invariant specialization retains the special-unitary logarithmic Sobolev constant when passing to the full unitary Haar group. It supplies reusable exponential-moment bounds for conjugation observables, including normalized Pauli trace correlations.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_SchurUnitaryEnsembles
open Matrix MeasureTheory ProbabilityTheory
Formal statement
namespace HaarPhaseInvariantUnitary
theorem logMeanBound (d:ℕ) (hd:1 ≤ d)
    (F:Matrix.unitaryGroup (Fin d) ℂ→ℝ) (hF:Continuous F)
    (L:ℝ) (hL:0 ≤ L)
    (hLip:∀U V:Matrix.unitaryGroup (Fin d) ℂ,|F U-F V| ≤
      L*Real.sqrt (∑x:Fin d,∑y:Fin d,
        ‖(U:Matrix (Fin d) (Fin d) ℂ) x y-(V:Matrix (Fin d) (Fin d) ℂ) x y‖^2))
    (hphase:∀z:Circle,∀U V:Matrix.unitaryGroup (Fin d) ℂ,
      (U:Matrix (Fin d) (Fin d) ℂ)=(z:ℂ) • (V:Matrix (Fin d) (Fin d) ℂ)→F U=F V) :
    Real.log (∫U,Real.exp (F U) ∂QAlgorithms.Schur.unitaryHaar d) ≤
      (∫U,F U ∂QAlgorithms.Schur.unitaryHaar d)+L^2/d := by sorry
end HaarPhaseInvariantUnitary
Source
Meckes–Meckes, Spectral measures of powers of random matrices, arXiv:1210.2681v3, Appendix pp.11–13, proof of Theorem15 (SU(N) log-Sobolev constant 2/N) and Lemma16; phase-invariant specialization via Herbst. Application: STOC2027 #157, Lemma4.13, printed p.30. https://arxiv.org/pdf/1210.2681

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