Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The cyclic staircase module inside the tensor square of the staircase Specht module

Definition
OAI_RepresentationTheory_Saxl_CyclicTensor

by Shuze Chen · Oct 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

oai-mathrepresentation-theorysymmetric-group

This file contains three general constructions for complex group representations and uses them to place an explicit cyclic module inside the tensor square of the staircase Specht module. Throughout, GGG is a group, representations are complex vector spaces with a linear GGG-action, and an intertwiner is a GGG-equivariant linear map.

  1. Equal subrepresentations. If S=TS=TS=T are equal subrepresentations of a representation, the identity map is an isomorphism of representations S≅TS\cong TS≅T.
  2. Image of an injective intertwiner. If f:V→Wf:V\to Wf:V→W is an injective intertwiner, then fff is an isomorphism of representations from VVV onto the subrepresentation f(V)⊆Wf(V)\subseteq Wf(V)⊆W.
  3. Pull-back along an injective intertwiner. If f:V→Wf:V\to Wf:V→W is an injective intertwiner and S⊆WS\subseteq WS⊆W is a subrepresentation with S⊆f(V)S\subseteq f(V)S⊆f(V), then f−1∣S:S→Vf^{-1}|_S:S\to Vf−1∣S​:S→V (the inclusion S↪f(V)S\hookrightarrow f(V)S↪f(V) followed by the inverse of the isomorphism in item 2) is an intertwiner.
  4. The staircase cyclic module and its embedding. Fix m∈Nm\in\mathbb{N}m∈N and let δm={(i,j)∈N2:i+j<m}\delta_m=\{(i,j)\in\mathbb{N}^2: i+j<m\}δm​={(i,j)∈N2:i+j<m} be the staircase diagram, with n=∣δm∣=m(m+1)/2n=|\delta_m|=m(m+1)/2n=∣δm​∣=m(m+1)/2 cells and mmm rows. Write [d]={0,…,d−1}[d]=\{0,\dots,d-1\}[d]={0,…,d−1}. The symmetric group SnS_nSn​ acts on the word space Wn,dW_{n,d}Wn,d​ of functions xxx on words a:[n]→[d]a:[n]\to[d]a:[n]→[d] by permuting positions, (g⋅x)(a)=x(a∘g)(g\cdot x)(a)=x(a\circ g)(g⋅x)(a)=x(a∘g). Let TTT be the fixed canonical tableau of δm\delta_mδm​ (a bijection from the positions [n][n][n] to the cells) and T′T'T′ the transposed tableau, which puts position ppp at the transpose of the cell T(p)T(p)T(p). Write eT,eT′∈Wn,me_T,e_{T'}\in W_{n,m}eT​,eT′​∈Wn,m​ for their polytabloids (signed sums, over the column-preserving permutations, of the indicator of the row word) and SδmS^{\delta_m}Sδm​ for the Specht module spanned by the SnS_nSn​-orbit of eTe_TeT​; both polytabloids lie in SδmS^{\delta_m}Sδm​. Reading a word over the pair alphabet [m]×[m][m]\times[m][m]×[m] as a pair of words (a,b)(a,b)(a,b) identifies Wn,m⊗Wn,m≅Wn,m2W_{n,m}\otimes W_{n,m}\cong W_{n,m^2}Wn,m​⊗Wn,m​≅Wn,m2​ via x⊗y↦((a,b)↦x(a) y(b))x\otimes y\mapsto\bigl((a,b)\mapsto x(a)\,y(b)\bigr)x⊗y↦((a,b)↦x(a)y(b)). The staircase cyclic module is
