Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Coset caps on coordinate subgroups bound the averaging operator of an irreducible unitary representation

Proved
OAI.Thorp.Fourier.Family.integrated_norm_sq

by Shuze Chen · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

inequalitiesoai-mathprobabilityrepresentation-theory

Let GGG and HHH be finite groups, III a finite nonempty set, and (ρb,Vb)b∈Λ(\rho_b,V_b)_{b\in\Lambda}(ρb​,Vb​)b∈Λ​ a complete family of irreducible unitary representations of HHH: Λ\LambdaΛ is a finite index set and, for each b∈Λb\in\Lambdab∈Λ, VbV_bVb​ is a finite-dimensional complex inner product space of dimension db≥1d_b\ge 1db​≥1 on which HHH acts irreducibly by unitary operators ρb(h)\rho_b(h)ρb​(h); distinct indices give non-isomorphic representations; and the characters χb(h)=tr⁡ρb(h)\chi_b(h)=\operatorname{tr}\rho_b(h)χb​(h)=trρb​(h) satisfy the regular-representation identity ∑b∈Λdb χb(h)=∣H∣ [h=1]\sum_{b\in\Lambda}d_b\,\chi_b(h)=|H|\,[h=1]∑b∈Λ​db​χb​(h)=∣H∣[h=1] for all h∈Hh\in Hh∈H. For i∈Ii\in Ii∈I let ιi ⁣:H→HI\iota_i\colon H\to H^Iιi​:H→HI put hhh in coordinate iii and 111 elsewhere.

Let EEE be a finite-dimensional complex inner product space of dimension D≠0D\neq0D=0, and let ρ\rhoρ be an irreducible representation of GGG on EEE which is unitary: ⟨ρ(g)x,ρ(g)y⟩=⟨x,y⟩\langle\rho(g)x,\rho(g)y\rangle=\langle x,y\rangle⟨ρ(g)x,ρ(g)y⟩=⟨x,y⟩. Let ψ ⁣:HI→G\psi\colon H^I\to Gψ:HI→G be a group homomorphism, let ν ⁣:G→R\nu\colon G\to\mathbb Rν:G→R be a probability vector (ν(g)≥0\nu(g)\ge0ν(g)≥0 and ∑gν(g)=1\sum_g\nu(g)=1∑g​ν(g)=1), and let B≥0B\ge0B≥0 be such that for all i∈Ii\in Ii∈I and g∈Gg\in Gg∈G

∑h∈Hν(g ψ(ιi(h)))≤B ∣H∣∣G∣.\sum_{h\in H}\nu\big(g\,\psi(\iota_i(h))\big)\le\frac{B\,|H|}{|G|}.h∈H∑​ν(gψ(ιi​(h)))≤∣G∣B∣H∣​.

Write ρ(ν)=∑g∈Gν(g) ρ(g)\rho(\nu)=\sum_{g\in G}\nu(g)\,\rho(g)ρ(ν)=∑g∈G​ν(g)ρ(g). Then for every v∈Ev\in Ev∈E

∥ρ(ν)v∥2≤∣I∣ BD(∑b∈Λ: db∣I∣≤Ddb2)∥v∥2.\|\rho(\nu)v\|^2\le\frac{|I|\,B}{D}\Big(\sum_{b\in\Lambda:\ d_b^{|I|}\le D}d_b^2\Big)\|v\|^2 .∥ρ(ν)v∥2≤D∣I∣B​(b∈Λ: db∣I∣​≤D∑​db2​)∥v∥2.

The hypothesis says that ν\nuν gives every left coset of each coordinate subgroup ψ(ιi(H))\psi(\iota_i(H))ψ(ιi​(H)) at most BBB times the mass of the uniform distribution. The conclusion bounds the operator norm of the averaging operator ρ(ν)\rho(\nu)ρ(ν) in terms of the dimension of ρ\rhoρ and the low-degree part of the Plancherel mass ∑bdb2\sum_b d_b^2∑b​db2​ of HHH; it is the general mechanism that turns coset caps into decay in every irreducible unitary representation.

Formalization Note The averaging operator is integrated ρ (fun g => (ν g : ℂ)). The homomorphism ψ\psiψ need not be injective; the coset sum runs over h∈Hh\in Hh∈H, with multiplicity. The hypothesis D≠0D\neq0D=0 is stated explicitly.

