Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Low-degree Plancherel mass is at most D3/8D^{3/8}D3/8 times the inverse-degree sum

Proved
OAI.Thorp.Current.low_degree_first

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

inequalitiesoai-mathrepresentation-theory

Let HHH be a finite group and let (ρb,Vb)b∈Λ(\rho_b,V_b)_{b\in\Lambda}(ρb​,Vb​)b∈Λ​ be 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. Then for every natural number DDD,

∑b∈Λ: db8≤Ddb2 ≤ D3/8∑b∈Λ1db.\sum_{b\in\Lambda:\ d_b^{8}\le D}d_b^{2}\ \le\ D^{3/8}\sum_{b\in\Lambda}\frac1{d_b}.b∈Λ: db8​≤D∑​db2​ ≤ D3/8b∈Λ∑​db​1​.

The summation condition db8≤Dd_b^8\le Ddb8​≤D means db≤D1/8d_b\le D^{1/8}db​≤D1/8, the low-degree range that arises for products of eight copies of HHH. The inequality converts the low-degree part of the Plancherel mass ∑bdb2\sum_b d_b^2∑b​db2​ into the first inverse-degree moment ∑b1/db\sum_b 1/d_b∑b​1/db​; whenever the latter is uniformly bounded, as for the symmetric groups, this yields a bound of order D3/8D^{3/8}D3/8.

Formalization Note D3/8D^{3/8}D3/8 is the real power Real.rpow with DDD cast to a real number. The proof only uses that every degree is positive.

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.low_degree_first {H : Type} [Group H] [Fintype H]
    (F : Fourier.Family H) (D : ℕ) :
    (∑ b ∈ Finset.univ.filter (fun b => F.degree b ^ 8 ≤ D), (F.degree b : ℝ)^2) ≤
      (D : ℝ) ^ (3 / 8 : ℝ) * ∑ b, (F.degree b : ℝ)⁻¹ := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/Probability/ThorpShuffle/FirstFourier.lean#L15-L41

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