{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-06-openai-hilbert-sixteenth-uniform-limit-cycle-bound-claim/","md":"https://postcutoff.com/e/2026-10-06-openai-hilbert-sixteenth-uniform-limit-cycle-bound-claim/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-06-openai-hilbert-sixteenth-uniform-limit-cycle-bound-claim","date":"2026-10-06","date_precision":"day","short_title":"Hilbert's 16th problem: uniform limit-cycle bound claimed (OpenAI)","deck":null,"takeaway":"A 160-page manuscript credited to 'OpenAI' (dated 24 Sept, public on 6 Oct) claims that for every degree d there is a finite B(d) bounding the number of limit cycles of every real planar polynomial vector field of degree at most d. That is the uniform-boundedness assertion in the second part of Hilbert's sixteenth problem (1900), open for every degree above one. The bound is not effective. None of the release's Lean statements covers it: only a companion result, at most two limit cycles for quintic Liénard systems, is formalized. No dynamical-systems expert has published an assessment.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"OpenAI (PDF): Uniform bounds for planar polynomial limit cycles (24 Sept 2026)","url":"https://github.com/openai/math/blob/main/preprints/uniform-bounds-for-planar-polynomial-limit-cycles-September-24-2026/uniform-bounds-for-planar-polynomial-limit-cycles-September-24-2026.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":2,"title":"OpenAI (PDF): Two limit cycles for quintic Liénard systems (24 Sept 2026)","url":"https://github.com/openai/math/blob/main/preprints/two-limit-cycles-for-quintic-lienard-systems-September-24-2026/two-limit-cycles-for-quintic-lienard-systems-September-24-2026.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":3,"title":"OpenAI Lean scope note for family 143 (quintic Liénard only)","url":"https://github.com/openai/math/blob/main/lean/docs/143.md","type":"code","group":"primary","domain":"github.com"},{"n":4,"title":"oai-math-revised comparator results (QuinticLienard accepted)","url":"https://github.com/mathcommunity/oai-math-revised/blob/main/checks/comparator-2026-10-26/results.tsv","type":"code","group":"primary","domain":"github.com"},{"n":5,"title":"arXiv 2610.12218: Qin & Sun, Hilbert number lower bound Ω(d² log² d)","url":"https://arxiv.org/abs/2610.12218","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"Wikipedia: Hilbert's sixteenth problem","url":"https://en.wikipedia.org/wiki/Hilbert%27s_sixteenth_problem","type":"docs","group":"primary","domain":"en.wikipedia.org"},{"n":7,"title":"Carlos Toledo: OpenAI's math release, what it claims beyond what it checks (finding G1)","url":"https://carlostoledo.co/reports/openai-math.html","type":"discussion","group":"reactions","domain":"carlostoledo.co"},{"n":8,"title":"Proofs and Prompts: 100+ reactions to 100+ solutions (8 Oct)","url":"https://proofsandprompts.com/2026/10/08/100-reactions-to-100-solutions/","type":"discussion","group":"reactions","domain":"proofsandprompts.com"}],"official":6,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"],"title":"OpenAI's math release claims the uniform-boundedness part of Hilbert's sixteenth problem (the number of limit cycles of a planar polynomial vector field is bounded in terms of its degree); only a quintic Liénard companion is in Lean","summary":"Family 143 of OpenAI's 6 Oct 2026 math release, \"Uniform bounds for planar polynomial limit cycles\" (OpenAI, 24 Sept, 160 pages), claims: \"For every degree, we prove that the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on that degree. This establishes the uniform boundedness assertion in the second part of Hilbert's sixteenth problem.\" The constant B(d) is not effective. The only Lean statement in the family is a companion theorem: every classical Liénard system with polynomial F of degree at most five has at most two limit cycles, and two occur (the degree-five case of the Lins Neto–de Melo–Pugh conjecture); it was accepted in the community comparator run. Carlos Toledo's audit lists the uniform bound first among headlines \"carried by no machine-checked statement\". No expert reaction found.","key_facts":["Main manuscript: 'Uniform bounds for planar polynomial limit cycles' (OpenAI, 24 Sept 2026, 160 pages). Theorem 1.1 (verbatim): 'For each integer d ≥ 1, there is a finite nonnegative integer B(d) such that every real planar polynomial vector field of degree at most d has at most B(d) limit cycles in the whole plane.' The paper adds: 'It does not furnish an effective formula for B(d).' Method (abstract): 'separation of asymptotic expansions on nested complex domains and a finite-dimensional counting argument'","Background as the paper recounts it: Dulac claimed individual finiteness (each fixed field has finitely many limit cycles) in 1923; after a gap was found, Écalle and Ilyashenko gave proofs; uniform boundedness (a bound depending only on the degree) stayed open, with partial results such as Bautin's bound of three for quadratic weak foci, finite cyclicity of elementary polycycles (Ilyashenko–Yakovenko) and explicit bounds for zeros of Abelian integrals (Binyamini–Novikov–Yakovenko). Wikipedia: no upper bound is known for any degree n > 1","Companion manuscript: 'Two limit cycles for quintic Liénard systems' (24 Sept, 40 pages): every system ẋ = y − F(x), ẏ = −x with real polynomial F of degree at most five 'has at most two geometrically distinct isolated periodic orbits, and the bound is attained. This proves the degree-five case of the Lins Neto–de Melo–Pugh conjecture.' Lean scope note (lean/docs/143.md): challenge QuinticLienard, no sign, parity, hyperbolicity or amplitude restriction; 'accepted' in the oai-math-revised comparator run of 25–26 Oct","Carlos Toledo's audit of the release (cert-machine, finding G1, 10 Oct): 'Of the release's 416 statements, only QuinticLienard defines periodic orbits or limit cycles at all'; the uniform-bound manuscript 'is not linked by the scope note', whose title nevertheless names the uniform bounds. He lists Hilbert's sixteenth problem first among five headlines 'carried by no machine-checked statement'","Related human work: Chaoyang Qin and Xiaoming Sun's lower bound H(d) = Ω(d² log² d) (arXiv 2610.12218, 8 Oct, obtained with GPT-5.6 Sol and formalized in Lean) is complementary; they write that when their results were obtained in August 'the finiteness of the Hilbert number H(d) remained an open problem' (see 2026-10-08-hilbert-number-lower-bound-gpt-5-6-sol-lean)","Reactions: Alvaro Lozano-Robledo listed 'the second part of Hilbert’s 16th' among proposed solutions that 'would represent huge contributions to their respective fields' (Proofs and Prompts, 8 Oct). No assessment by a specialist in planar dynamics or limit cycles found (web, Hacker News, oai-math-revised notes) as of 29 Oct"],"key_numbers":[],"tags":["math","dynamical-systems","hilbert-problems","limit-cycles","ordinary-differential-equations","openai-math-release","lean","unverified"],"science":{"field":"mathematics","subfield":"dynamical systems (planar polynomial vector fields, limit cycles)","problem":"Hilbert's sixteenth problem, second part: is the number of limit cycles of a real planar polynomial vector field bounded by a function of its degree alone (finiteness of the Hilbert number H(d))?","result":"Claimed existence of a finite, non-effective bound B(d) for every degree d; companion theorem (in Lean): quintic classical Liénard systems have at most two limit cycles, and two are attained","open_since":"1900","ai_system":["OpenAI internal model (math release)"],"human_role":"Released as model output under OpenAI's fixed procedure, with no human author named; no human exposition or check yet","verification":{"key":"lean","label":"Lean-verified","text":"Main claim: unrefereed 160-page manuscript, not formalized; only the quintic Liénard companion is Lean-formalized (comparator-accepted)"},"status":"pending","shock":"A finiteness statement from Hilbert's 1900 list is claimed in a machine-written paper that no Lean statement covers and that no specialist has yet discussed in public."},"body_md":"## What happened\n\nA limit cycle is an isolated periodic orbit of a planar vector field. The second part of Hilbert's sixteenth problem asks how many\nlimit cycles a polynomial field of degree d can have. Two questions are mixed in it. Individual finiteness says each fixed field has\nfinitely many; it was proved by Écalle and by Ilyashenko after Dulac's 1923 argument turned out to have a gap. Uniform boundedness asks\nfor a bound depending only on d. It had not been proved for any degree above one.\n\nOpenAI's 6 Oct release includes a 160-page manuscript, dated 24 Sept, that claims uniform boundedness for every degree, with a bound it\ndoes not compute. A second manuscript treats a special case exactly: quintic Liénard systems have at most two limit cycles. Only that\nspecial case is formalized in Lean, and a community comparator run accepted it. An independent audit pointed out that the family's\ntitle promises the uniform bound while no Lean statement in the release even defines limit cycles for general polynomial fields.\n\n## Why it matters\n\nIf correct, the result answers the existence half of one of Hilbert's problems, though not the question of how large B(d) is. Here the\nLean label applies only to the special case, so the main claim rests on the manuscript alone. A month after the release no specialist\nhas said in public whether the argument holds. It is among the most famous claims in the release that our coverage had listed only in\npassing.","disputed":[{"label":"Verification","text":"Main claim: unrefereed 160-page manuscript, not formalized; only the quintic Liénard companion is Lean-formalized (comparator-accepted)","sources":[]}],"related":[{"id":"2026-10-24-oai-math-revised-community-hub","url":"https://postcutoff.com/e/2026-10-24-oai-math-revised-community-hub/","date":"2026-10-24","date_precision":"day","short_title":"oai-math-revised: mathematicians launch a community hub to revise OpenAI's AI-written math manuscripts (guest post on Tao's blog)","deck":null,"takeaway":"This is the first organized attempt by research mathematicians to digest and credit the OpenAI catalogue.","category":"research","category_label":"Research","importance":3,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":6,"official":5,"filed":"2026-10-25","updated":"2026-10-27","orgs":["OpenAI","mathcommunity"]},{"id":"2026-10-08-hilbert-number-lower-bound-gpt-5-6-sol-lean","url":"https://postcutoff.com/e/2026-10-08-hilbert-number-lower-bound-gpt-5-6-sol-lean/","date":"2026-10-08","date_precision":"day","short_title":"Hilbert's 16th problem","deck":"Qin & Sun prove H(d) = Ω(d² ln² d), the first log-factor gain since 1995, with GPT-5.6 Sol developing the proof and a Lean 4 certificate","takeaway":"The lower bound for the number of limit cycles of degree-d planar polynomial vector fields improves from d² ln d to d² ln² d. The authors say GPT-5.6 Sol developed the proof strategy and arguments, and the construction is formalized in Lean 4.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":3,"official":3,"filed":"2026-10-09","updated":"2026-10-13","orgs":["Chinese Academy of Sciences","OpenAI"]},{"id":"2026-10-06-openai-math-release-722-manuscripts","url":"https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems","deck":"Including quasi-Riemann, Unique Games, Hodge for CM abelian varieties and free group factors","takeaway":"If even a fraction of these results hold up, this is the largest single jump in mathematical knowledge on record, produced by an AI system in about six weeks.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":79,"official":13,"filed":"2026-10-07","updated":"2026-10-29","orgs":["OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-29","type":"filed","text":"Created (CONTENTS entry, both PDFs (160 and 40 pp), Lean scope note, comparator results, Qin–Sun entry, Proofs and Prompts reactions; web and HN searches found no specialist comment)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-29","run":null,"sources_read":null,"updated":"2026-10-29","human_review":null,"version":{"date":"2026-10-29"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":159,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":98,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":189,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":128,"in_training_data":false}],"short_url":"https://postcutoff.com/s/hilbert-16th-problem-uniform"}