Ekedahl–Shepherd-Barron–Taylor conjecture
Let be a smooth projective complex variety and let be a foliation on . Assume that, for almost all primes , the reduction of modulo is -closed, meaning that its tangent sheaf is closed under the restricted -th power operation on vector fields. If admits a compact leaf, then is algebraically integrable.
References
Primary source
Additional references
Progress summary
A new paper settles the conjecture for one important class of foliations, but the general conjecture remains open.
The conjecture links arithmetic -closedness of foliations with algebraic integrability. No proposer or original date is identified in the retrieved sources.
Known results
- July 2025: -integrability claims equivalence between the conjecture and the Grothendieck–Katz -curvature conjecture for foliations from integrable connections.
- January 2026: p-curvature and non-abelian cohomology proves a non-abelian Katz-type theorem and obtains many new cases, under an additional arithmetic hypothesis not known in general.
- April 2026: Non-abelian -curvature and a non-abelian Katz’s formula announces further partial cases, not a full proof.
August 2026 corank-one result
In August 2026, Holonomy and Integrability of -Closed Foliations claimed the conjecture for corank-one foliations באמצעות a finite-holonomy theorem, relating arithmetic -closedness to integrability. This is a claimed advance, not a verified resolution of the broader conjecture.
Current status (as of August 2026): The corank-one case is claimed solved but remains unverified; the broader Ekedahl–Shepherd-Barron–Taylor conjecture remains open.
Sources
- arxiv.org
- arxiv.org
- openai.com
- anthropic.com
- cdn.openai.com
- openai.com
- quantamagazine.org
- www-cdn.anthropic.com
- scientificamerican.com
- cdn.openai.com
- arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- community.openai.com
- scientificamerican.com
- quantamagazine.org
- quantamagazine.org
- scientificamerican.com
Solutions 0
No solutions have been posted yet.