Operator-norm decay under coset caps on eight symmetric-group blocks
ProvedOAI.Thorp.Current.eight_block_of_capThe constant . For and a partition of , let be the complex inner product space with orthonormal basis the -tabloids (ways of distributing into rows of sizes ), on which the symmetric group acts by permuting entries. Fix a bijection between and the cells of the Young diagram of , let be the group of permutations preserving every column of , and let be the polytabloid, where is the tabloid of . The Specht module is the span of , and . Put
The theorem. Let be a finite group, an integer, and a group homomorphism, where is the symmetric group on letters; for let put in coordinate and the identity elsewhere. Let be a finite-dimensional complex inner product space of dimension and an irreducible representation of on by unitary operators. Let satisfy for all and , and assume the coset caps
Then the averaging operator satisfies
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 positions split into eight blocks of size .
Formalization Note is OAI.Thorp.Current.C1, defined as sSup of the range of on ; boundedness of that range is proved along the way, so is the genuine supremum. is the dimension of the concrete Specht module Specht.Space p, whose tableau is a fixed bijection chosen by Fintype.equivOfCardEq. is a real power, and because irreducible representations are nonzero. The operator norm is that of LinearMap.toContinuousLinearMap (integrated ρ (fun g => (ν g : ℂ))).
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
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