Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help (July–September catalogue)
Between July and September 2026 arXiv saw a steady stream of papers that resolve a named conjecture or open question and disclose that a frontier model (mostly GPT-5.6 Sol/Pro and GPT-6 Astra, also Claude Fable 5/5.1, Opus 5/5.5, Gemini) found the key idea, the counterexample or the whole proof. This entry catalogues about 50 of them, with the AI role as the authors state it. Most are preprints without peer review. The most important ones have their own entries.
Key facts
- Scale: the 'Gold Rush in AI4Math' survey counted 1,712 arXiv math papers with substantive AI contributions from 1 Mar to 20 Aug 2026 (14% of submissions by August). The VibeMathed tracker listed 748 AI-involved problems (511 marked resolved, 158 Lean-verified) when checked on 30 Sep 2026
- Typical disclosure pattern: GPT-5.6 Sol/Pro dominates July–August; GPT-6 Astra dominates September after its early-September release; Anthropic models appear mostly as Claude Code agents, for Lean formalisation or for review
- Fully AI-generated, per the authors: Talagrand's Conjecture 9.1 (Park & Talagrand, 'generated entirely by the AI model GPT-6 Astra'); the dominating Hadwiger conjecture disproof (found by ChatGPT 6 Astra Ultra); the Partial List Colouring Conjecture disproof ('discovered and fully verified by ChatGPT 6 Astra Ultra'); Daykin–Frankl ('LLM-generated proof'); Yau's scalar-curvature integral bound refuted ('ChatGPT generated the main theorems and their proofs'); optimal shallow circuits for Majority ('originally found by GPT-6 Astra')
- Key idea from AI, human completion: the stable forking conjecture (Hart–Kim–Pillay 1996) refuted with GPT-5.6 Sol; a smooth random fast dynamo on T³ ('central proof idea was generated autonomously by ChatGPT 5.6 Sol Ultra'); Kahn–Saks conjecture on linear extensions (ChatGPT 6 Astra 'used primarily to aid in the discovery'); Talagrand's operator cotype problem ('discovered by ChatGPT (GPT-5.6)'); Khachiyan's ellipsoid conjecture ('An AI language model discovered the proof'; Lean-checked)
- Counterexamples found by chatbots on the first or second prompt: Schubitopes are not Ehrhart positive (GPT-5.6 Sol Pro, first prompt, 38 min); claw-free graphs' chromatic symmetric functions are not Schur positive (ChatGPT-5.6 Sol Pro); a very ample polytope with non-unimodal h*-vector (ChatGPT 5.6 Sol); the Hinrichs–Vybíral conjecture ('found in a single prompt' with ChatGPT 6)
- Agent systems: Kazhdan–Lusztig polynomials of matroids need not be unimodal (Rethlas agent on GPT-5.6 Sol, 4 h 59 min, where the GPT-5.6 Sol Ultra web interface failed); Ehrhart volume conjecture equality case (GPT-5.6 Sol, Fable 5 and Danus); the Fröberg conjecture for quintics and septics in four variables (GPT-5.6 Sol, Claude Fable 5 and Grok 4.6)
- Contrasting disclosures: Reed & Stein's dense-case Erdős–Sós proof was found 'without any use of AI'; Kielak et al. solved the uniform Turán tetrahedron problem with no AI-derived arguments, while a competing author completed an alternative proof with ChatGPT-6; Cairo's Ehlers–Kundt counterexample states 'All ideas in this paper are of human origin'
- Priority and credibility problems: the inhomogeneous Duffin–Schaeffer counterexample (GPT-5.6 Sol) had been announced by Pollington a year earlier; Kumar & Volk 'were unable to follow the details and verify' Sheshadri's AI-assisted determinantal-complexity proof and gave their own short quadratic lower bound; the 'Liouville Goldbach' proof was misreported as a Goldbach breakthrough
Science result
- Field
- mathematics / multiple (combinatorics, analysis, algebra, logic, TCS, mathematical physics)
- Problem
- Dozens of named conjectures and open questions (see list in body)
- Result
- About 50 claimed resolutions from July to September 2026 in which authors disclose a substantive AI contribution.
- AI system
- GPT-5.6 Sol, GPT-5.6 Pro, GPT-6 Astra, Claude Fable 5, Claude Fable 5.1, Claude Opus 5, Claude Opus 5.5, Gemini 3.1 Pro, Aristotle
- Human role
- Varies from fully AI-generated proofs to human-led work with AI checking; see each item
- Verification
- Mostly unrefereed preprints; some Lean-verified; AI role self-reported by authors
- Status
- pending
What happened
This catalogue comes from a systematic pass over arXiv. It combined API queries for math, physics and theoretical-CS papers from 1 Jul to 30 Sep 2026 that mention a model name, "conjecture" or "open problem", with the AI-disclosure section of the project sweep and the public trackers. For each paper below, the PDF's AI statement was read. Quotes are from the papers, and nothing here was independently checked unless noted.
Combinatorics and discrete geometry
- Kahn–Saks conjecture (balance in posets) proved. Aires, arXiv 2609.30895. ChatGPT 6 Astra "used primarily to aid in the discovery".
- Talagrand's Conjecture 9.1. Park & Talagrand, arXiv 2609.33644. "The proofs presented in this document were generated entirely by the AI model GPT-6 Astra, and none of the authors claim any credit for them."
- Dominating Hadwiger conjecture disproved. Illingworth & Steiner, arXiv 2609.35361. Found by ChatGPT 6 Astra Ultra; the humans wrote the exposition.
- Partial List Colouring Conjecture (Albertson–Grossman–Haas) false. Noel, arXiv 2609.23291. Counterexample "discovered and fully verified by ChatGPT 6 Astra Ultra after some persistent prompting".
- Daykin–Frankl conjecture confirmed. Williams, arXiv 2609.03087. "We verify and communicate an LLM-generated proof" (ChatGPT 5.6 Sol Pro).
- Teschner's bondage-number conjecture counterexample. Yavari, arXiv 2609.04257. Generated by GPT-5.6 Sol Max.
- Anstee–Sali conjecture counterexample. Wu, arXiv 2608.07646. GPT-5.6 Sol helped identify the example.
- Chromatic symmetric functions of claw-free graphs are not Schur positive. Matherne & Morales, arXiv 2607.21508. Found with ChatGPT-5.6 Sol Pro; independently found by Prajapati.
- Schubitopes are not Ehrhart positive. Li & St. Dizier, arXiv 2608.00377. GPT-5.6 Sol Pro, first prompt, 38 minutes; verified in SageMath.
- Very ample lattice polytope with non-unimodal h*-vector. Hofscheier, Kurylenko & Nill, arXiv 2608.21507. Found with ChatGPT 5.6 Sol; answers a question of Ferroni–Higashitani.
- Equality case of Ehrhart's volume conjecture. J. Liu, arXiv 2608.01040. Complements OpenAI's inequality proof; "obtained by generative AI" (GPT-5.6 Sol, Fable 5, Danus).
- Kazhdan–Lusztig polynomials of matroids need not be unimodal. Cheng et al., arXiv 2607.24186. The Rethlas agent on GPT-5.6 Sol found it in 4 h 59 min.
- Laplacian S_{n,n} conjecture. Johnston, arXiv 2609.26895. "Significant amount of help" from ChatGPT 5.5, 5.6 Sol and 6 Astra.
- Comon's conjecture, 27×27×27 counterexample. Lovitz, arXiv 2609.28292. GPT-6 Astra gave "an initial proof of the main result".
- Kaplansky's conjecture (semifields) counterexamples. Nagy & Zhou, arXiv 2609.32651. Developed with ChatGPT 6 Pro; formalised by Harmonic's Aristotle in Lean 4.
- Generalized packing–covering conjecture. Alfarano, Marino, Neri & Trombetti, arXiv 2609.34910. ChatGPT 6 Astra turned the authors' strategy into a complete argument.
- Conway's subprime closure grows by the golden ratio (conjecture of Caragiu–Vicol–Zaki). Popescu, arXiv 2609.14188. GPT-6 Astra assisted; Lean-verified.
- Kalai's conjecture for tight trees and Erdős–Sós for digraphs: see the Erdős–Sós entry.
- Strongly aperiodic monotile in 3D ("Chair44"). Tsiokos, arXiv 2609.19214. Found by "an OpenAI reasoning model (ChatGPT, Astra)"; the text was largely written by Claude Fable 5.1 and reviewed by agents. Follow-ups: arXiv 2609.24779 (notes) and arXiv 2609.23783 (matching rules).
Analysis, PDE and geometry
- Landis conjecture fails in dimensions ≥ 3 (real potentials). Frank & Ivanisvili, arXiv 2608.00802. "The authors acknowledge the use of AI tools"; no detail.
- Pólya's conjecture for higher-dimensional Neumann balls. Filonov, Levitin, Polterovich & Sher, arXiv 2607.29305. ChatGPT and Claude "contributed to the development of several technical lemmas" and the rigorous computer-assisted algorithm.
- Yau's conjectured scalar-curvature integral bound refuted. Hao & Zhu, arXiv 2609.06533. "ChatGPT generated the main theorems and their proofs" (GPT-5.6 Pro).
- AI-discovered smooth random fast dynamo on T³. Rowan, arXiv 2608.20105. Central idea "generated essentially autonomously by ChatGPT 5.6 Sol Ultra"; the original AI manuscript is in the arXiv source.
- Nevanlinna's century-old half-plane problem counterexample. He & Zhang, arXiv 2608.24829. "AI-assisted exploration" (model not named).
- Fuchs's conjecture counterexample. Eremenko & Zhang, arXiv 2609.28443. ChatGPT as an "exploratory tool" and for editing.
- Forsythe's conjecture for restarted conjugate gradients. Colbrook, Stepaniants & Townsend, arXiv 2609.04659. Framed as an experiment in "how far a frontier language model could be pushed" (GPT-5.6, GPT-6).
- Rockafellar's sum conjecture fails. Boţ, arXiv 2609.13906. GPT-6 Astra assisted with the development.
- Hinrichs–Vybíral conjecture counterexample. Vybíral, arXiv 2609.21733. Found by a colleague "in a single prompt try" with ChatGPT 6.
- Talagrand's operator cotype problem. Wu, arXiv 2609.19731. "The counterexample was discovered by ChatGPT (GPT-5.6)."
- Khachiyan's ellipsoid conjecture. Zhou, Zou & Liu, arXiv 2609.28447. "An AI language model discovered the proof"; main theorem Lean-verified.
- Smooth Hamiltonian diffeomorphism with two fixed points on S²×S². Jiao, arXiv 2609.33626. "GPT suggested a key idea … most of the computation is done by GPT."
- Explicit mono-monostatic polyhedron (a certified polyhedral Gömböc). Schettini Gherardini, arXiv 2609.07827. A Claude Opus 4.8 / Fable 5 agent designed and ran the experiments; exact certificates.
- Lukic conjecture counterexample. Yan, arXiv 2607.26419. "This example was generated by GPT-5.6."
- Feige's conjecture. Nie & Wei, arXiv 2607.24528. Proof "obtained with the assistance of GPT-5.6 Sol".
Algebra, number theory, topology and logic
- Stable forking conjecture (Hart–Kim–Pillay 1996) refuted. Freitag & Mutchnik, arXiv 2609.00436. "This is an AI-generated result proven with the help of GPT-5.6 Sol."
- Huneke–Wiegand conjecture counterexample. Pham, arXiv 2609.07615. AI-assisted search with GPT-5.6 Pro; Craig Huneke independently recomputed the data.
- Sato's weak F-equivalence conjecture counterexamples. Chakravarty, Choi & Xu, arXiv 2608.18054. GPT-5.6 Sol "produced the key construction".
- Qin's quasimodularity conjecture for Hilbert schemes of points. Alekseev et al., arXiv 2609.33884. "Most of the formal arguments … were initially generated by GPT-5.6 Sol."
- Fröberg's conjecture for quintics and septics in four variables. Wang & Zhang, arXiv 2608.24797. GPT-5.6 Sol, Claude Fable 5 and Grok 4.6 workflow.
- Mod 4 Kawauchi conjecture. Conant, arXiv 2607.18655. Claude Fable 5 "proposed the quotient-tower strategy" and drafted the first version.
- HZ/4 is not an E2-Thom spectrum (the remaining case). Ji, arXiv 2609.19446. GPT-5.6 Sol and GPT-6 Astra; reviewed with Claude Fable 5.1.
- Yang's conjecture (tempered xi function) disproved. Kazin & Kadyrov, arXiv 2609.29898. GPT-6 Astra identified the key sine-transform formulation.
- Inhomogeneous Duffin–Schaeffer conjecture counterexamples. He & Liao, arXiv 2609.30870. Found with GPT-5.6 Sol; the authors later learned that Pollington had announced a counterexample more than a year earlier.
- Fraenkel's conjecture (Beatty sequences). Tan & Zhang, arXiv 2609.01570. GPT-5.6 Sol resolved the cases m = 8–11, which inspired the proof strategy; Codex helped with the finite-case verification code.
- Separable Jacobian conjecture in characteristic two, dimension-2 counterexample. Mondello, arXiv 2608.02634. Lean-checked; ChatGPT/Codex used for organisation; Aristotle replay.
- Colombo's determinant problem. arXiv 2609.00101. The WuJie agent, DeepSeek, Qwen, Kimi and GPT played "a substantial role in identifying the proof strategy"; Lean 4.
- De Bruijn–Erdős consecutive-gap problem. Korsky, arXiv 2609.07196. GPT Astra used "for completing the mathematical argument".
Theoretical CS, information theory, quantum
- Optimal shallow circuits for Majority. Lecomte & Ramakrishnan, arXiv 2609.34029. Constructions "originally found by GPT-6 Astra"; the authors rebuilt the proofs from high-level ideas.
- Quadratic lower bound on determinantal complexity. Kumar & Volk, arXiv 2609.34462. Came out of using ChatGPT Astra to parse Sheshadri's AI-assisted proof, whose details they were 'unable to follow' and verify.
- Strong secretary conjecture for linear matroids. Bérczi, Dughmi, Livanos & Soto, arXiv 2609.20797. Astra "identified the supermodularity … and proposed the uncrossing argument" on 15 Sep; concurrent-discovery note.
- Nelson–Nguyen conjecture. Mai & Rao, arXiv 2609.22548. ChatGPT-5.6 Pro "used in proving and writing".
- Markovity conjecture for two-receiver broadcast channels refuted. Liu & Huang, arXiv 2608.13170. GPT-5.6 Sol; Chandra Nair suggested the AI search and checked the result.
- Shor's orthogonal-measurement conjecture. arXiv 2609.27992. Codex and GPT-5.6 Sol for exploration and error checking only.
- Distributional variants of the Aaronson–Ambainis conjecture. arXiv 2609.35327. "Google Gemini suggested the core idea underlying the inner-gadget construction."
Outside arXiv (claims with weaker provenance)
- Conway's refinement conjecture for omnific integers (1976): Dan Abramov's "I vibed a proof of Conway's conjecture" (18 Sep; Claude, ChatGPT/Sol and Codex agents; Lean proof passing Palomar checks; not reviewed by mathematicians). overreacted.io
- Theo-Conjecture (FirstPrinciples) on a 35-year-old question about common-divisor graphs (arXiv 2608.04040; "not yet completed peer review").
- Star Fleet Math: 20 parallel Codex/GPT "starships" claiming 13 Lean-verified Erdős-problem solutions (July 2026). starfleetmath.com
Why it matters
By September 2026, "settled with AI help" had stopped being news in itself: several named conjectures a week, across most of mathematics, with disclosures ranging from "fully generated by the model" to "used for proofreading". For a model with an older cutoff, the practical lesson is to check the current status of any conjecture before calling it open. Many that were open in early 2026 have claimed resolutions, but most are still unrefereed.
Changelog
- 2026-09-30: created from a systematic arXiv/tracker backfill (AI disclosures read in each PDF)
Related events
- 'The Gold Rush in AI4Math': substantive AI use in arXiv math papers rises from 1.4% to 14% in five months ★★★
- Planar Schiffer and Pompeiu conjectures disproved by two independent groups; one proof has a Lean certificate written by GPT-5.6 ★★★★
- Convex counterexamples to Schiffer and Pompeiu in dimensions 3, 4, 6, 8, 10 and 14, made with Claude Opus 5.5 and GPT-6 Astra/Sol ★★★
- Pre-release GPT-6 Astra disproves Erdős's 'first serious problem' (1931, $500) and proves the rational-exponents conjecture, all Lean-verified, in Epoch's FrontierMath Erdős runs ★★★★★
- GPT-6 Astra proves the Erdős–Sós conjecture (1962) with a short counting argument; mathematicians race to simplify and extend it ★★★★★
- Mathematician posts an unchecked ChatGPT Astra proof of the planar Mumford–Shah conjecture (1989), citing OpenAI's '100 open problems' claim ★★★★
- Peking University preprint claims an AI-found disproof of the Yau–Tian–Donaldson conjecture for constant scalar curvature metrics ★★★★
- Pierce–Birkhoff conjecture (1956) disproved by a multi-agent GPT + Claude harness; counterexamples Lean-verified ★★★★
- Banach's isometric conjecture (1932) completed in the real case with key steps from ChatGPT 5.5/5.6 Pro; complex and quaternionic cases follow five days later ★★★★
- Matrix Spencer conjecture proved; authors credit GPT-5.6 Sol Pro with 'the heavy-lifting' for the key lemma ★★★★
- The k-server conjecture, the 'holy grail' of online algorithms, is proved at Oxford; ChatGPT 6 Astra generalised the authors' k = 3 proof to all k ★★★★
- Odlyzko–Poonen conjecture (1993) proved unconditionally: 'The proofs are due to GPT-6 Astra', which also wrote a 22,000-line Lean formalisation ★★★★
- Alexander Perry disproves the period-index conjecture (Colliot-Thélène, 2001); a flawed ChatGPT example was the starting point ★★★★
- Medvedev's logic of finite problems (1962) shown undecidable; key idea from ChatGPT Sol 5.6, central argument checked in Lean by Claude Opus 5 ★★★
- Maxwell's conjecture on equilibria of point charges is false: five charges with at least 24 critical points, construction idea from GPT-5.6 Sol ★★★
- The I3322 Bell inequality needs infinite dimensions: Pál–Vértesi conjecture (2010) proved from an approximate proof by GPT-5.5 Pro ★★★
- Lean-verified 'Liouville Goldbach' theorem goes viral as a GPT-6 Astra 'Goldbach breakthrough'; the AI role is unconfirmed and it is not the Goldbach conjecture ★★
- OpenAI says an internal model resolved 100+ long-standing open problems in 24 days of training; no list released ★★★
- Neurosurgery resident uses GPT-5.6 Sol to prove Crouzeix's conjecture in a 16-hour autonomous run ★★★★
- OpenAI's unreleased 'Astra' model claims ten advances in maths and theoretical CS, with Lean proofs ★★★★★
- Claude proves more than two-thirds of Riemann zeta zeros are simple and on the critical line (up from 41.6%) ★★★★★
- Claude-assisted construction claims a complex structure on the 6-sphere, answering Hopf's 1947 problem (pending verification) ★★★★★
Sources (5)
- paperarXiv 2608.24961: The Gold Rush in AI4Math: Where Are We Now?
- discussionVibeMathed: tracker of AI-involved math problems
- discussionWikipedia: List of mathematical discoveries by artificial intelligence
- discussionKingy AI: Mathematics & Science Breakthrough Tracker
- discussionGitHub: ai4math-chronicle (provenance tracker)
id: 2026-09-30-ai-assisted-conjecture-wave-summer-2026 · updated 2026-09-30 · open in the interactive timeline