Preamble
import Mathlib
import Definitions.Def_ThorpFirstReciprocal
import Definitions.Def_OAI_Probability_ThorpShuffle_Model
import Definitions.Def_OAI_Probability_ThorpShuffle_PairAveraging
import Definitions.Def_OAI_Probability_ThorpShuffle_Walsh
import Definitions.Def_OAI_Probability_ThorpShuffle_Support
import Definitions.Def_OAI_Probability_ThorpShuffle_ConditionalFlow
import Definitions.Def_OAI_Probability_ThorpShuffle_FiniteExpectation
import Definitions.Def_OAI_Probability_ThorpShuffle_WalshFlow
import Definitions.Def_OAI_Probability_ThorpShuffle_FreshCoins
import Definitions.Def_OAI_Probability_ThorpShuffle_HalfHistories
import Definitions.Def_OAI_Probability_ThorpShuffle_NoiseEnergy
import Definitions.Def_OAI_Probability_ThorpShuffle_EnergyDecay
import Definitions.Def_OAI_Probability_ThorpShuffle_MarginalEnergy
import Definitions.Def_OAI_Probability_ThorpShuffle_ConditionalLaw
import Definitions.Def_OAI_Probability_ThorpShuffle_TaggedCompletion
import Definitions.Def_OAI_Probability_ThorpShuffle_Reachability
import Definitions.Def_OAI_Probability_ThorpShuffle_Cyclic
import Definitions.Def_OAI_Probability_ThorpShuffle_Tableaux
import Definitions.Def_OAI_Probability_ThorpShuffle_Specht
import Definitions.Def_OAI_Probability_ThorpShuffle_Polytabloids
import Definitions.Def_OAI_Probability_ThorpShuffle_Irreducibility
import Definitions.Def_OAI_Probability_ThorpShuffle_Classification
import Definitions.Def_OAI_Probability_ThorpShuffle_LinearExtensions
import Definitions.Def_OAI_Probability_ThorpShuffle_ExtensionBounds
import Definitions.Def_OAI_Probability_ThorpShuffle_PartitionBounds
import Definitions.Def_OAI_Probability_ThorpShuffle_DegreeBounds
import Definitions.Def_OAI_Probability_ThorpShuffle_FirstMoment
import Definitions.Def_OAI_Probability_ThorpShuffle_Reynolds
import Definitions.Def_OAI_Probability_ThorpShuffle_FourierFamilies
import Definitions.Def_OAI_Probability_ThorpShuffle_JointProjectors
import Definitions.Def_OAI_Probability_ThorpShuffle_ProductProjectors

open OAI OAI.Thorp OAI.Thorp.Fourier OAI.Thorp.Fourier.Family
universe uG uH uE uJ
open scoped BigOperators ComplexConjugate InnerProductSpace
open Filter Topology
open scoped Classical
variable {G H I : Type} [Group G] [Fintype G] [Group H] [Fintype H]
  [Fintype I] [Nonempty I] (F : Family H)
variable {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E] [FiniteDimensional ℂ E]
Formal statement
theorem OAI.Thorp.Fourier.Family.integrated_norm_sq (ρ : Representation ℂ G E) [Representation.IsIrreducible ρ]
    (hu : ∀ g x y, ⟪ρ g x, ρ g y⟫_ℂ = ⟪x, y⟫_ℂ)
    (hE : Module.finrank ℂ E ≠ 0) (ψ : (I → H) →* G) (ν : G → ℝ) (B : ℝ)
    (hν : ∀ g, 0 ≤ ν g) (h1 : ∑ g, ν g = 1) (hB : 0 ≤ B)
    (hcoset : ∀ i g, ∑ h, ν (g * ψ (Pi.mulSingle i h)) ≤
      B * (Fintype.card H : ℝ) / Fintype.card G) (v : E) :
    ‖integrated ρ (fun g => (ν g : ℂ)) v‖ ^ 2 ≤
      (Fintype.card I : ℝ) * B *
        (∑ b ∈ Finset.univ.filter (fun b => F.degree b ^ Fintype.card I ≤ Module.finrank ℂ E),
          (F.degree b : ℝ)^2) / Module.finrank ℂ E * ‖v‖ ^ 2 := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/Probability/ThorpShuffle/CosetBounds.lean#L154-L185

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me