Kostant’s conjecture

For every complex simple Lie algebra g\mathfrak{g}, with ρ\rho the half-sum of its positive roots, and every dominant integral weight λP+\lambda\in P_+, the irreducible representation V(λ)V(\lambda) occurs in V(ρ)V(ρ)V(\rho)\otimes V(\rho) if and only if λ2ρ\lambda\leq 2\rho, where λ2ρ\lambda\leq 2\rho means that 2ρλ=i=1raiαi2\rho-\lambda=\sum_{i=1}^r a_i\alpha_i for some aiZ0a_i\in\mathbb{Z}_{\geq 0} and simple roots α1,,αr\alpha_1,\ldots,\alpha_r.

Progress summary

Partially solved

The conjecture remains open in general, despite proofs in special cases and extensive finite checks.

Kostant’s conjecture asks whether V(λ)V(\lambda) occurs in V(ρ)V(ρ)V(\rho)\otimes V(\rho) exactly when the dominant weight satisfies λ2ρ\lambda\leq 2\rho. It is known in type AA and in several restricted forms, but no general proof or counterexample was found.

Known results

  • Berenstein–Zelevinsky proved the conjecture for sln+1\mathfrak{sl}_{n+1}.
  • Chirivì–Kumar–Maffei (2016) proved the statement after applying a saturation factor; the factor is 11 in type AA.
  • A 2023 paper proved the conjecture for vertices of the relevant polytope, and recorded affirmative computations for types G2G_2 and F4F_4.
  • New component families and criteria provide further supporting evidence, not a complete proof.

May–August 2026 developments

A May 2026 computation verified the conjecture for all simple Dynkin types up to rank 77, but this is only a finite check. A journal paper by Arzu Boysal appeared online in August 2026 and addresses the conjecture; its Crossref record has no abstract, so the retrieved evidence does not establish what it proves. No sourced claim of a general proof or counterexample was found.

Current status (as of August 2026): Kostant’s conjecture is proved in type AA and under saturation, with additional special cases and rank-77 computations, but remains unresolved in general.

Sources
Sources & referencesView supporting material

Additional references

Solutions 0

No solutions have been posted yet.