Staircase Minimality and a Proof of Saxl's Conjecture

Soong Kyum Lee

arxiv: 2512.15035 · v2 · submitted 2025-12-17 · 🧮 math.RT · math.CO

Staircase Minimality and a Proof of Saxl's Conjecture

Soong Kyum Lee This is my paper

Pith reviewed 2026-05-16 22:08 UTC · model grok-4.3

classification 🧮 math.RT math.CO MSC 20C30

keywords Saxl conjecturestaircase partitionKronecker coefficientssymmetric grouptensor square2-regular partitionsdominance order

0 comments

The pith

The staircase partition is the unique dominance-minimal 2-regular partition of triangular numbers, proving Saxl's conjecture that its tensor square contains every irreducible representation of the symmetric group.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes Saxl's conjecture by proving that the staircase partition is the unique minimal element in the dominance partial order among all 2-regular partitions of the triangular number T_k. This minimality combines with an existing positivity theorem for staircases to guarantee that the tensor square of the staircase representation includes every 2-regular partition as a summand. From there, standard facts about decomposition matrices and a lifting theorem extend the result to all irreducible representations of the symmetric group on T_k points. A further characterization shows that no other self-conjugate partition achieves this universality at these sizes.

Core claim

Saxl's conjecture asserts that for the staircase partition ρ_k = (k, k-1, …, 1), the tensor square of the corresponding irreducible representation of the symmetric group S_{T_k} contains every irreducible representation as a constituent. The Staircase Minimality Theorem establishes that among all 2-regular partitions of T_k, the staircase ρ_k is the unique dominance-minimal element. Combined with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases, this establishes that every 2-regular partition appears in the tensor square. Modular saturation then follows using only the diagonal entries d_μμ = 1 of the decomposition matrix, and the Bessenrodt-Bowman-Sutton lifting proof

What carries the argument

The Staircase Minimality Theorem, which establishes that the staircase ρ_k is the unique dominance-minimal 2-regular partition of T_k and thereby transfers Kronecker positivity from the staircase to all other 2-regular partitions.

If this is right

Every 2-regular partition appears in the tensor square of the staircase representation.
All irreducible representations of S_{T_k} appear in the tensor square of the staircase representation.
Staircase partitions are the only self-conjugate partitions whose tensor squares contain every irreducible at triangular numbers.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Similar dominance-minimality arguments could resolve related open questions on which partitions have universal tensor squares.
The result supplies a structural reason for universality that may guide explicit computations of Kronecker coefficients for small triangular numbers.
The characterization of unique self-conjugate universals suggests looking for analogous minimal elements in other partial orders on partitions.

Load-bearing premise

That dominance-minimality of the staircase transfers Kronecker positivity to every other 2-regular partition via Ikenmeyer's theorem together with decomposition-matrix diagonals and the lifting theorem.

What would settle it

A 2-regular partition μ of some T_k for which the Kronecker coefficient of ρ_k ⊗ ρ_k against μ is zero would disprove the transfer from minimality to full positivity.

read the original abstract

Saxl's conjecture (2012) asserts that for the staircase partition $\rho_k = (k, k-1, \ldots, 1)$, the tensor square of the corresponding irreducible representation of the symmetric group $S_{T_k}$ contains every irreducible representation as a constituent, where $T_k = k(k+1)/2$ is the $k$th triangular number. We prove this conjecture unconditionally. Our proof introduces the Staircase Minimality Theorem: among all 2-regular partitions of $T_k$, the staircase $\rho_k$ is the unique dominance-minimal element. Combined with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases, this establishes that every 2-regular partition appears in the tensor square. Modular saturation then follows using only the diagonal entries $d_{\mu\mu} = 1$ of the decomposition matrix, and the Bessenrodt--Bowman--Sutton lifting theorem completes the proof. We further prove that at triangular numbers, staircases are the only Kronecker-universal self-conjugate partitions, providing a complete characterization.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims a full proof of Saxl's conjecture via a new dominance-minimality result for staircases, but the key step is uncheckable from the abstract alone.

read the letter

The headline result is an unconditional proof of Saxl's 2012 conjecture: the tensor square of the staircase representation of S_{T_k} contains every irreducible. They introduce the Staircase Minimality Theorem, which asserts that among 2-regular partitions of T_k the staircase is the unique dominance-minimal one. This is combined with Ikenmeyer's positivity theorem for staircases, the fact that decomposition-matrix diagonals are 1, and the Bessenrodt-Bowman-Sutton lifting theorem to reach all partitions. They also give a clean characterization: at triangular numbers, only staircases are Kronecker-universal among self-conjugate partitions. That second result looks like a solid byproduct. The argument is logically organized and avoids brute-force checks, which is an improvement over earlier partial results. The main limitation is that only the abstract is available. The minimality theorem is the load-bearing new piece; if another 2-regular partition is smaller or incomparable under dominance for some k, the reduction to Ikenmeyer's result fails and the rest of the chain does not go through. The external citations appear standard, but without the proof text it is impossible to see whether the dominance comparison is proved correctly or whether any hidden assumptions about the decomposition matrix are used. This is squarely for people working on Kronecker coefficients and symmetric-group representations. A reader who already knows Ikenmeyer's dominance criterion and the lifting theorems will follow the outline immediately and can judge the new theorem once the full text is read. The paper is coherent on its own terms and addresses a genuine open question, so it should go to referees rather than be desk-rejected. The referees will need to verify the minimality statement in detail; if that holds, the rest is mostly assembly of known tools.

