Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Entropy lower bound for the dimension of a constituent of a signed type

Proved
OAI.SignedSweeps.signed_pair_log_dimension_lower

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

representation-theorysigned-sweepsthorp-shuffle

This is the dimension lower bound for the constituents of a signed type: a Specht module containing Sa⊗SbtS^a\otimes S^{b^t}Sa⊗Sbt has dimension at least the exponential of the entropy of (a,b)(a,b)(a,b), up to a polynomial factor controlled by the number of rows.

Let u+v=nu+v=nu+v=n, let a⊢ua\vdash ua⊢u and b⊢vb\vdash vb⊢v have at most qqq rows each, and let λ⊢n\lambda\vdash nλ⊢n. Fix a bijection e:{1,…,u}⊔{1,…,v}→{1,…,n}e:\{1,\dots,u\}\sqcup\{1,\dots,v\}\to\{1,\dots,n\}e:{1,…,u}⊔{1,…,v}→{1,…,n}, which embeds Su×SvS_u\times S_vSu​×Sv​ in SnS_nSn​, and suppose there is an injective linear map Sa⊗Sbt→SλS^a\otimes S^{b^t}\to S^\lambdaSa⊗Sbt→Sλ intertwining Su×SvS_u\times S_vSu​×Sv​. Write

F(a,b)=∑x∈a∪bxlog⁡u+vxF(a,b)=\sum_{x\in a\cup b}x\log\frac{u+v}{x}F(a,b)=x∈a∪b∑​xlogxu+v​

for the entropy of the concatenated row lengths. Then for every integer B≥2n+2q+1B\ge 2n+2q+1B≥2n+2q+1,

F(a,b)−4q(log⁡(n+1)+1)−12q2log⁡B≤log⁡dim⁡Sλ.F(a,b)-4q\big(\log(n+1)+1\big)-12q^2\log B\le\log\dim S^\lambda.F(a,b)−4q(log(n+1)+1)−12q2logB≤logdimSλ.

This compares the dimension of a constituent with the entropy of the type, and it is the input that turns a moment bound into a saving of the entropy in the local stabilizer traces.

Formalization Note The Lean statement fixes an explicit occurrence through the map fff rather than the induced module, and its explicit constants differ from those displayed in Lemma 3.4 of the source. It is reproduced verbatim from SignedPairDimension.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 signed_pair_log_dimension_lower {u v n q : ℕ}
    (hn : u+v=n) (a : Partition u) (b : Partition v) (lam : Partition n)
    (ha : a.1.colLen 0 ≤ q) (hb : b.1.colLen 0 ≤ q)
    (e : Fin u ⊕ Fin v ≃ Fin n)
    (f : (Specht a ⊗[ℂ] Specht b.transpose) →ₗ[ℂ] Specht lam)
    (hf : Function.Injective f)
    (hint : ∀ (g : SymmetricGroup u) (h : SymmetricGroup v) x,
      f (TensorProduct.map (spechtRepresentation a g) (spechtRepresentation b.transpose h) x) =
        spechtRepresentation lam (e.permCongr (g.sumCongr h)) (f x))
    (B : ℕ) (hB : 2*n+2*q+1 ≤ B) :
    signedEntropy a b - 4*(q : ℝ)*(Real.log (n+1 : ℕ)+1) -
      12*(q : ℝ)^2*Real.log B ≤ Real.log (spechtDimension lam : ℝ) := 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.4, eq. (14). Lean: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Probability/SignedSweeps/SignedPairDimension.lean#L133-L168

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