Friedgut’s 2004 influential-coalitions conjecture resolved
Friedgut then has GPT-6 Astra simplify the proof
Result confirmed
The takeaway
It is the first sublinear bound independent of alphabet size for collective coin flipping.
Status
- Claim
Result confirmed
- Our reporting
- High confidence
- Verification
- Expert-checked
- Importance
- 3 of 5
- Last verified
- 5 October 2026
Your AI and this story
- GPT-6.2 Astra106 days after its cutoff
- Claude Opus 5.576 days after its cutoff
- Gemini 4 Hydrogen167 days after its cutoff
- Grok 4.7106 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 76 days before it.
Key facts
- arXiv 2609.16401 (cs.CC, Sept 14, 2026), ‘A Resolution of Friedgut’s Conjecture on Influential Coalitions’, 15 pages; key tools: an encoding relating influence on product spaces to p-biased influence, and Hatami’s pseudo-junta theorem (Annals 2012)
- Previously only the Boolean-cube case was known (Kahn–Kalai–Linial 1988, O(n/log n)); no sublinear alphabet-independent bound existed
- C–G AI use statement: ‘The authors used ChatGPT Pro extensively for exploring ideas, and proving several technical parts. The authors take full responsibility for the correctness of all results in the paper.’
- arXiv 2610.03086 (Oct 2; revised Sept 30), Friedgut, ‘Small Influential Coalitions in [0,1]^n via the Junta Theorem’: gets O(n/(ε log n)) using Friedgut’s junta theorem instead of Hatami’s, plus a direct discretization from [0,1]^n to {0,1}^n
- Friedgut’s account: he fed the C–G manuscript to ChatGPT-6 Astra with the prompt ‘see whether it can be simplified by using Friedgut’s junta theorem instead of Hatami’s pseudo-junta theorem’; ‘After a few minutes the bot supplied me with a simpler proof’; a second prompt produced the discretization shortcut. The proof section is ChatGPT’s output, ‘lightly edited’
- Friedgut: ‘my mathematical contribution… was limited to my two suggestions to the bot… I did not apply any creativity to the project’; he had earlier failed to solve the conjecture with a weaker ChatGPT model; he calls the AI’s perturbed-measure argument ‘really a beautiful idea’
What happened
Friedgut had carried the conjecture for over two decades and had tried it with AI before, without success. Chattopadhyay and Gurumukhani settled it in a 15-page paper that leaned heavily on ChatGPT Pro. After reading their proof, Friedgut suspected Hatami’s deep pseudo-junta theorem was more than the problem needed. He asked GPT-6 Astra to swap in his own weaker junta theorem, then to reuse the discretization from his 2004 paper. The result is a shorter proof that passes through a family of perturbed product measures, which he likens to Dinur–Safra’s “Importance of Being Biased”. He posted it at the Cornell authors’ suggestion.
Why it matters
It follows the Chvátal pattern from the same weeks (Chvátal’s 1972 conjecture proved (Chang–Liu–Liu, ChatGPT-assisted), then a GPT-6 Astra ‘proof from The Book’ and a Codex-built Lean formalization): a human-led proof with heavy model use is followed within days by an AI-written simplification, here prompted by the conjecture’s author himself.
Sources
2 sources from 1 site. Numbers match the chips in the text.
2 sources: 2 primary
Primary
Changes
- Filed