Referee Report

2 major / 1 minor

Summary. The manuscript claims to prove Saxl's conjecture unconditionally: the tensor square of the irreducible representation of S_{T_k} corresponding to the staircase partition ρ_k contains every irreducible representation of S_{T_k} as a constituent. The argument introduces the Staircase Minimality Theorem (ρ_k is the unique dominance-minimal 2-regular partition of the triangular number T_k), combines it with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases to obtain positivity for all 2-regular partitions, applies modular saturation using the diagonal entries d_{μμ}=1 of the decomposition matrix, and invokes the Bessenrodt-Bowman-Sutton lifting theorem to reach all partitions. It further claims that staircases are the only Kronecker-universal self-conjugate partitions at triangular numbers.

Significance. If the central claims hold, the work resolves a 2012 conjecture on Kronecker coefficients for symmetric groups, a long-standing question in representation theory. The Staircase Minimality Theorem supplies a new structural fact about dominance order among 2-regular partitions that may be useful beyond this application, and the characterization of Kronecker-universal self-conjugate partitions adds a complete classification result at triangular numbers.

major comments (2)

[Abstract] Abstract: the Staircase Minimality Theorem is the load-bearing novel step; without its proof it cannot be verified that ρ_k is strictly dominance-minimal among all 2-regular partitions of T_k (or that no other 2-regular partition is incomparable), which is required to extend Ikenmeyer's positivity result to every 2-regular constituent via dominance.
[Abstract] Abstract: the transition from 'every 2-regular partition appears in ρ_k ⊗ ρ_k' to the full conjecture via modular saturation (using only d_{μμ}=1) and the Bessenrodt-Bowman-Sutton lifting theorem requires explicit confirmation that the lifting preserves the necessary positivity properties for non-2-regular partitions; the abstract states the chain but does not indicate where the details appear.

minor comments (1)

[Abstract] Abstract: the notation T_k = k(k+1)/2 is standard but would benefit from an explicit reminder in the first sentence for readers outside the immediate area.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments. We address each major comment below, clarifying the structure of the proof as presented in the manuscript.

read point-by-point responses

Referee: [Abstract] Abstract: the Staircase Minimality Theorem is the load-bearing novel step; without its proof it cannot be verified that ρ_k is strictly dominance-minimal among all 2-regular partitions of T_k (or that no other 2-regular partition is incomparable), which is required to extend Ikenmeyer's positivity result to every 2-regular constituent via dominance.

Authors: The Staircase Minimality Theorem is proven in full in the body of the manuscript. The argument establishes that ρ_k is the unique dominance-minimal 2-regular partition of T_k by showing it is strictly dominated by every other 2-regular partition of T_k and that no other 2-regular partition is incomparable to it under dominance order. This fact is then combined with Ikenmeyer's theorem to obtain Kronecker positivity for all 2-regular partitions. We will revise the abstract to include an explicit reference to the section containing this proof. revision: yes
Referee: [Abstract] Abstract: the transition from 'every 2-regular partition appears in ρ_k ⊗ ρ_k' to the full conjecture via modular saturation (using only d_{μμ}=1) and the Bessenrodt-Bowman-Sutton lifting theorem requires explicit confirmation that the lifting preserves the necessary positivity properties for non-2-regular partitions; the abstract states the chain but does not indicate where the details appear.

Authors: The modular saturation step uses the property that the diagonal entries satisfy d_{μμ}=1 for every partition μ. This ensures that the multiplicities in the tensor square for 2-regular partitions lift directly to the decomposition matrix without introducing additional zeros. The Bessenrodt-Bowman-Sutton lifting theorem is applied in a manner that preserves the required positivity for the remaining (non-2-regular) partitions, with the full details and verification given in the main text. We agree the abstract should indicate the location of these arguments and will update it in the revised version. revision: yes

Circularity Check

0 steps flagged

No circularity; new Staircase Minimality Theorem supplies independent content combined with external results.

full rationale

The derivation introduces the Staircase Minimality Theorem (unique dominance-minimal 2-regular partition is the staircase) as a novel statement, then combines it with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases (external author), the diagonal entries of the decomposition matrix, and the Bessenrodt-Bowman-Sutton lifting theorem. No self-citations appear, no parameters are fitted and relabeled as predictions, no uniqueness is imported from the author's prior work, and no ansatz or renaming reduces the central claim to its inputs by construction. The proof chain is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

No free parameters or invented entities are introduced. The argument rests on standard combinatorial axioms and three previously established theorems.

axioms (3)

standard math The dominance partial order on integer partitions is a well-defined partial order
Invoked to define and prove uniqueness of the minimal element in the Staircase Minimality Theorem
domain assumption Ikenmeyer's theorem relating dominance minimality to Kronecker positivity holds for staircases
Cited as the bridge from minimality to positivity in the tensor square
domain assumption The decomposition matrix of the symmetric group has diagonal entries d_μμ = 1
Used to obtain modular saturation before applying the lifting theorem

pith-pipeline@v0.9.0 · 5460 in / 1561 out tokens · 50005 ms · 2026-05-16T22:08:39.907418+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Staircase Minimality Theorem: among all 2-regular partitions of T_k, the staircase ρ_k is the unique dominance-minimal element. Combined with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat recovery theorems unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Modular saturation then follows using only the diagonal entries d_μμ = 1 of the decomposition matrix

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.