The tensor square conjecture for symmetric groups: some irreducible representation of S_n has a tensor square containing every irreducible
For partitions of let be the Kronecker coefficients of . Heide, Saxl, Tiep and Zalesski showed that for most finite simple groups of Lie type the Steinberg character has a tensor square containing every irreducible character. For symmetric groups, Pak, Panova and Vallejo formulated the tensor square conjecture (Conjecture 1.1): for every other than and there is with for all ; it fails for . Saxl's conjecture would give it at triangular ; elsewhere only partial and asymptotic results were known (Luo and Sellke found irreducibles whose fourth tensor power contains everything). Does every with have an irreducible representation whose tensor square contains every irreducible representation?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Representation theory of symmetric groups; Kronecker coefficients
- Posed by
- Igor Pak, Greta Panova and Ernesto Vallejo
- Year posed
- 2013
- Years open
- 13y
- Solved
- 2026-09-24
- Model
- Unreleased internal OpenAI model
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Collection
- OpenAI math release (October 2026), version adc7f12
- Significance
- 28 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Theorem 1.1: for every positive integer there is , necessarily self-conjugate, with for every . Corollary 1.2 transfers this through Letellier's results to unipotent characters of for every prime power . The construction combines the cyclic Saxl theorem with band, balance and capacity arguments, and a finite verification for small degrees. Not shown: an explicit closed-form family of such at nontriangular degrees beyond the construction, or bounds on the coefficients.
What the AI did
The release README says the results were produced by an unreleased internal OpenAI model with a fixed procedure, on average about three hours of ChatGPT Pro thinking compute per result, and that some outputs build on earlier model results. This result is not among the README's exceptions (the Hodge conjecture for CM abelian varieties, and the Re(s) > 11/12 zero-free region whose write-up was human-edited). The manuscripts are authored 'OpenAI' and name no human author. The principal manuscript is 'Universal Tensor Squares for Symmetric Groups' (September 24, 2026). It uses the cyclic form of Saxl's conjecture from the companion manuscript and a finite computer verification (C++ and Python) for small degrees, shipped in the release.
Verification
No independent mathematician has checked this yet. Checked here: Theorem 1.1 of 'Universal Tensor Squares for Symmetric Groups' was read against Pak-Panova-Vallejo's Conjecture 1.1; it is the conjecture, including nontriangular degrees. Lean: lean/ComparatorChallenges/UniversalTensorSquares.json exists with solution module OAI.RepresentationTheory.UniversalSquare.Main present at the pinned commit; it is not in the formalization catalogue (formalization.yaml). The statement read here asserts, for every with , a Young diagram of size with positive Kronecker multiplicity against every , irreducibility of its Specht representation, and an injective intertwiner from every finite-dimensional irreducible complex representation of into its tensor square. That states the headline. Not rebuilt here, and the release's finite character computations were not run.
Sources
- PaperCompanion manuscript: A Cyclic Polytabloid Proof of Saxl's Conjecture
- Lean proofLean proof: OAI/RepresentationTheory/UniversalSquare/Main.leanLean statement: ComparatorChallenges/UniversalTensorSquares.lean
- CodeOpenAI math release: Universal Tensor Squares for Symmetric Groups
- Problem recordPak, Panova and Vallejo, Kronecker products, characters, partitions, and the tensor square conjectures