OctoInform Beta

OpenAI preprint, September 2026 · §2. Specht modules and horizontal strips · §2

§2 (displayed): conjugation reverses dominance (2.1): Alongside two corner relations between the cell counts of a Young diagram’s first kk columns and first rr rows

Conjugation reverses dominance on diagrams of equal size.

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

Young diagrams of a fixed size carry the dominance order, and conjugation, the reflection of a diagram in its main diagonal, exchanges its rows and columns. The question is how conjugation moves the order: among diagrams with four cells, (3,1)(3,1) dominates (2,2)(2,2), and their conjugates are (2,1,1)(2,1,1) and (2,2)(2,2); which of the two conjugates dominates the other?

With the answer, the library states two relations, the corner inequality and the corner equality, between the number of cells of a diagram in its first kk columns and the number in its first rr rows.

Prefix Sums and Dominance

A Young diagram μ\mu has row lengths μ1≥μ2≥⋯\mu_1 \ge \mu_2 \ge \cdots, with μi=0\mu_i = 0 past its last row, and size |μ||\mu|, its number of cells. For a Young diagram μ\mu and a natural number kk, the row prefix sum Σk(μ)\Sigma_k(\mu) of μ\mu is the number of cells of μ\mu in its first kk rows: Σk(μ)=μ1+μ2+⋯+μk,\Sigma_k(\mu) = \mu_1 + \mu_2 + \cdots + \mu_k,(1)✦ with Σ0(μ)=0\Sigma_0(\mu) = 0. The column lengths μ1t≥μ2t≥⋯\mu^t_1 \ge \mu^t_2 \ge \cdots of μ\mu are the row lengths of its conjugate μt\mu^t, so Σk(μt)\Sigma_k(\mu^t) is the number of cells of μ\mu in its first kk columns.

For Young diagrams μ\mu and ν\nu of any sizes, μ\mu dominates ν\nu, written μ⊵ν\mu \trianglerighteq \nu, when each row prefix sum of ν\nu is at most the corresponding row prefix sum of μ\mu: Σk(ν)≤Σk(μ)for every k≥0.\Sigma_k(\nu) \le \Sigma_k(\mu) \quad \text{for every } k \ge 0.(2)✦

The Claim

Theorem 1. Let μ\mu and ν\nu be Young diagrams. If μ\mu and ν\nu have the same size and μ⊵ν\mu \trianglerighteq \nu, then νt⊵μt.\nu^t \trianglerighteq \mu^t.(3)✦ For all natural numbers kk and rr, the corner inequality holds: Σk(μt)+Σr(μ)≤|μ|+rk.\Sigma_k(\mu^t) + \Sigma_r(\mu) \le |\mu| + rk.(4)✦ For every natural number kk, with c=μk+1tc = \mu^t_{k+1} the length of the (k+1)(k+1)-st column of μ\mu, the corner equality holds: Σk(μt)+Σc(μ)=|μ|+ck.\Sigma_k(\mu^t) + \Sigma_c(\mu) = |\mu| + ck.(5)✦

In the paper, the result reads: for partitions μ\mu and ν\nu of the same size, μ⊵ν\mu \trianglerighteq \nu if and only if νt⊵μt\nu^t \trianglerighteq \mu^t.

What Is Checked

The claim is stated over Young diagrams and their conjugates, with the row prefix sums (1) and the dominance order (2), equal size being a hypothesis of (3).