Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Operator-norm decay 32C1 D−5/16\sqrt{32C_1}\,D^{-5/16}32C1​​D−5/16 under coset caps on eight symmetric-group blocks

Proved
OAI.Thorp.Current.eight_block_of_cap

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

oai-mathprobabilityrepresentation-theorysymmetric-group

The constant C1C_1C1​. For n≥0n\ge0n≥0 and a partition λ\lambdaλ of nnn, let MλM^\lambdaMλ be the complex inner product space with orthonormal basis the λ\lambdaλ-tabloids (ways of distributing {1,…,n}\{1,\dots,n\}{1,…,n} into rows of sizes λ1,λ2,…\lambda_1,\lambda_2,\dotsλ1​,λ2​,…), on which the symmetric group Sn\mathfrak S_nSn​ acts by permuting entries. Fix a bijection TTT between {1,…,n}\{1,\dots,n\}{1,…,n} and the cells of the Young diagram of λ\lambdaλ, let CTC_TCT​ be the group of permutations preserving every column of TTT, and let eT=∑π∈CTsgn⁡(π) π{T}e_T=\sum_{\pi\in C_T}\operatorname{sgn}(\pi)\,\pi\{T\}eT​=∑π∈CT​​sgn(π)π{T} be the polytabloid, where {T}\{T\}{T} is the tabloid of TTT. The Specht module Sλ⊆MλS^\lambda\subseteq M^\lambdaSλ⊆Mλ is the span of {πeT:π∈Sn}\{\pi e_T:\pi\in\mathfrak S_n\}{πeT​:π∈Sn​}, and fλ=dim⁡CSλf^\lambda=\dim_{\mathbb C}S^\lambdafλ=dimC​Sλ. Put

R1(n)=∑λ⊢n1fλ,C1=sup⁡n≥1R1(n).R_1(n)=\sum_{\lambda\vdash n}\frac1{f^\lambda},\qquad C_1=\sup_{n\ge1}R_1(n).R1​(n)=λ⊢n∑​fλ1​,C1​=n≥1sup​R1​(n).

The theorem. Let GGG be a finite group, s≥1s\ge1s≥1 an integer, and ψ ⁣:(Ss)8→G\psi\colon(\mathfrak S_s)^8\to Gψ:(Ss​)8→G a group homomorphism, where Ss\mathfrak S_sSs​ is the symmetric group on sss letters; for i∈{0,…,7}i\in\{0,\dots,7\}i∈{0,…,7} let ιi ⁣:Ss→(Ss)8\iota_i\colon\mathfrak S_s\to(\mathfrak S_s)^8ιi​:Ss​→(Ss​)8 put hhh in coordinate iii and the identity elsewhere. Let EEE be a finite-dimensional complex inner product space of dimension DDD and ρ\rhoρ an irreducible representation of GGG on EEE by unitary operators. Let ν ⁣:G→R\nu\colon G\to\mathbb Rν:G→R satisfy ν(g)≥0\nu(g)\ge0ν(g)≥0 for all ggg and ∑gν(g)=1\sum_g\nu(g)=1∑g​ν(g)=1, and assume the coset caps

∑h∈Ssν(g ψ(ιi(h)))≤4 s!∣G∣for all i∈{0,…,7} and g∈G.\sum_{h\in\mathfrak S_s}\nu\big(g\,\psi(\iota_i(h))\big)\le\frac{4\,s!}{|G|}\qquad\text{for all }i\in\{0,\dots,7\}\text{ and }g\in G.h∈Ss​∑​ν(gψ(ιi​(h)))≤∣G∣4s!​for all i∈{0,…,7} and g∈G.

Then the averaging operator satisfies

∥∑g∈Gν(g) ρ(g)∥op≤32 C1  D−5/16.\Big\|\sum_{g\in G}\nu(g)\,\rho(g)\Big\|_{\mathrm{op}}\le\sqrt{32\,C_1}\;D^{-5/16}.​g∈G∑​ν(g)ρ(g)​op​≤32C1​​D−5/16.

So a probability measure that gives every left coset of each of the eight block subgroups at most four times its uniform share contracts in every irreducible unitary representation, at a rate polynomial in the dimension. This is the form in which the bound is applied to permutations of the 2d2^d2d positions {0,1}d\{0,1\}^d{0,1}d split into eight blocks of size 2d−32^{d-3}2d−3.

Formalization Note C1C_1C1​ is OAI.Thorp.Current.C1, defined as sSup of the range of R1R_1R1​ on n≥1n\ge1n≥1; boundedness of that range is proved along the way, so C1C_1C1​ is the genuine supremum. fλf^\lambdafλ is the dimension of the concrete Specht module Specht.Space p, whose tableau is a fixed bijection chosen by Fintype.equivOfCardEq. D−5/16D^{-5/16}D−5/16 is a real power, and D≥1D\ge1D≥1 because irreducible representations are nonzero. The operator norm is that of LinearMap.toContinuousLinearMap (integrated ρ (fun g => (ν g : ℂ))).

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
import Definitions.Def_OAI_Probability_ThorpShuffle_SymmetricFamilies
import Definitions.Def_OAI_Probability_ThorpShuffle_BlockEmbedding

open OAI OAI.Thorp OAI.Thorp.Current
universe uE
open scoped BigOperators Classical ComplexConjugate InnerProductSpace
open Thorp.Fourier
Formal statement
theorem OAI.Thorp.Current.eight_block_of_cap {G : Type} [Group G] [Fintype G]
    (s : ℕ) (hs : 1 ≤ s)
    {E : Type uE} [NormedAddCommGroup E] [InnerProductSpace ℂ E]
    [FiniteDimensional ℂ E]
    (ρ : Representation ℂ G E) [Representation.IsIrreducible ρ]
    (hu : ∀ g x y, ⟪ρ g x, ρ g y⟫_ℂ = ⟪x, y⟫_ℂ)
    (ψ : (Fin 8 → Equiv.Perm (Fin s)) →* G)
    (ν : G → ℝ) (hν : ∀ g, 0 ≤ ν g) (h1 : ∑ g, ν g = 1)
    (hcoset : ∀ (i : Fin 8) g,
      ∑ h : Equiv.Perm (Fin s), ν (g * ψ (Pi.mulSingle i h)) ≤
        4 * (Fintype.card (Equiv.Perm (Fin s)) : ℝ) / Fintype.card G) :
    ‖LinearMap.toContinuousLinearMap (integrated ρ (fun g => (ν g : ℂ)))‖ ≤
      Real.sqrt (32 * C1) * (Module.finrank ℂ E : ℝ) ^ (-5 / 16 : ℝ) := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/Probability/ThorpShuffle/FirstFourier.lean#L43-L93

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