Lemma 10, valid clauses (B1)–(B3)
OpenQAlgorithms.Papers.Independent.Intakenext100.P20.specht_bounds_and_type_countLet . Let be the Young diagrams with boxes and at most rows, and write for padded row lengths. Put , , and let be the actual symmetric-group Specht factor. Then
These are exactly clauses (B1)-(B3), which can be retained independently of the defective Schur-factor bound (B4).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
noncomputable section
open scoped Matrix ENNReal ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P20
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)
attribute [local instance] Classical.propDecidable
/-- Lemma 10, PDF pp.9-10, precisely the valid clauses (B1)-(B3).
The separately false Schur-factor bound (B4) is excluded and deferred. -/
theorem specht_bounds_and_type_count {d n : ℕ} (hd : 0 < d) (hn : 0 < n) :
(∀ shape : Schur.Partition d n,
Real.exp ((n : ℝ) * shannonNats (Schur.normalizedRows hd hn shape)) * lowerPrefactor d n ≤
(Module.finrank ℂ (Schur.spechtSpace shape) : ℝ) ∧
(Module.finrank ℂ (Schur.spechtSpace shape) : ℝ) ≤
(n + d : ℝ) ^ (2 * d) *
Real.exp ((n : ℝ) * shannonNats (Schur.normalizedRows hd hn shape))) ∧
Fintype.card (Schur.Partition d n) ≤ (n + 1) ^ d := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any positive natural numbers , and every Young diagram with exactly cells and at most rows, let for , where is row 's length and missing rows have length , and put , using natural logarithms and . Fix the chosen bijection between the cells and , let be the permutations preserving respectively the row and the column of each numbered cell, and let be the range of the matrix
Then
In addition, the number of Young diagrams with cells and at most rows is at most . Both positivity assumptions are required; zero row lengths within an allowed diagram are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.