Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Content orbits of words, orbit projections and the letter-sum map on word spaces

Definition
OAI_RepresentationTheory_Saxl_RepeatedProjection

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

oai-mathrepresentation-theorysymmetric-group

Fix n,d∈Nn,d\in\mathbb{N}n,d∈N, write [d]={0,…,d−1}[d]=\{0,\dots,d-1\}[d]={0,…,d−1}, and let Wn,dW_{n,d}Wn,d​ be the space of functions xxx on words c:[n]→[d]c:[n]\to[d]c:[n]→[d], with basis vectors ece_cec​ and with the symmetric group SnS_nSn​ acting by permuting positions, (g⋅x)(c)=x(c∘g)(g\cdot x)(c)=x(c\circ g)(g⋅x)(c)=x(c∘g). This is the nnn-fold tensor power of Cd\mathbb{C}^dCd written in coordinates.

  1. Content orbit. For words t,c:[n]→[d]t,c:[n]\to[d]t,c:[n]→[d], ccc lies in the orbit of ttt if c=t∘gc=t\circ gc=t∘g for some g∈Sng\in S_ng∈Sn​, i.e. ccc is a rearrangement of ttt (every letter occurs equally often in both). The relation is invariant under rearranging ccc: c∘gc\circ gc∘g lies in the orbit of ttt if and only if ccc does.
  2. Orbit projection. For a word ttt, the coordinate projection Pt:Wn,d→Wn,dP_t:W_{n,d}\to W_{n,d}Pt​:Wn,d​→Wn,d​,
(Ptx)(c)={x(c)if c is a rearrangement of t,0otherwise,(P_tx)(c)=\begin{cases}x(c)&\text{if }c\text{ is a rearrangement of }t,\\ 0&\text{otherwise,}\end{cases}(Pt​x)(c)={x(c)0​if c is a rearrangement of t,otherwise,​

keeps exactly the coordinates on the SnS_nSn​-orbit of ttt. Since that orbit is SnS_nSn​-stable, PtP_tPt​ is an intertwiner of SnS_nSn​-representations; its image is the permutation module spanned by the ece_cec​ with ccc a rearrangement of ttt. 3. Letter-sum map. Read a word over the alphabet [d]×[d][d]\times[d][d]×[d] (encoded as [d2][d^2][d2]) as a pair of words (a,b)(a,b)(a,b). For e∈Ne\in\mathbb{N}e∈N the map Σ:Wn,d2→Wn,e\Sigma:W_{n,d^2}\to W_{n,e}Σ:Wn,d2​→Wn,e​ is the nnn-th tensor power of the letter map e(α,β)↦eα+βe_{(\alpha,\beta)}\mapsto e_{\alpha+\beta}e(α,β)​↦eα+β​ (and e(α,β)↦0e_{(\alpha,\beta)}\mapsto0e(α,β)​↦0 when α+β≥e\alpha+\beta\ge eα+β≥e):

(Σx)(c)=∑(a,b)x(a,b)∏p∈[n]1[a(p)+b(p)=c(p)].(\Sigma x)(c)=\sum_{(a,b)}x(a,b)\prod_{p\in[n]}\mathbf{1}\bigl[a(p)+b(p)=c(p)\bigr].(Σx)(c)=(a,b)∑​x(a,b)p∈[n]∏​1[a(p)+b(p)=c(p)].

On basis vectors, Σe(a,b)=ea+b\Sigma e_{(a,b)}=e_{a+b}Σe(a,b)​=ea+b​ if a(p)+b(p)<ea(p)+b(p)<ea(p)+b(p)<e for every position ppp, and Σe(a,b)=0\Sigma e_{(a,b)}=0Σe(a,b)​=0 otherwise. It is an intertwiner because it acts letter by letter.

Composing the letter-sum map with an orbit projection extracts, from a vector of the tensor square Wn,d⊗Wn,d≅Wn,d2W_{n,d}\otimes W_{n,d}\cong W_{n,d^2}Wn,d​⊗Wn,d​≅Wn,d2​, its component on words of one prescribed content. This is how a specific permutation-module generator is detected inside the tensor square of a staircase Specht module.

Formalization Note The relation is wordOrbit t c, with invariance lemma wordOrbit_perm; orbitProjection t is coordinateProjection (wordOrbit t) packaged as an intertwiner, and pairSumMap n d e is wordMap applied to the letter kernel L((α,β),γ)=1[α+β=γ]L((\alpha,\beta),\gamma)=\mathbf{1}[\alpha+\beta=\gamma]L((α,β),γ)=1[α+β=γ], with pairs encoded by finProdFinEquiv.

Definition code
-- Generated from openai/math@1581d4c lean/OAI/RepresentationTheory/Saxl/RepeatedProjection.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
import Definitions.Def_OAI_RepresentationTheory_Saxl_CyclicTensor

-- Lean 4.33.1 equivalents of the upstream Lean 4.34 theorem names.
namespace OAI

noncomputable section

open scoped TensorProduct

universe uX

namespace Saxl

/- The strict square-moment equality used in the dominance projection.
The labels may be real; the application uses actual nonnegative integer letters. -/
end Saxl

namespace Saxl
/- Coordinate projection; equivariance is asserted only for preserved predicates. -/

def wordOrbit {n d : ℕ} (t : Fin n → Fin d) (c : Fin n → Fin d) : Prop :=
  ∃ g : Equiv.Perm (Fin n), c = t ∘ g

lemma wordOrbit_perm {n d : ℕ} (t c : Fin n → Fin d) (g : Equiv.Perm (Fin n)) :
    wordOrbit t (c ∘ g) ↔ wordOrbit t c := by
  constructor
  · rintro ⟨h, hh⟩
    refine ⟨h*g⁻¹, ?_⟩
    funext i
    have he := congrFun hh (g⁻¹ i)
    simpa using he
  · rintro ⟨h, rfl⟩
    exact ⟨h*g, rfl⟩

def orbitProjection {n d : ℕ} (t : Fin n → Fin d) :
    Representation.IntertwiningMap (wordRep n d) (wordRep n d) where
  toLinearMap := coordinateProjection (wordOrbit t)
  isIntertwining' g := by
    classical
    apply LinearMap.ext
    intro x
    ext c
    change (if wordOrbit t c then x (c ∘ g) else 0) =
      (if wordOrbit t (c ∘ g) then x (c ∘ g) else 0)
    rw [wordOrbit_perm]

def pairSumMap (n d e : ℕ) :
    Representation.IntertwiningMap (wordRep n (d*d)) (wordRep n e) :=
  wordMap (fun a c => if (finProdFinEquiv.symm a).1.val +
    (finProdFinEquiv.symm a).2.val = c.val then 1 else 0)

end Saxl

end

end OAI
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/RepresentationTheory/Saxl/RepeatedProjection.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