Multiplicities of first- and second-order activation spaces
OpenQAlgorithms.Papers.Independent.Intakenext100.P94.activation_multiplicitiesUse the real Specht models indexed by partitions in the paper’s order. For , the first-order permutation representation has multiplicities on . For , use the four shapes . The ordered off-diagonal and full matrix representations have types
All other multiplicities are zero. Here a type means the existence of an actual invertible equivariant real linear identification with the corresponding copies of the concrete Specht modules, not just equality of dimensions. These decompositions explain the parameter counts of the second-order layers.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P94
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P94
open scoped BigOperators
attribute [local instance] Classical.propDecidable
/-- Unnumbered activation multiplicities, source PDF p.4 and p.15.
First-order range n≥2; the four-shape stable range is n≥4. Trailing copies are zero. -/
theorem activation_multiplicities :
(∀ (n : ℕ), 2 ≤ n →
∀ lambda : Fin 2 → QAlgorithms.Schur.Partition n n,
(∀ a, (lambda a).val.rowLens = (![[n], [n-1,1]] : Fin 2 → List ℕ) a) →
HasTensorType (⊤ : Submodule ℝ (Tensor n 1)) lambda ![1,1]) ∧
(∀ (n : ℕ), 4 ≤ n →
∀ lambda : Fin 4 → QAlgorithms.Schur.Partition n n,
(∀ a, (lambda a).val.rowLens = secondShapes n a) →
HasTensorType (DistinctSpace n 2) lambda ![1,2,1,1] ∧
HasTensorType (⊤ : Submodule ℝ (Tensor n 2)) lambda ![2,3,1,1]) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P94
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Write and let be the real vector space of all functions , where a tuple in is a function . Permutations of act by . For a Young diagram with cells and first-column length at most , fix the cell numbering by used in the definition, let and be the permutations preserving, respectively, the row and column of every numbered cell, and let be the range of the matrix
For a subspace , a family , and multiplicities , the decomposition assertion below means that there exists a real-linear isomorphism such that, for every and , there exists satisfying for every , and for every , , and . The theorem asserts both of the following: for every natural number and every family of such Young diagrams whose row-length lists are respectively and , this decomposition assertion holds for with multiplicities ; and, for every natural number and every family whose row-length lists are respectively , , , and , it holds both for the subspace of consisting of functions that vanish whenever the two tuple entries coincide, with multiplicities , and for all of , with multiplicities .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.