{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-27-morgan-mullen-conjecture-claude-lean/","md":"https://postcutoff.com/e/2026-10-27-morgan-mullen-conjecture-claude-lean/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-10-27-morgan-mullen-conjecture-claude-lean","date":"2026-10-27","date_precision":"day","short_title":"Morgan–Mullen conjecture confirmed with Claude, Lean-checked","deck":null,"takeaway":"Florian Hellwig (University of Zurich) posted a proof on 27 Oct 2026 that every F_{q^n} contains a primitive element that is completely normal over F_q, the 1996 Morgan–Mullen conjecture. The paper also proves Hachenberger's conjectured lower bound for the number of completely normal elements. The paper says the arguments and the text were generated by Claude Fable 5.1 and Claude Opus 5.5 under the author's direction, and the Lean formalization was 'generated entirely by AI'. The author checked the final proof by hand and checked the formal statements.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.36534: Resolvent components of completely normal elements and the Morgan–Mullen conjecture (Hellwig)","url":"https://arxiv.org/abs/2610.36534","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-28","updated":"2026-10-28","orgs":["University of Zurich","Anthropic"],"title":"Morgan–Mullen conjecture (1996) confirmed: every finite field extension has a primitive completely normal element; arguments generated by Claude Fable 5.1 and Opus 5.5, case n > q formalized in Lean (Hellwig)","summary":"arXiv 2610.36534 (math.NT): via partial Lagrange resolvents, complete normality splits into independent components of weight at most 3/4, giving an explicit character-sum criterion. It is verified for all n > q except 70 pairs (q, n), which are settled by explicit elements found by computer. With Garefalakis–Kapetanakis (n ≤ q) this confirms Morgan–Mullen. Also: Hachenberger's lower bound for all (q, n), and asymptotic independence of primitivity and complete normality. The case n > q and both corollaries, including every computer step, are formalized in Lean 4/Mathlib, with the case n ≤ q and a Rosser–Schoenfeld bound taken as axioms.","key_facts":["Result (abstract): 'this confirms the conjecture of Morgan and Mullen (1996) that every F_{q^n} contains a primitive element that is completely normal over F_q'; Hachenberger's conjectured bound (q−1)^{n'} q^{(p^a−1)n'} 'holds for all pairs (q, n); it was known for regular pairs'","AI statement (verbatim): 'the arguments were generated by AI language models (Claude Fable 5.1 and Claude Opus 5.5, Anthropic) under the author's direction … The text of this paper was drafted by the same AI models under the author's direction and heavily revised by the author. The author has checked every step of the final proof by hand … The Lean 4 formalisation was generated entirely by AI.' The author directed the hard pair (2, 4599), 'which the first approaches could not settle'","Lean scope: theorem `morgan_mullen` (HasMMProperty F E) for n > q and Corollaries 8.8–8.9; axioms: the case n ≤ q (Garefalakis–Kapetanakis) and an explicit Rosser–Schoenfeld bound; relies on Lean's compiler and interpreter (`Lean.reduceBool`) for 25 large computations; the author checked the formal statements and ran the audit files but 'has not reviewed the rest of the formalisation'","Python programs written by AI, run but not line-by-line reviewed by the author; AI models reproduced all computations with separately written code"],"key_numbers":[],"tags":["math","number-theory","finite-fields","normal-bases","lean","claude","claude-fable-5-1","claude-opus-5-5","arxiv"],"science":{"field":"mathematics","subfield":"number theory (finite fields, normal bases)","problem":"Morgan–Mullen conjecture (1996): existence of a primitive completely normal element in every finite field extension; Hachenberger's lower bound","result":"Claimed full confirmation of Morgan–Mullen (case n > q new, n ≤ q by Garefalakis–Kapetanakis) and of Hachenberger's bound for all (q, n)","open_since":"1996","ai_system":["Claude Fable 5.1","Claude Opus 5.5"],"human_role":"AI-generated arguments, text, code and Lean under the author's direction; the author checked the proof by hand and the formal statements","verification":{"key":"lean","label":"Lean-verified","text":"Unrefereed arXiv preprint; Lean 4 formalization of the new case (with two cited results as axioms and compiler-trusted computation)"},"status":"pending","shock":""},"body_md":"## What happened\n\nA normal element of a finite field extension is one whose conjugates form a basis. A completely normal element is normal over\nevery intermediate field. Morgan and Mullen conjectured in 1996 that one can always pick such an element that also generates the\nmultiplicative group. The case n ≤ q was settled earlier. Hellwig's paper handles the remaining case n > q with a new\ndecomposition, a character-sum criterion, and a computer search for 70 exceptional pairs.\n\nThe paper's AI statement credits the arguments, the drafts, the code and the full Lean formalization to Claude Fable 5.1 and\nClaude Opus 5.5, all directed by the author. The author says he checked every step of the final proof himself.\n\n## Why it matters\n\nThe conjecture is a well-known 30-year-old problem in finite-field theory. This is one of the clearest statements so far of a\npaper whose mathematics was generated by Claude, with the new part machine-checked in Lean. The formal proof still trusts two\ncited theorems as axioms and Lean's compiler for the large computations.","disputed":[{"label":"Verification","text":"Unrefereed arXiv preprint; Lean 4 formalization of the new case (with two cited results as axioms and compiler-trusted computation)","sources":[]}],"related":[{"id":"2026-10-28-ai-assisted-results-october-28-listing","url":"https://postcutoff.com/e/2026-10-28-ai-assisted-results-october-28-listing/","date":"2026-10-28","date_precision":"day","short_title":"AI-assisted results in the 28 Oct 2026 sweep","deck":"Bialostocki–Lotspeich (1992), part of Gross–Prasad in geometric Langlands, Fuglede in 𝔽₂⁸, a TEMPO structure found by Claude, agent swarms on fractional Chern insulators, and a human digest of GPT-6 Astra's Smale counterexample","takeaway":"The 28 Oct sweep covered the arXiv announcement of 26–27 Oct submissions and late papers from 23–26 Oct. Five results have their own entries: Axiom's Lean proof of the Classification of Finite Simple Groups, OpenAI's spin-one Haldane gap proof (found through Hal Tasaki's follow-up), OpenAI's De Giorgi dimension-eight claim, Morgan–Mullen with Claude and Lean, and formula minimization with GPT-Sol-6.1. This page lists the rest. Claude, GPT-6 Astra and GPT-6 Pro supplied ideas, counterexamples or whole arguments in papers on zero-sum sequences, geometric Langlands, quantum dynamics, fire-blocking and spectral bounds.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":21,"official":19,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-28","type":"filed","text":"Created (science agent; arXiv abstract and PDF read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-28","run":null,"sources_read":"Science agent; arXiv abstract and PDF read","updated":"2026-10-28","human_review":null,"version":{"date":"2026-10-28"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":180,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":119,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":210,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":149,"in_training_data":false}],"short_url":null}