Entropy lower bound for the dimension of a constituent of a signed type
ProvedOAI.SignedSweeps.signed_pair_log_dimension_lowerThis is the dimension lower bound for the constituents of a signed type: a Specht module containing has dimension at least the exponential of the entropy of , up to a polynomial factor controlled by the number of rows.
Let , let and have at most rows each, and let . Fix a bijection , which embeds in , and suppose there is an injective linear map intertwining . Write
for the entropy of the concatenated row lengths. Then for every integer ,
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 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.
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
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