Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Trace of a positive coefficient restricted to a subgroup, in a representation with large constituents

Proved
OAI.SignedSweeps.sector_positive_restriction

by wurtle · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

representation-theorysigned-sweepsthorp-shuffle

This is a quantitative form of the restriction of positive group-algebra elements to a subgroup, for a finite-dimensional representation whose constituents have large dimension.

Let i:Sp→Sni:S_p\to S_ni:Sp​→Sn​ be an injective homomorphism, let f:Sn→Cf:S_n\to\mathbb{C}f:Sn​→C act as a positive operator in the regular representation, and let ρ\rhoρ be a representation of SpS_pSp​ on a finite-dimensional Hilbert space EEE. For D>0D>0D>0, T≥0T\ge0T≥0, suppose that every μ⊢p\mu\vdash pμ⊢p with a nonzero intertwiner Sμ→ES^\mu\to ESμ→E satisfies dim⁡Sμ≥D\dim S^\mu\ge DdimSμ≥D, and moreover every λ⊢n\lambda\vdash nλ⊢n with a nonzero SpS_pSp​-intertwiner Sμ→SλS^\mu\to S^\lambdaSμ→Sλ satisfies

dim⁡Sλ Re⁡Tr⁡Sλπλ(f)≤T.\dim S^\lambda\,\operatorname{Re}\operatorname{Tr}_{S^\lambda}\pi_\lambda(f)\le T.dimSλReTrSλ​πλ​(f)≤T.

Then, with π(f)=∑gf(g)π(g)\pi(f)=\sum_gf(g)\pi(g)π(f)=∑g​f(g)π(g) and p(n)p(n)p(n) the number of partitions of nnn,

Re⁡Tr⁡E ρ(f∘i)≤dim⁡ED2⋅p!n!⋅p(n)⋅T.\operatorname{Re}\operatorname{Tr}_E\,\rho(f\circ i)\le\frac{\dim E}{D^2}\cdot\frac{p!}{n!}\cdot p(n)\cdot T.ReTrE​ρ(f∘i)≤D2dimE​⋅n!p!​⋅p(n)⋅T.

It carries the exact index of the subgroup into the local stabilizer traces of the signed sweep induction.

Formalization Note The upstream statement is reproduced verbatim from ProjectionTrace.lean.

Preamble
import Mathlib
import Definitions.Def_SignedSweepMoment
import Definitions.Def_OAISignedSweepsProofDefs
import Definitions.Def_OAISignedSweepsProofDefs2

namespace OAI

noncomputable section
namespace SignedSweeps
open scoped BigOperators TensorProduct Classical
open Module
Formal statement
theorem sector_positive_restriction {p n : ℕ} {E : Type*}
    [NormedAddCommGroup E] [InnerProductSpace ℂ E] [FiniteDimensional ℂ E]
    (ρ : Representation ℂ (SymmetricGroup p) E)
    (i : SymmetricGroup p →* SymmetricGroup n) (hi : Function.Injective i)
    (f : SymmetricGroup n → ℂ)
    (hf : (coefficientAction finiteRegularRepresentation f).IsPositive)
    (D T : ℝ) (hD : 0 < D) (hT : 0 ≤ T)
    (hdegree : ∀ mu : Partition p,
      (∃ k : Representation.IntertwiningMap (spechtRepresentation mu) ρ, k ≠ 0) →
        D ≤ spechtDimension mu)
    (hambient : ∀ mu : Partition p,
      (∃ k : Representation.IntertwiningMap (spechtRepresentation mu) ρ, k ≠ 0) →
      ∀ lam : Partition n,
        (∃ k : Representation.IntertwiningMap (spechtRepresentation mu)
          ((spechtRepresentation lam).comp i), k ≠ 0) →
        (spechtDimension lam : ℝ) *
          (LinearMap.trace ℂ (Specht lam) (coefficientAction (spechtRepresentation lam) f)).re ≤ T) :
    (LinearMap.trace ℂ E (coefficientAction ρ (fun g => f (i g)))).re ≤
      (finrank ℂ E : ℝ) *
        (((p.factorial : ℝ) / n.factorial) * (Fintype.card (Partition n) : ℝ) * T) / D^2 := by sorry

end SignedSweeps
end
end OAI
Source
OpenAI, "Signed tensor densities and diagram budgets for the Thorp shuffle" (September 26, 2026), openai/math preprints/Signed-tensor-densities-and-diagram-budgets-for-coordinate-sweeps-September-26-2026/paper.pdf, Section 3, Lemma 3.3, eq. (13), and Lemma 3.5. Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Probability/SignedSweeps/ProjectionTrace.lean#L81-L164

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