Cm=span⁡C{ g⋅(eT′⊗eT):g∈Sn }⊆Wn,m2,C_m=\operatorname{span}_{\mathbb{C}}\{\,g\cdot(e_{T'}\otimes e_T): g\in S_n\,\}\subseteq W_{n,m^2},Cm​=spanC​{g⋅(eT′​⊗eT​):g∈Sn​}⊆Wn,m2​,

and the composite Sδm⊗Sδm↪Wn,m⊗Wn,m≅Wn,m2S^{\delta_m}\otimes S^{\delta_m}\hookrightarrow W_{n,m}\otimes W_{n,m}\cong W_{n,m^2}Sδm​⊗Sδm​↪Wn,m​⊗Wn,m​≅Wn,m2​ is an injective intertwiner for the diagonal action whose image contains CmC_mCm​. Item 3 then gives an injective intertwiner

Ψm:Cm⟶Sδm⊗Sδm.\Psi_m:C_m\longrightarrow S^{\delta_m}\otimes S^{\delta_m}.Ψm​:Cm​⟶Sδm​⊗Sδm​.
  1. Cyclic form of the staircase Saxl statement. The proposition CS\mathrm{CS}CS asserts: for every m≥1m\ge1m≥1 and every Young diagram μ\muμ with ∣μ∣=∣δm∣|\mu|=|\delta_m|∣μ∣=∣δm​∣, there is a nonzero intertwiner Sμ→CmS^\mu\to C_mSμ→Cm​, where SμS^\muSμ is the Specht module of μ\muμ built from its fixed canonical tableau on the positions [n][n][n].

Because Ψm\Psi_mΨm​ is injective, composing with it turns a nonzero intertwiner Sμ→CmS^\mu\to C_mSμ→Cm​ into a nonzero intertwiner Sμ→Sδm⊗SδmS^\mu\to S^{\delta_m}\otimes S^{\delta_m}Sμ→Sδm​⊗Sδm​. Hence CS\mathrm{CS}CS implies that every Specht module of size m(m+1)/2m(m+1)/2m(m+1)/2 occurs in the tensor square of the staircase Specht module, which is the Kronecker-multiplicity form of the Saxl conjecture for staircases. The advantage of CmC_mCm​ is that it is generated by the single explicit vector eT′⊗eTe_{T'}\otimes e_TeT′​⊗eT​, so occurrences of SμS^\muSμ can be certified by computations with that vector.

Formalization Note The items are equivOfSubrepEq, intertwiningRangeEquiv, intertwiningLiftSubrep, staircaseToTensor m and CyclicSaxlConjecture; CmC_mCm​ is staircaseCyclic m. Letters of [m]×[m][m]\times[m][m]×[m] are encoded in Fin (m*m) by finProdFinEquiv, the number of rows mmm appears as (staircase m).colLen 0, and the two lifted maps are marked irreducible.

Definition code
-- Generated from openai/math@1581d4c lean/OAI/RepresentationTheory/Saxl/CyclicTensor.lean by skeleton subtraction
-- (upload_full_project.md Phase 3): Definitions bundle for the Saxl mission closure.
-- Kept: reachable definitions/instances and the theorems their bodies or the node statements cite.
-- Project imports rewritten to platform modules; otherwise byte-identical to the source.
import Mathlib
import Definitions.Def_Saxl
import Definitions.Def_OAI_RepresentationTheory_Saxl_Basic
import Definitions.Def_OAI_RepresentationTheory_Saxl_Polytabloid
import Definitions.Def_OAI_RepresentationTheory_Saxl_SpechtSubmodule
import Definitions.Def_OAI_RepresentationTheory_Saxl_SpechtDuality
import Definitions.Def_OAI_RepresentationTheory_Saxl_TableauTransport
import Definitions.Def_OAI_RepresentationTheory_Saxl_StaircaseTensor
import Definitions.Def_OAI_RepresentationTheory_Saxl_HighProjection
import Definitions.Def_OAI_RepresentationTheory_Saxl_CoordinateSector
import Definitions.Def_OAI_RepresentationTheory_Saxl_PositionSplit
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandFactorization
import Definitions.Def_OAI_RepresentationTheory_Saxl_PathAlternation
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandMatrices
import Definitions.Def_OAI_RepresentationTheory_Saxl_PathContraction
import Definitions.Def_OAI_RepresentationTheory_Saxl_ColumnContraction
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandPairing
import Definitions.Def_OAI_RepresentationTheory_Saxl_CyclicSector
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandSupport
import Definitions.Def_OAI_RepresentationTheory_Saxl_ShapeRigidity
import Definitions.Def_OAI_RepresentationTheory_Saxl_SpechtClassification
import Definitions.Def_OAI_RepresentationTheory_Saxl_SupportSeparation
import Definitions.Def_OAI_RepresentationTheory_Saxl_PositionTensor
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandOrbit
import Definitions.Def_OAI_RepresentationTheory_Saxl_BandGlue
import Definitions.Def_OAI_RepresentationTheory_Saxl_SignEquivalence
import Definitions.Def_OAI_RepresentationTheory_Saxl_PieriRestriction
import Definitions.Def_OAI_RepresentationTheory_Saxl_StripExtension
import Definitions.Def_OAI_RepresentationTheory_Saxl_SizedStrips
import Definitions.Def_OAI_RepresentationTheory_Saxl_HorizontalRemoval
import Definitions.Def_OAI_RepresentationTheory_Saxl_YoungRule

namespace OAI

noncomputable section

open scoped TensorProduct

universe uG uX uY

namespace Saxl

def equivOfSubrepEq {G : Type uG} {X : Type uX} [Group G] [AddCommGroup X] [Module ℂ X]
    {ρ : Representation ℂ G X} (S T : Subrepresentation ρ) (h : S = T) :
    Representation.Equiv S.toRepresentation T.toRepresentation := by
  subst T
  exact Representation.Equiv.refl _

/- Positive Young rule as a concrete orbit map (including reordered contents). -/
def intertwiningRangeEquiv {G : Type uG} {X : Type uX} {Y : Type uY} [Group G] [AddCommGroup X] [Module ℂ X]
    [AddCommGroup Y] [Module ℂ Y] {ρ : Representation ℂ G X} {σ : Representation ℂ G Y}
    (f : Representation.IntertwiningMap ρ σ) (hf : Function.Injective f) :
    ρ.Equiv f.range.toRepresentation where
  toLinearEquiv := LinearEquiv.ofInjective f.toLinearMap hf
  isIntertwining' g := by
    apply LinearMap.ext
    intro x
    apply Subtype.ext
    exact LinearMap.congr_fun (f.isIntertwining' g) x

def intertwiningLiftSubrep {G : Type uG} {X : Type uX} {Y : Type uY} [Group G] [AddCommGroup X] [Module ℂ X]
    [AddCommGroup Y] [Module ℂ Y] {ρ : Representation ℂ G X} {σ : Representation ℂ G Y}
    (f : Representation.IntertwiningMap ρ σ) (hf : Function.Injective f)
    (S : Subrepresentation σ) (hS : S ≤ f.range) :
    Representation.IntertwiningMap S.toRepresentation ρ := by
  let e : ρ.Equiv f.range.toRepresentation := intertwiningRangeEquiv f hf
  let i : Representation.IntertwiningMap S.toRepresentation f.range.toRepresentation :=
    { toLinearMap := Submodule.inclusion hS, isIntertwining' := fun _ => rfl }
  exact e.symm.toIntertwiningMap.comp i

attribute [irreducible] intertwiningLiftSubrep

/- The genuine cyclic module is embedded in the actual staircase Specht square. -/
def staircaseToTensor (m : ℕ) :
    Representation.IntertwiningMap (staircaseCyclic m).toRepresentation
      ((spechtRep (stairTableau m)).tprod (spechtRep (stairTableau m))) :=
  @intertwiningLiftSubrep (Equiv.Perm (Fin (staircase m).card))
    (Specht (stairTableau m) ⊗[ℂ] Specht (stairTableau m))
    (WordSpace (staircase m).card ((staircase m).colLen 0 * (staircase m).colLen 0))
    _ _ _ _ _
    ((spechtRep (stairTableau m)).tprod (spechtRep (stairTableau m)))
    (wordRep (staircase m).card ((staircase m).colLen 0 * (staircase m).colLen 0))
    (staircaseTensorMap m) (staircaseTensorMap_injective m)
    (staircaseCyclic m) (staircaseCyclic_le_tensorRange m)

attribute [irreducible] staircaseToTensor

/- Every Specht type occurs in the specified staircase cyclic module. -/
def CyclicSaxlConjecture : Prop :=
  ∀ m, 1 ≤ m → ∀ (μ : YoungDiagram) (hμ : μ.card = (staircase m).card),
    ∃ f : Representation.IntertwiningMap (spechtRep (canonicalTableau μ hμ))
      (staircaseCyclic m).toRepresentation, f ≠ 0

/- A proof of cyclic support proves the original Kronecker-multiplicity target. -/
end Saxl

end

end OAI
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/RepresentationTheory/Saxl/CyclicTensor.lean

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