Third-order equality strata and 203 linear parameters
OpenQAlgorithms.Papers.Independent.Intakenext100.P94.third_order_parametersLet and order the seven shapes as . In the full real order-three tensor representation, split the coordinates into pairwise distinct indices, three exactly-two-equal patterns, and all-equal indices. Their respective multiplicity vectors are , for each of the three middle strata, and . Consequently the full type is and
Each type is an actual equivariant linear isomorphism to copies of concrete real Specht modules. The count concerns the linear operation before any nonlinearity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P94
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P94
open scoped BigOperators
attribute [local instance] Classical.propDecidable
/-- Appendix C §10.1, source PDF p.15: all five equality strata, full type and
203-dimensional space of linear layers. Stable range n≥6 is explicit; the
printed count fails for small n. The dimensions count maps, never scalar evaluations. -/
theorem third_order_parameters (n : ℕ) (hn : 6 ≤ n)
(lambda : Fin 7 → QAlgorithms.Schur.Partition n n)
(hshape : ∀ a, (lambda a).val.rowLens = thirdShapes n a) :
HasTensorType (DistinctSpace n 3) lambda ![1,3,3,3,1,2,1] ∧
(∀ a : Fin 3, HasTensorType (supportedSpace (pairPattern a)) lambda ![1,2,1,1,0,0,0]) ∧
HasTensorType (supportedSpace (fun t : Fin 3 → Fin n => ∀ a b, t a = t b))
lambda ![1,1,0,0,0,0,0] ∧
HasTensorType (⊤ : Submodule ℝ (Tensor n 3)) lambda ![5,10,6,6,1,2,1] ∧
Module.finrank ℝ (equivariantLinearMaps (permutationTensorAction (n := n) (k := 3))
(permutationTensorAction (n := n) (k := 3))) = 203 := 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 . For every natural number and every family of Young diagrams with cells and first-column length at most , assume their row-length lists are respectively , , , , , , and . Let be the real vector space of all functions on triples , with permutation action . For each , use the fixed numbering of its cells by , let consist of permutations preserving every numbered cell’s row and column, respectively, and define as the range of the matrix
For any subspace and multiplicity vector , a decomposition assertion here means that there exists a real-linear isomorphism such that, for every and , there exists with for every triple , and for every , , and . The theorem asserts all of the following: this decomposition holds for functions vanishing on all triples that are not injective, with multiplicities ; for every , it holds for functions vanishing outside the triples satisfying and , with indices modulo , with multiplicities ; it holds for functions vanishing outside triples whose three entries are all equal, with multiplicities ; and it holds for all of , with multiplicities . A zero multiplicity contributes no copies and no coordinate conditions. Finally, the real vector space of real-linear maps satisfying for every and has dimension exactly .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.