OctoInform Beta

OpenAI preprint, September 2026 · §4. A quotient obtained by cutting off a band · §4

§4 (setting): the cut, the band generator and its cyclic module (4.1), (4.2): For m=h+sm = h + s: the cut, the band’s row and column groups, and a two-layer vector um,su_{m,s} whose first layer uses letters below ss

Cutting BhB_h off the staircase BmB_m and the band generator.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

For a natural number mm, the staircase BmB_m is the Young diagram with rows of lengths m,m−1,…,1m, m-1, \dots, 1. Its cells are the pairs (i,j)(i, j) of a row ii and a column jj, counted from 00, with i+j<m,i + j < m,(1)✦ and it has mm rows and Nm=m(m+1)/2N_m = m(m+1)/2 cells. For a cell x=(i,j)x = (i, j) we write row⁡x=i\operatorname{row} x = i and col⁡x=j\operatorname{col} x = j; its transpose xt=(j,i)x^t = (j, i) is again a cell of BmB_m.

Take natural numbers hh and ss and put m=h+sm = h + s. The staircase BmB_m holds BhB_h in its top-left corner, and cutting BhB_h off leaves the band F=Bm\BhF = B_m \setminus B_h, the cells with h≤i+j<mh \le i + j < m: the last ss antidiagonals of BmB_m. The band carries a vector, the band generator um,su_{m,s}, made of two layers of words on the band, a row layer and a column layer.

Tableaux and Words

A Young tableau tt of shape μ\mu on nn positions is a bijection from the positions {0,…,n−1}\{0, \dots, n-1\} to the cells of μ\mu.✦ The staircase tableau TmT_m is a tableau of shape BmB_m on NmN_m positions, fixed once and for all, and the transposed staircase tableau TmtT_m^t is the tableau of shape BmB_m on the same positions with Tmt(p)=Tm(p)tT_m^t(p) = T_m(p)^t. A word on nn positions over the letters 0,…,d−10, \dots, d - 1 is a map from {0,…,n−1}\{0, \dots, n-1\} to {0,…,d−1}\{0, \dots, d-1\}. The row word wtw_t of a tableau tt of shape μ\mu is the word on its nn positions over the letters 0,…,ℓ(μ)−10, \dots, \ell(\mu) - 1, ℓ(μ)\ell(\mu) being the number of rows of μ\mu, given by wt(p)=row⁡t(p).w_t(p) = \operatorname{row} t(p).(2)✦

For a map ff from the nn positions to a set, the fiber group of ff is the subgroup of the symmetric group SnS_n of the permutations gg with f(g(p))=f(p)f(g(p)) = f(p) for every position pp.✦ The column stabilizer CtC_t of a tableau tt on nn positions is the subgroup of SnS_n of the permutations gg with col⁡t(g(p))=col⁡t(p)\operatorname{col} t(g(p)) = \operatorname{col} t(p) for every position pp.✦

The space of words Wn,dW_{n,d} is the complex vector space of functions on the words a:{0,…,n−1}→{0,…,d−1}a\colon \{0, \dots, n-1\} \to \{0, \dots, d-1\}, the tensor power E⊗nE^{\otimes n} of E=ℂdE = \mathbb{C}^d with each tensor read as its coefficient function.✦ For a word aa, eae_a is the basis vector of Wn,dW_{n,d} of the word aa. The symmetric group SnS_n acts on it by (gx)(a)=x(a∘g),gea=ea∘g−1.(g x)(a) = x(a \circ g), \qquad g\, e_a = e_{a \circ g^{-1}}.(3)✦ For a subgroup GG of SnS_n and a word aa, the antisymmetrized word of aa over GG is the vector αG(a)=∑g∈Gsgn⁡(g)gea\alpha_G(a) = \sum_{g \in G} \operatorname{sgn}(g)\, g\, e_a(4)✦ of Wn,dW_{n,d}, with sgn⁡(g)=±1\operatorname{sgn}(g) = \pm 1 the sign of gg as a complex number. For a set AA of letters, the alphabet subspace Wn,dAW_{n,d}^A is the subspace of Wn,dW_{n,d} of the vectors xx such that x(w)=0for every word w with a letter outside A.x(w) = 0 \quad \text{for every word } w \text{ with a letter outside } A.(5)✦

