--- id: "2026-10-14-penrose-conjecture-bray-khuri-claude-openai-provenance" url: "https://postcutoff.com/e/2026-10-14-penrose-conjecture-bray-khuri-claude-openai-provenance/" as_of: "2026-10-15T10:09:00+02:00" date: "2026-10-14" date_precision: day category: science importance: 4 confidence: high status: [Event confirmed, Awaiting review] verification: Preprint only sources: 3 editor: human editor human_review: null version: "2026-10-15" --- As of: 2026-10-15 10:09 CEST. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-10-14-penrose-conjecture-bray-khuri-claude-openai-provenance/ # Bray, Dolmen, Khuri & Schmidt prove the spacetime Penrose inequality for 'maximally parameterized' data with Claude's help, and say OpenAI's Oct 6 Penrose paper appears to finish their program On 14 Oct 2026 Hubert Bray, Tuan Dolmen, Marcus Khuri and David Schmidt posted arXiv 2610.20559. It proves the spacetime Penrose inequality in all dimensions n ≥ 3 for initial data sets of a 'maximally parameterized' form, using a new family of generalized Schoen–Yau identities. Their AI statement says Claude helped derive and check the identities and "made some useful mathematical suggestions" that would have earned a human co-authorship. It also says OpenAI's 6 Oct manuscript claiming the full Penrose conjecture appears to complete their own program. They do not know whether their privately circulated notes reached OpenAI's training data, and they ask labs to publish training-data provenance. ## Key facts - Paper: 'Proof of the Penrose Conjecture for Maximally Parameterized Initial Data Sets' (arXiv 2610.20559, math.DG, 14 Oct 2026; 38+ pages) - Result: the spacetime Penrose inequality, ADM mass ≥ ½(A/ω_{n−1})^{(n−2)/(n−1)}, for asymptotically flat data under the dominant energy condition in every dimension n ≥ 3, when the second fundamental form k has the 'maximally parameterized' form (4.7), plus a nondegeneracy condition at the horizon. That form has n(n+1)/2 local functions, the same formal freedom as an arbitrary symmetric 2-tensor; Kerr (Boyer–Lindquist) data are an example - Method: a new 1-parameter family of generalized Schoen–Yau identities gives a comparison metric ḡ = g + β⊗β with scalar curvature ≥ 0, which reduces the problem to the Riemannian Penrose inequality (Bi–Zhu, all dimensions). The full conjecture would follow if a certain degenerate PDE system (3.18) could be solved in general - Abstract: 'Essentially, we believe this is what the OpenAI paper [27] posted last week on October 6, 2026 claims to have done.' Reference [27] is OpenAI, 'The spacetime Penrose inequality and enclosing area' (family 260 of the openai/math release, dated 27 Sep 2026) - AI statement (verbatim): 'By mid-February, we began using Claude to help with the algebra (which is quite messy) leading to the new Schoen–Yau identity for general t. We used Claude to verify every identity numerically as well as algebraically … Claude also made some useful mathematical suggestions … Had a human researcher made similar mathematical suggestions, we would have invited them to be a co-author. … The help was appreciated, but not decisive.' - On a full proof with Claude: 'We also played around with Claude looking for an existence theory to various regularized versions of our equations … The resulting discussions got very complicated … Even if they were correct, Claude would have been the lead author' - On OpenAI: 'The OpenAI paper begins with what we recognize as regularized versions of our equations with very little motivation, a bit like a magic trick.' They call the mass release of papers 'both good for the field in some ways (new ideas) and bad for the field in other ways (mistakes, confusing exposition, … massive checking needing to be done)' - Provenance (verbatim): 'We do not know whether our privately circulated notes influenced the OpenAI results, and under current practices we cannot know. Labs could resolve such questions by publishing training-data provenance; absent that, authors are left with timelines, so we state ours.' The gauge-invariant t = 1 identity was 'derived entirely by humans in early February 2026' - OpenAI's claim (family 260, CONTENTS.md): 'Proves the sharp enclosing-area spacetime Penrose inequality for smooth one-ended asymptotically flat initial data in every spatial dimension n ≥ 3, under dominant energy, weak future trapping, positive enclosing area, and the stated decay assumptions', with charged, Kerr–Newman and anti-de Sitter companions and a Lean link; not yet confirmed by experts ## What happened The Penrose inequality says that an asymptotically flat initial data set satisfying the dominant energy condition has ADM mass at least ½(A/ω_{n−1})^{(n−2)/(n−1)}, where A is the minimal area enclosing its black holes. Penrose proposed it in 1973. The time-symmetric (Riemannian) case was proved by Huisken–Ilmanen and by Bray in three dimensions, and extended to all dimensions by Bray–Lee and Bi–Zhu. The general spacetime case was still open. Bray and Khuri proposed in 2009–2011 to reduce it to a system of PDEs (the "generalized Jang" approach). On 14 Oct 2026 Bray, Dolmen, Khuri and Schmidt posted [arXiv 2610.20559](https://arxiv.org/abs/2610.20559). It proves the spacetime inequality for "maximally parameterized" data in every dimension n ≥ 3. They also show that the full conjecture follows if a degenerate PDE system (their (3.18)) has solutions. In the abstract they say that, in their view, this is essentially what OpenAI's 6 Oct manuscript claims to have done. That manuscript, "The spacetime Penrose inequality and enclosing area" (dated 27 Sep), is part of family 260 of [OpenAI's 722-manuscript release](/e/2026-10-06-openai-math-release-722-manuscripts/). The family also includes charged, Kerr–Newman and anti-de Sitter versions and is linked to a Lean formalization. Until this paper, the dataset had not covered the Penrose part of the release. ### The AI statement (Appendix C) The authors write that they derived the gauge-invariant identity (t = 1) "entirely by humans in early February 2026". They then used Claude for the algebra of the general-t identity and to check every identity numerically and algebraically. Claude "also made some useful mathematical suggestions" while they derived the special form of k, and they write: "Had a human researcher made similar mathematical suggestions, we would have invited them to be a co-author. A younger researcher would likely have accepted, and a senior human researcher might have declined the offer. The help was appreciated, but not decisive." They also used Claude to draft short notes, and they ran their conversations "under settings that exclude them from model training". They tried using Claude to find an existence theory for regularized versions of their equations, which in the best case would have proved the full conjecture. They stopped because the discussions became too complicated to trust, and "Even if they were correct, Claude would have been the lead author". ### On OpenAI's release The authors say they are impressed by the productivity of OpenAI's Penrose papers, but "the mode of release concerns us". They say OpenAI's paper starts from regularized versions of their equations "with very little motivation, a bit like a magic trick", and that their own paper explains the direction OpenAI's paper takes. They note that drafts shared privately can enter AI training data if a recipient pastes them into a consumer product whose default settings allow training. They write that "no lab can demonstrate that it has not" happened, and they call this "a serious and growing problem for scholarly credit". They give their own timeline and claim credit for the program as it is defined in their paper. No Hacker News thread was found on 15 Oct (Algolia search for the arXiv id and "Penrose"), and a web search found no press coverage yet. X was not searched directly. ## Why it matters This is the first time experts whose own program was apparently completed by OpenAI's mass release have said so in a paper. In the same paper they credit a different lab's model (Claude) with co-author-level suggestions. The appendix shows what is now at stake in AI-assisted mathematics: credit, how readable machine-written proofs are, and training-data provenance. If OpenAI's general claim holds, the 1973 Penrose conjecture is settled. ## What is disputed or not yet verified - Verification: Unrefereed preprint by experts in the field (Bray proved the n = 3 Riemannian Penrose inequality, without the connectedness assumption); OpenAI's general claim not yet expert-confirmed ## Your AI and this story - GPT-6 Astra (training cutoff April 2026): 167 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 106 days after its cutoff - Gemini 4 Argon (training cutoff March 2026): 197 days after its cutoff - Grok 4.7 (training cutoff May 2026): 136 days after its cutoff ## Sources 1. [arXiv 2610.20559: Proof of the Penrose Conjecture for Maximally Parameterized Initial Data Sets (Bray, Dolmen, Khuri, Schmidt)](https://arxiv.org/abs/2610.20559) (arxiv.org, paper) 2. [OpenAI math release CONTENTS.md (family 260: spacetime Penrose inequalities)](https://github.com/openai/math/blob/main/CONTENTS.md) (github.com, paper) 3. [OpenAI: The spacetime Penrose inequality and enclosing area (PDF, dated 27 Sep 2026)](https://github.com/openai/math/blob/main/preprints/The-spacetime-Penrose-inequality-and-enclosing-area-September-27-2026/paper.pdf) (github.com, paper) ## Changes - 2026-10-15 (filed): Created from the arXiv PDF and the openai/math CONTENTS.md ## Related - 2026-10-14: [Mid-October 2026: arXiv results with disclosed AI help](https://postcutoff.com/e/2026-10-14-ai-assisted-results-mid-october-2026/index.md) - 2026-10-06: [OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems](https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/index.md) - 2026-10-06: [OpenAI model claims the free group factor problem](https://postcutoff.com/e/2026-10-06-free-group-factors-isomorphism-openai/index.md)