What was already known
Earlier examples produced large dimensions. Earlier affine Kazhdan–Lusztig constructions showed unbounded extension dimensions between simple modules, where the source module need not be trivial.
AI involvement
The authors proposed putting their earlier web diagrams on an annulus and supplied an initial picture. They credit GPT Astra 6.0 with finding the working family and calculation. They used that argument as a blueprint for the paper.
- Annular webs and Guralnick’s conjectureAI attribution and proof provenance
Importance
The family disproves a longstanding uniform bound in finite-group representation theory. The same annular graph works at every rank in the family by changing its edge thicknesses.
Technical verification
The authors report Lean checks of the annular family, the web calculation, the row sum and the deduction of the cohomology bound from named hypotheses. The formal deduction assumes results from representation theory, including the link from the coefficients to first cohomology.
Formal checking
The authors report Lean checks of the annular family, the web calculation, the row sum and the deduction of the cohomology bound from named hypotheses. The formal deduction assumes results from representation theory, including the link from the coefficients to first cohomology.
- Checker
- Goertzen, Lacabanne, Tubbenhauer and Vaz, reporting the Lean development
- Scope
- For every integer and all sufficiently large primes depending on , the authors construct a faithful absolutely irreducible module for the finite simple group over whose first cohomology has dimension at least .
- Basis
- Reported by the linked checker
- Lean development and explicit hypothesesChecked statements and verification scope
Human understanding
The authors explain how a single annular diagram produces a row of coefficients whose sum grows quadratically in the parameter. At least one coefficient then grows linearly, and the authors relate it to first cohomology in sufficiently large characteristic.
Correction and publication history
New curated result with documented central AI work and a scoped checking assessment.
Read this published revision