A layer on nn positions over dd letters is a vector of Wn,dW_{n,d}. Two layers on the same nn positions, over dd and over ee letters, are joined into words over pair letters: a pair letter is a pair (a,a′)(a, a') of a letter a<da < d of the first layer and a letter a′<ea' < e of the second, and the dede pair letters are numbered lexicographically. A word ww over pair letters is the merged word of its first factor w(1)w^{(1)} and its second factor w(2)w^{(2)}, the words of the first and of the second components of its letters. The regrouping by position is the linear isomorphism Φ:Wn,d⊗Wn,e→Wn,de\Phi\colon W_{n,d} \otimes W_{n,e} \to W_{n,de} with Φ(x⊗y)(w)=x(w(1))y(w(2)).\Phi(x \otimes y)(w) = x\bigl(w^{(1)}\bigr)\, y\bigl(w^{(2)}\bigr).(6)✦

Rotations of the Staircase

Let hh and ss be natural numbers and m=h+sm = h + s. The row rotation ρR\rho_R of BmB_m is the permutation of its cells that turns each row i<hi < h, of m−im - i cells, cyclically by ss places and fixes the rows i≥hi \ge h✦: ρR(i,j)={(i,j+s)if i+j<h,(i,j+i−h)if i<h≤i+j,(i,j)if i≥h.\rho_R(i, j) = \begin{cases} (i, j + s) & \text{if } i + j < h,\\ (i, j + i - h) & \text{if } i < h \le i + j,\\ (i, j) & \text{if } i \ge h. \end{cases}(7)✦ The column rotation ρC\rho_C of BmB_m is the permutation ρC(x)=ρR(xt)t\rho_C(x) = \rho_R(x^t)^t of its cells, which turns each column j<hj < h cyclically by ss places.✦ The permutations ρˆR\hat\rho_R and ρˆC\hat\rho_C of the NmN_m positions are the row rotation and the column rotation of BmB_m read on the positions through TmT_m, as in (8). ρˆR=Tm−1∘ρR∘Tm,ρˆC=Tm−1∘ρC∘Tm\hat\rho_R = T_m^{-1} \circ \rho_R \circ T_m, \qquad \hat\rho_C = T_m^{-1} \circ \rho_C \circ T_m(8)

The Claim

Definition 1. Let hh and ss be natural numbers and m=h+sm = h + s. A position pp of BmB_m is high when its cell Tm(p)T_m(p) lies in BhB_h: row⁡Tm(p)+col⁡Tm(p)<h.\operatorname{row} T_m(p) + \operatorname{col} T_m(p) < h.(9)✦ The band size b=bh,sb = b_{h,s} is the number of positions of BmB_m that are not high✦, and Nh+b=Nm.N_h + b = N_m.(10)✦ The cut is a bijection κ:{0,…,Nm−1}→{0,…,Nh−1}⊔{0,…,b−1}\kappa\colon \{0, \dots, N_m - 1\} \to \{0, \dots, N_h - 1\} \sqcup \{0, \dots, b - 1\}(11)✦ that takes the high positions to the positions of BhB_h and the other positions to the band positions 0,…,b−10, \dots, b - 1; for a band position jj, κ−1(j)\kappa^{-1}(j) is the position of BmB_m that the cut sends to jj. The band tableau τ\tau is the bijection from the band positions 0,…,b−10, \dots, b - 1 to the cells of FF that sends a band position jj to the cell τ(j)\tau(j) of BmB_m given by τ(j)=Tm(κ−1(j))\tau(j) = T_m\bigl(\kappa^{-1}(j)\bigr)(12)✦ The row group RFR_F and the column group CFC_F of the band are the fiber groups of row⁡∘τ\operatorname{row} \circ \tau and of col⁡∘τ\operatorname{col} \circ \tau in the symmetric group SbS_b of the band positions: RF={g∈Sb:row⁡τ(g(j))=row⁡τ(j) for every j},R_F = \{\, g \in S_b : \operatorname{row} \tau(g(j)) = \operatorname{row} \tau(j) \text{ for every } j \,\},(13)✦ CF={g∈Sb:col⁡τ(g(j))=col⁡τ(j) for every j}.C_F = \{\, g \in S_b : \operatorname{col} \tau(g(j)) = \operatorname{col} \tau(j) \text{ for every } j \,\}.(14)✦ The row layer and the column layer are the antisymmetrized words of Wb,mW_{b,m} vRF=αRF(aR),aR(j)=wTmt(ρˆR(κ−1(j))),v_{R_F} = \alpha_{R_F}(a_R), \qquad a_R(j) = w_{T_m^t}\bigl(\hat\rho_R(\kappa^{-1}(j))\bigr),(15)✦ vCF=αCF(aC),aC(j)=wTm(ρˆC(κ−1(j))),v_{C_F} = \alpha_{C_F}(a_C), \qquad a_C(j) = w_{T_m}\bigl(\hat\rho_C(\kappa^{-1}(j))\bigr),(16)✦ and the band generator is the vector um,s=Φ(vRF⊗vCF)u_{m,s} = \Phi(v_{R_F} \otimes v_{C_F})(17)✦ of Wb,m2W_{b,m^2}. It lies in the alphabet subspace of the pair letters whose first component is below ss: um,s∈Wb,m2As,As={(a,a′):a<s}.u_{m,s} \in W_{b,m^2}^{A_s}, \qquad A_s = \{(a, a') : a < s\}.(18)✦

In the paper, the result reads: for s∈{1,2}s \in \{1, 2\} and h=m−s≥1h = m - s \ge 1, with D=BhD = B_h, F=Bm\DF = B_m \setminus D, SDS_D and SFS_F the symmetric groups of DD and FF, H=SD×SFH = S_D \times S_F and RFR_F and CFC_F the row and column intersections with FF, the band generator is um,s=vRF⊗vCFu_{m,s} = v_{R_F} \otimes v_{C_F} in two layers over the alphabet 1,…,s1, \dots, s, and Um,s=ℂ[SF]um,sU_{m,s} = \mathbb{C}[S_F]\, u_{m,s}, where FF is the band and the letters 1,…,s1, \dots, s are the page’s 0,…,s−10, \dots, s - 1.

What Is Checked

The definition is stated over the staircases BmB_m and BhB_h, the staircase tableau TmT_m and its transpose TmtT_m^t, row words and fiber groups, the spaces of words with the permutation action and their antisymmetrized words, the row and column rotations of BmB_m, the regrouping Φ\Phi over pair letters and the alphabet subspaces.

The library shows that p↦Th−1(Tm(p))p \mapsto T_h^{-1}(T_m(p)), with ThT_h the staircase tableau of BhB_h, is a bijection from the high positions of BmB_m onto the positions of BhB_h.✦ The permutation ρˆR\hat\rho_R lies in the column stabilizer CTmtC_{T_m^t} and ρˆC\hat\rho_C in the column stabilizer CTmC_{T_m}. Each alphabet subspace Wn,dAW_{n,d}^A is stable under the action of SnS_n, a subrepresentation of Wn,dW_{n,d}.