Finite symmetric tensor categories and the Verlinde tower
Every finite symmetric tensor category in characteristic p is claimed to map into one higher Verlinde category.
A symmetric tensor category is an abstract setting with objects that combine and can swap order. Benson, Etingof and Ostrik built a tower of model categories, the higher Verlinde categories. They conjectured every reasonable category maps faithfully into this tower. This paper claims to prove it for every finite such category, in every characteristic p > 0. The level of the tower used may depend on the category.
The explanation
Work with arithmetic mod 5, where 5 counts as 0. Take the 3-by-3 matrix with 1s on the diagonal and 1s just above it. Raised to the fifth power it gives the identity, so it describes an action of a five-element cycle. Such a matrix is called a Jordan block of length 3. Now combine two copies into one 9-by-9 matrix, the tensor product. Computing its block structure mod 5 gives blocks of lengths 1, 3 and 5.
The block of length 5 is special. In a precise sense it is negligible, and one can throw it away. Keeping only blocks of lengths 1 to 4 gives a small world in which 3 times 3 is 1 plus 3. In the same world, 4 times 4 leaves only 1, since the rest is three blocks of length 5. This world is the first Verlinde category for the prime 5Source 1Source 2. For the prime 2 it is ordinary vector spaces, and for 3 it is supervector spacesSource 3.
A symmetric tensor category is an abstract setting with objects, a way to combine them, and a rule for swapping the order. Representations of a group are the basic example. A fiber functor is a faithful translation from one such setting into another that keeps all this structureSource 4. Over the complex numbers, Deligne showed in 2002 that supervector spaces are a common target for every reasonable category of this kindSource 5. In positive characteristic p, that fails. Ostrik proved that the semisimple ones, called fusion categories, translate into the first Verlinde categorySource 6. Benson, Etingof and Ostrik then built a tower of higher Verlinde categories, one level for each power of pSource 2. They conjectured that every reasonable symmetric tensor category translates into this towerSource 7.
This paper claims to prove that conjecture for every finite symmetric tensor categorySource 8. That includes characteristic twoSource 8. The level of the tower may depend on the categorySource 9. Finite here means finitely many basic objects, finite-dimensional spaces of maps, and enough projective objectsSource 10. The paper makes no claim about larger categories that are not finiteSource 9.
The single obstacle is that the natural translation tool can fail. It is called the Frobenius functor, and it need not be exact, meaning it can break short sequences of objectsSource 11. Higher versions of it, built by Coulembier and Flake, become usable once a specific conjecture about tilting modules holdsSource 12. The paper claims to prove that conjecture in fullSource 13. It then picks a version of the higher functor that is exact for the given category. A counting argument with dimensions finishes the descent into one level of the tower.
The result also classifies the finite categories that cannot be compressed furtherSource 14. These are the ones where every structure-preserving translation out of them is faithful on maps.
How sure is this? There is no Lean formalization for this result in the openai/math release, so no computer has checked the proof. The argument builds on a large body of recent work on Verlinde categories and Frobenius functors. No specialist review of the paper has been published.
What it doesn't show. This does not cover symmetric tensor categories that are not finite, which the full conjecture also includes.
Where it came from
This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026.
Hype check
Major if it holds. There is no Lean check, it rests on recent heavy machinery, and no specialist review is published.
Words used
- Jordan block
- A square matrix with one repeated value on the diagonal and 1s just above it.
- Symmetric tensor category
- An abstract setting of objects and maps with a way to combine objects and swap their order.
- Fiber functor
- A faithful, exact translation between two such settings that keeps combining and swapping intact.
- Verlinde category
- A model category built from Jordan blocks after throwing away negligible pieces; higher levels form a tower.
- Characteristic p
- Arithmetic where adding 1 to itself p times gives 0.
- Exact functor
- A translation that sends short exact sequences of objects to short exact sequences.
- Frobenius functor
- A tool that raises structure to the p-th power; it can fail to be exact.
The original paper
All quoted lines (14)
-
Its simple objects are represented by Jordan blocks of lengths .
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
The higher Verlinde categories of Benson–Etingof–Ostrik form a tower of finite symmetric tensor categories.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
Thus is the category of vector spaces and is the category of supervector spaces with its sign symmetry.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
A fiber functor between such categories is a -linear exact faithful strong symmetric monoidal functor.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
In characteristic zero, Deligne's theorem makes supervector spaces a common target for fiber functors from symmetric tensor categories of moderate growth.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
In positive characteristic, Ostrik proved that symmetric fusion categories admit fiber functors to .
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
The full conjecture concerns symmetric tensor categories of moderate growth: for each object, the lengths of its tensor powers grow at most exponentially.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
This proves the finite case of the Benson–Etingof–Ostrik conjecture, including characteristic two.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
The theorem places the image in a single finite level, whose height may depend on ; it makes no assertion about arbitrary nonfinite categories of moderate growth.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
A \emphfinite symmetric tensor category over is an essentially small -linear abelian rigid symmetric monoidal category with biexact tensor product, finite-dimensional morphism spaces, finite-length objects, finitely many isomorphism classes of simple objects, enough projectives, and .
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
The higher levels are needed because the ordinary Frobenius functor need not be exact.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
Their construction becomes symmetric monoidal once a specific restricted-tilting conjecture is established.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
Our independent representation-theoretic contribution is the full restricted-tilting conjecture, proved in Theorem ….
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text -
Theorem … and the higher Verlinde subcategory classification of Benson–Etingof–Ostrik classify these finite categories, giving the finite case of Coulembier–Etingof–Ostrik's Conjecture B.
Fiber functors for finite symmetric tensor categories in positive characteristic Back to text
Other sources
- openai/math release notes (2026): model provenance and review status
manuscripts and supporting proof artifacts produced by an internal OpenAI model
Related results
- 207The ℓ¹-Bass conjecture for all discrete groupsAlgebra
- 209Integral counterexamples to Gersten’s conjectureAlgebra
- 206Finite lattice representation and undecidabilityAlgebra
- 210Foulkes' conjecture for sixth powers and quadratic stabilizationAlgebra
- 205Saxl’s conjecture and universal tensor squaresAlgebra