{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-09-14-friedgut-coalition-conjecture-resolved/","md":"https://postcutoff.com/e/2026-09-14-friedgut-coalition-conjecture-resolved/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-09-14-friedgut-coalition-conjecture-resolved","date":"2026-09-14","date_precision":"day","short_title":"Friedgut's 2004 influential-coalitions conjecture resolved","deck":"Friedgut then has GPT-6 Astra simplify the proof","takeaway":"It is the first sublinear bound independent of alphabet size for collective coin flipping.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"arXiv 2609.16401: A Resolution of Friedgut's Conjecture on Influential Coalitions (Chattopadhyay, Gurumukhani)","url":"https://arxiv.org/abs/2609.16401","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2610.03086: Small Influential Coalitions in [0,1]^n via the Junta Theorem (Friedgut)","url":"https://arxiv.org/abs/2610.03086","type":"paper","group":"primary","domain":"arxiv.org"}],"official":2,"filed":"2026-10-05","updated":"2026-10-05","orgs":["Cornell University","Weizmann Institute of Science","OpenAI"],"title":"Friedgut's 2004 influential-coalitions conjecture resolved (Chattopadhyay–Gurumukhani, ChatGPT Pro used extensively); Friedgut then has GPT-6 Astra simplify the proof","summary":"On Sept 14, 2026 Eshan Chattopadhyay and Mohit Gurumukhani (Cornell) posted a proof (arXiv 2609.16401) of Ehud Friedgut's 2004 conjecture: every monotone Boolean function on the continuous cube [0,1]^n has a coalition of O(n/√log n) coordinates that can force a fixed output with probability 1 − ε. It is the first sublinear bound independent of alphabet size for collective coin flipping. Their AI-use statement says they \"used ChatGPT Pro extensively for exploring ideas, and proving several technical parts\". On Oct 2 Friedgut posted a note (arXiv 2610.03086) with a simpler proof that he says ChatGPT-6 Astra wrote after two short prompts from him. He credits the breakthrough to Chattopadhyay and Gurumukhani.","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'"],"key_numbers":[],"tags":["math","theoretical-computer-science","boolean-functions","influence","collective-coin-flipping","chatgpt","gpt-6-astra"],"science":{"field":"computer-science","subfield":"analysis of Boolean functions / collective coin flipping","problem":"Friedgut's conjecture on small influential coalitions for monotone functions on [0,1]^n (CPC 2004)","result":"Coalitions of O(n/√log n) coordinates suffice to force either output with probability 1−ε (C–G); an AI-written simplification gives O(n/(ε log n)) via the junta theorem (Friedgut)","open_since":"2004","ai_system":["ChatGPT Pro","GPT-6 Astra"],"human_role":"AI-assisted, human-led original proof (ChatGPT Pro used extensively for ideas and technical parts); the simplified proof was written by GPT-6 Astra from two prompts by the conjecture's author","verification":{"key":"expert","label":"Expert-checked","text":"Preprints; expert-checked by the conjecture's author (Friedgut); not formalized or refereed"},"status":"confirmed","shock":"The conjecture's own author says an AI produced a cleaner proof within minutes of being pointed at the right tool."},"body_md":"## What happened\n\nFriedgut 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.\n\n## Why it matters\n\nIt follows the Chvátal pattern from the same weeks (2026-09-16-chvatal-conjecture-proved): 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.","disputed":[],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-09-16-chvatal-conjecture-proved","url":"https://postcutoff.com/e/2026-09-16-chvatal-conjecture-proved/","date":"2026-09-16","date_precision":"day","short_title":"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","deck":null,"takeaway":"It is a clear example of the late-2026 pattern in mathematics.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":6,"official":5,"filed":"2026-10-01","updated":"2026-11-21","orgs":["Institute for Basic Science","OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-05","type":"filed","text":"Created"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-05","run":null,"sources_read":null,"updated":"2026-10-05","human_review":null,"version":{"date":"2026-10-06"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":106,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":76,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":167,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":106,"in_training_data":false}],"short_url":null}