<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/">
	<channel>
		<title><![CDATA[MKLab - AI AND TECHNOLOGY]]></title>
		<link>https://mklab.gr/</link>
		<description><![CDATA[MKLab - https://mklab.gr]]></description>
		<pubDate>Sat, 12 Sep 2026 07:47:09 +0000</pubDate>
		<generator>MyBB</generator>
		<item>
			<title><![CDATA[Rethinking Mathematical Intuition in the Age of AI]]></title>
			<link>https://mklab.gr/showthread.php?tid=1948</link>
			<pubDate>Sat, 12 Sep 2026 02:10:29 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1948</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">Rethinking Mathematical Intuition in the Age of AI</span><br />
<span style="font-weight: bold;" class="mycode_b">Michael Friedman &amp; Kati Kish Bar-On — </span><br />
<span style="font-weight: bold;" class="mycode_b"><span style="font-style: italic;" class="mycode_i">The Mathematical Intelligencer</span>, 26 August 2026</span><br />
<br />
The article argues that artificial intelligence is beginning to change not merely <span style="font-weight: bold;" class="mycode_b">how quickly mathematics is done</span>, but the role of <span style="font-weight: bold;" class="mycode_b">mathematical intuition itself</span>. Traditionally, intuition has often come <span style="font-style: italic;" class="mycode_i">before</span> a proof: a mathematician develops a sense of which direction might work, proposes a construction or conjecture, and then tries to prove it. AI systems can reverse this order. They may discover a proof, construction, program, or unexpected connection first, leaving humans to understand <span style="font-style: italic;" class="mycode_i">afterwards</span> why it works. The authors illustrate this with the recent AI-assisted disproof of Erdős Problem #90, where configurations with at least &#36;n^{1+\delta}&#36; unit distances were obtained using techniques far removed from the approaches mathematicians had pursued for decades.<br />
<br />
Three case studies illustrate different forms of this shift. With <span style="font-weight: bold;" class="mycode_b">AlphaGeometry</span>, the system can propose highly non-obvious auxiliary constructions and formally prove that they work; human mathematicians may then have to reconstruct the geometric motivation afterward—what the authors call <span style="font-weight: bold;" class="mycode_b">retroactive intuition</span>. In <span style="font-weight: bold;" class="mycode_b">knot theory</span>, a neural network analysing roughly &#36;2.7&#36; million knots identified unexpected relationships among invariants, after which mathematicians interpreted the patterns, formulated conjectures and produced proofs. Here intuition becomes <span style="font-weight: bold;" class="mycode_b">co-constitutive</span>: AI discovers promising patterns while humans judge which ones deserve mathematical attention. With <span style="font-weight: bold;" class="mycode_b">FunSearch</span>, the transformation is even stronger. Instead of directly searching for a mathematical object, the AI searches through Python programs that generate objects; this approach improved the cap-set construction in dimension &#36;8&#36; from &#36;496&#36; to &#36;512&#36; elements, with humans extracting a comprehensible mathematical construction only after inspecting the discovered code. <br />
<br />
The authors therefore do <span style="font-weight: bold;" class="mycode_b">not</span> argue that AI will eliminate mathematical intuition. Rather, intuition may be <span style="font-weight: bold;" class="mycode_b">relocated</span> from discovery toward interpretation, explanation and selection. This becomes particularly important in what Terence Tao has called an era of <span style="font-weight: bold;" class="mycode_b">“proof abundance”</span>: machines may eventually generate far more correct proofs than mathematicians can meaningfully study. The scarce resource would then no longer be proofs themselves but <span style="font-weight: bold;" class="mycode_b">“proof digestion”</span>—determining which results matter, understanding why they are true, connecting them to existing mathematics, and turning opaque machine discoveries into concepts humans can reason about. The authors warn that if mathematics becomes satisfied merely with verified statements while abandoning the demand to understand <span style="font-style: italic;" class="mycode_i">why</span>, something essential about mathematical practice could be lost. <br />
<br />
<a href="https://link.springer.com/article/10.1007/s00283-026-10561-y" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">Rethinking Mathematical Intuition in the Age of AI</span><br />
<span style="font-weight: bold;" class="mycode_b">Michael Friedman &amp; Kati Kish Bar-On — </span><br />
<span style="font-weight: bold;" class="mycode_b"><span style="font-style: italic;" class="mycode_i">The Mathematical Intelligencer</span>, 26 August 2026</span><br />
<br />
The article argues that artificial intelligence is beginning to change not merely <span style="font-weight: bold;" class="mycode_b">how quickly mathematics is done</span>, but the role of <span style="font-weight: bold;" class="mycode_b">mathematical intuition itself</span>. Traditionally, intuition has often come <span style="font-style: italic;" class="mycode_i">before</span> a proof: a mathematician develops a sense of which direction might work, proposes a construction or conjecture, and then tries to prove it. AI systems can reverse this order. They may discover a proof, construction, program, or unexpected connection first, leaving humans to understand <span style="font-style: italic;" class="mycode_i">afterwards</span> why it works. The authors illustrate this with the recent AI-assisted disproof of Erdős Problem #90, where configurations with at least &#36;n^{1+\delta}&#36; unit distances were obtained using techniques far removed from the approaches mathematicians had pursued for decades.<br />
<br />
Three case studies illustrate different forms of this shift. With <span style="font-weight: bold;" class="mycode_b">AlphaGeometry</span>, the system can propose highly non-obvious auxiliary constructions and formally prove that they work; human mathematicians may then have to reconstruct the geometric motivation afterward—what the authors call <span style="font-weight: bold;" class="mycode_b">retroactive intuition</span>. In <span style="font-weight: bold;" class="mycode_b">knot theory</span>, a neural network analysing roughly &#36;2.7&#36; million knots identified unexpected relationships among invariants, after which mathematicians interpreted the patterns, formulated conjectures and produced proofs. Here intuition becomes <span style="font-weight: bold;" class="mycode_b">co-constitutive</span>: AI discovers promising patterns while humans judge which ones deserve mathematical attention. With <span style="font-weight: bold;" class="mycode_b">FunSearch</span>, the transformation is even stronger. Instead of directly searching for a mathematical object, the AI searches through Python programs that generate objects; this approach improved the cap-set construction in dimension &#36;8&#36; from &#36;496&#36; to &#36;512&#36; elements, with humans extracting a comprehensible mathematical construction only after inspecting the discovered code. <br />
<br />
The authors therefore do <span style="font-weight: bold;" class="mycode_b">not</span> argue that AI will eliminate mathematical intuition. Rather, intuition may be <span style="font-weight: bold;" class="mycode_b">relocated</span> from discovery toward interpretation, explanation and selection. This becomes particularly important in what Terence Tao has called an era of <span style="font-weight: bold;" class="mycode_b">“proof abundance”</span>: machines may eventually generate far more correct proofs than mathematicians can meaningfully study. The scarce resource would then no longer be proofs themselves but <span style="font-weight: bold;" class="mycode_b">“proof digestion”</span>—determining which results matter, understanding why they are true, connecting them to existing mathematics, and turning opaque machine discoveries into concepts humans can reason about. The authors warn that if mathematics becomes satisfied merely with verified statements while abandoning the demand to understand <span style="font-style: italic;" class="mycode_i">why</span>, something essential about mathematical practice could be lost. <br />
<br />
<a href="https://link.springer.com/article/10.1007/s00283-026-10561-y" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[What the Navier-Stokes Solution Portends]]></title>
			<link>https://mklab.gr/showthread.php?tid=1947</link>
			<pubDate>Sat, 12 Sep 2026 01:48:20 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1947</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
Steven Heilman argues that the significance of OpenAI’s reported solution of the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes Millennium Prize Problem</span> extends far beyond the mathematics itself. He focuses on the circumstances surrounding the announcement: according to Heilman, OpenAI contacted mathematician Tristan Buckmaster, spent an estimated <span style="font-weight: bold;" class="mycode_b">&#36;20 million in compute over roughly four days</span>, and was partly motivated by a desire to reach the result before competitors such as Anthropic. Heilman acknowledges that the AI system apparently succeeded in resolving an extraordinarily difficult mathematical problem, but stresses that it built on a promising strategy already identified by Buckmaster and Levent Alpöge and ultimately inspired by earlier mathematical work. <br />
<br />
The central concern of the article is therefore <span style="font-weight: bold;" class="mycode_b">not whether AI can do advanced mathematics, but what incentives are driving AI laboratories</span>. Heilman argues that corporate competition, publicity, investment and valuation may increasingly take priority over the slower academic processes of developing ideas, assigning credit and nurturing researchers' careers. He connects the Navier–Stokes episode with recent AI-assisted work on prime gaps and invokes Terence Tao's warning that mathematics risks being effectively <span style="font-weight: bold;" class="mycode_b">"strip mined" for headlines</span>. In this view, AI laboratories can deploy enormous computational resources against problems on which mathematicians may have spent years, converting unfinished human research directions into highly visible corporate achievements. <br />
<br />
His broader warning concerns the <span style="font-weight: bold;" class="mycode_b">future of intellectual labour</span>. The issue is not simply that AI might replace mathematicians; rather, Heilman fears that researchers could become inputs into a system whose primary objective is corporate advantage. Credit disputes matter because recognition affects academic careers, funding and employment, whereas companies have very different incentives: being first, attracting attention and demonstrating technological superiority. The article therefore portrays the Navier–Stokes episode as an early example of a possible transformation in which the economic power surrounding AI changes <span style="font-weight: bold;" class="mycode_b">who controls mathematical discovery, who receives credit for it, and why difficult problems are pursued in the first place</span>. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key idea:</span> Heilman is less worried that <span style="font-style: italic;" class="mycode_i">AI can solve mathematics</span> than that <span style="font-weight: bold;" class="mycode_b">corporations with enormous compute budgets may increasingly determine the direction, timing and ownership of mathematical discovery.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://stevenheilman.substack.com/p/what-the-the-navier-stokes-solution" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a></span>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
Steven Heilman argues that the significance of OpenAI’s reported solution of the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes Millennium Prize Problem</span> extends far beyond the mathematics itself. He focuses on the circumstances surrounding the announcement: according to Heilman, OpenAI contacted mathematician Tristan Buckmaster, spent an estimated <span style="font-weight: bold;" class="mycode_b">&#36;20 million in compute over roughly four days</span>, and was partly motivated by a desire to reach the result before competitors such as Anthropic. Heilman acknowledges that the AI system apparently succeeded in resolving an extraordinarily difficult mathematical problem, but stresses that it built on a promising strategy already identified by Buckmaster and Levent Alpöge and ultimately inspired by earlier mathematical work. <br />
<br />
The central concern of the article is therefore <span style="font-weight: bold;" class="mycode_b">not whether AI can do advanced mathematics, but what incentives are driving AI laboratories</span>. Heilman argues that corporate competition, publicity, investment and valuation may increasingly take priority over the slower academic processes of developing ideas, assigning credit and nurturing researchers' careers. He connects the Navier–Stokes episode with recent AI-assisted work on prime gaps and invokes Terence Tao's warning that mathematics risks being effectively <span style="font-weight: bold;" class="mycode_b">"strip mined" for headlines</span>. In this view, AI laboratories can deploy enormous computational resources against problems on which mathematicians may have spent years, converting unfinished human research directions into highly visible corporate achievements. <br />
<br />
His broader warning concerns the <span style="font-weight: bold;" class="mycode_b">future of intellectual labour</span>. The issue is not simply that AI might replace mathematicians; rather, Heilman fears that researchers could become inputs into a system whose primary objective is corporate advantage. Credit disputes matter because recognition affects academic careers, funding and employment, whereas companies have very different incentives: being first, attracting attention and demonstrating technological superiority. The article therefore portrays the Navier–Stokes episode as an early example of a possible transformation in which the economic power surrounding AI changes <span style="font-weight: bold;" class="mycode_b">who controls mathematical discovery, who receives credit for it, and why difficult problems are pursued in the first place</span>. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key idea:</span> Heilman is less worried that <span style="font-style: italic;" class="mycode_i">AI can solve mathematics</span> than that <span style="font-weight: bold;" class="mycode_b">corporations with enormous compute budgets may increasingly determine the direction, timing and ownership of mathematical discovery.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://stevenheilman.substack.com/p/what-the-the-navier-stokes-solution" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Use of AI in mathematical research]]></title>
			<link>https://mklab.gr/showthread.php?tid=1945</link>
			<pubDate>Sat, 12 Sep 2026 01:32:47 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1945</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">Use of AI in Mathematical Research: A Guide for Young Mathematicians — Pavel Etingof (MIT, May 2026)</span><br />
<br />
Pavel Etingof argues that mathematicians should neither reject AI nor delegate mathematics to it. His central principle is simple: <span style="font-weight: bold;" class="mycode_b">use AI to know and understand more mathematics, while personally remaining fully abreast of every mathematical step it produces</span>. Any AI-generated proof, computation, or argument that enters one's work must be independently checked, understood in detail, and rewritten in the mathematician’s own way. The reason is both practical and educational: LLMs can produce convincing but subtly false arguments, and the researcher—not the AI—is responsible for errors. More fundamentally, struggling with problems is how mathematicians acquire intuition and research ability; outsourcing that struggle defeats much of the purpose of doing mathematics.<br />
<br />
Etingof nevertheless sees AI as an increasingly powerful research instrument. It can help with <span style="font-weight: bold;" class="mycode_b">literature searches, explanations, brainstorming research questions, generating examples and computational data, searching for counterexamples, writing code, LaTeX, and proofreading</span>. For proving new results, however, he urges much greater skepticism: AI is considerably safer when explaining established mathematics than when claiming an original proof. One useful procedure is to have another model attack an AI-generated proof, iterate between critics, and then perform the decisive human verification yourself—but agreement between several models is still not evidence of correctness because models may share the same biases and failure modes. He also highlights formal verification with <span style="font-weight: bold;" class="mycode_b">Lean</span>, where LLMs can increasingly help translate mathematical statements into machine-checkable proofs, provided the human verifies that the formal statement actually represents the intended theorem.<br />
<br />
The broader message is that AI should be treated as a <span style="font-weight: bold;" class="mycode_b">powerful but unreliable digital collaborator</span>, not an autonomous mathematician. Etingof recommends using it to increase the amount and depth of mathematics one can explore rather than to reduce one's own mathematical effort. Researchers should verify references, protect confidential material, avoid copying AI-generated prose, acknowledge substantial AI contributions, and remain capable of reproducing and explaining everything without access to the original AI conversation. He also stresses that mathematics is fundamentally communal: even a correct machine-generated proof does not become genuine mathematical understanding until humans interpret it, explain its ideas, connect it to existing knowledge, and make it accessible to the mathematical community.<br />
<br />
Key takeaways<ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">AI should amplify mathematical thinking, not replace it.</span><br />
</li>
<li>Treat every novel AI-generated proof as <span style="font-weight: bold;" class="mycode_b">unverified until independently checked</span>.<br />
</li>
<li>AI may be especially useful for <span style="font-weight: bold;" class="mycode_b">examples, counterexamples, computation, coding, literature search and Lean formalization</span>.<br />
</li>
<li>Etingof's final test is particularly strong: <span style="font-style: italic;" class="mycode_i">if the AI conversation disappeared, could you still understand, reproduce and take full responsibility for everything in your work?</span><br />
</li>
</ul>
<br />
<span style="font-style: italic;" class="mycode_i"><a href="https://math.mit.edu/~etingof/aiuse.pdf" target="_blank" rel="noopener" class="mycode_url">ARTICLE [PDF]</a></span>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">Use of AI in Mathematical Research: A Guide for Young Mathematicians — Pavel Etingof (MIT, May 2026)</span><br />
<br />
Pavel Etingof argues that mathematicians should neither reject AI nor delegate mathematics to it. His central principle is simple: <span style="font-weight: bold;" class="mycode_b">use AI to know and understand more mathematics, while personally remaining fully abreast of every mathematical step it produces</span>. Any AI-generated proof, computation, or argument that enters one's work must be independently checked, understood in detail, and rewritten in the mathematician’s own way. The reason is both practical and educational: LLMs can produce convincing but subtly false arguments, and the researcher—not the AI—is responsible for errors. More fundamentally, struggling with problems is how mathematicians acquire intuition and research ability; outsourcing that struggle defeats much of the purpose of doing mathematics.<br />
<br />
Etingof nevertheless sees AI as an increasingly powerful research instrument. It can help with <span style="font-weight: bold;" class="mycode_b">literature searches, explanations, brainstorming research questions, generating examples and computational data, searching for counterexamples, writing code, LaTeX, and proofreading</span>. For proving new results, however, he urges much greater skepticism: AI is considerably safer when explaining established mathematics than when claiming an original proof. One useful procedure is to have another model attack an AI-generated proof, iterate between critics, and then perform the decisive human verification yourself—but agreement between several models is still not evidence of correctness because models may share the same biases and failure modes. He also highlights formal verification with <span style="font-weight: bold;" class="mycode_b">Lean</span>, where LLMs can increasingly help translate mathematical statements into machine-checkable proofs, provided the human verifies that the formal statement actually represents the intended theorem.<br />
<br />
The broader message is that AI should be treated as a <span style="font-weight: bold;" class="mycode_b">powerful but unreliable digital collaborator</span>, not an autonomous mathematician. Etingof recommends using it to increase the amount and depth of mathematics one can explore rather than to reduce one's own mathematical effort. Researchers should verify references, protect confidential material, avoid copying AI-generated prose, acknowledge substantial AI contributions, and remain capable of reproducing and explaining everything without access to the original AI conversation. He also stresses that mathematics is fundamentally communal: even a correct machine-generated proof does not become genuine mathematical understanding until humans interpret it, explain its ideas, connect it to existing knowledge, and make it accessible to the mathematical community.<br />
<br />
Key takeaways<ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">AI should amplify mathematical thinking, not replace it.</span><br />
</li>
<li>Treat every novel AI-generated proof as <span style="font-weight: bold;" class="mycode_b">unverified until independently checked</span>.<br />
</li>
<li>AI may be especially useful for <span style="font-weight: bold;" class="mycode_b">examples, counterexamples, computation, coding, literature search and Lean formalization</span>.<br />
</li>
<li>Etingof's final test is particularly strong: <span style="font-style: italic;" class="mycode_i">if the AI conversation disappeared, could you still understand, reproduce and take full responsibility for everything in your work?</span><br />
</li>
</ul>
<br />
<span style="font-style: italic;" class="mycode_i"><a href="https://math.mit.edu/~etingof/aiuse.pdf" target="_blank" rel="noopener" class="mycode_url">ARTICLE [PDF]</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[A Severe Misalignment of AI in Mathematics]]></title>
			<link>https://mklab.gr/showthread.php?tid=1943</link>
			<pubDate>Fri, 11 Sep 2026 22:40:30 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1943</guid>
			<description><![CDATA[The declaration <span style="font-weight: bold;" class="mycode_b">“A Severe Misalignment of AI in Mathematics”</span>, endorsed by many leading mathematicians and Fields Medalists, argues that the rapid improvement of AI systems in solving difficult mathematical problems may conflict with the deeper goals of mathematics. The authors stress that solving a famous problem is traditionally valuable not merely because it produces a correct theorem, but because the process generates <span style="font-weight: bold;" class="mycode_b">new concepts, methods, explanations, and understanding</span> that can be absorbed and developed by the mathematical community. Treating unsolved problems primarily as benchmarks for AI risks reducing mathematics to the mass production of correct answers rather than the cultivation of insight. <br />
<br />
The declaration also raises concerns about the speed with which AI-generated results may be announced. Rapid publication can leave insufficient time to clarify arguments, identify genuinely new ideas, connect them properly with previous research, and give appropriate attribution—creating possible problems involving <span style="font-weight: bold;" class="mycode_b">credit and plagiarism</span>. Even when AI produces important ideas, human mathematicians are still needed to interpret, simplify, teach, verify, and integrate those ideas into the broader mathematical body of knowledge. Without this process, the authors fear that the traditional chain through which mathematical understanding is transmitted between generations could weaken. <br />
<br />
The authors are <span style="font-weight: bold;" class="mycode_b">not rejecting AI in mathematics</span>. They acknowledge that AI could greatly accelerate genuine mathematical research and understanding. Their central warning is that the technology should be designed and used so that it strengthens the purposes of mathematics rather than merely optimizing for impressive problem-solving results. They view mathematics as an early example of a much broader challenge facing science and creative work: as AI becomes capable of producing the outputs of intellectual labor, society must ensure that it does not lose the <span style="font-weight: bold;" class="mycode_b">understanding, education, creativity, and human development that the work was meant to produce</span>.<br />
<br />
<a href="https://mathandai.org/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[The declaration <span style="font-weight: bold;" class="mycode_b">“A Severe Misalignment of AI in Mathematics”</span>, endorsed by many leading mathematicians and Fields Medalists, argues that the rapid improvement of AI systems in solving difficult mathematical problems may conflict with the deeper goals of mathematics. The authors stress that solving a famous problem is traditionally valuable not merely because it produces a correct theorem, but because the process generates <span style="font-weight: bold;" class="mycode_b">new concepts, methods, explanations, and understanding</span> that can be absorbed and developed by the mathematical community. Treating unsolved problems primarily as benchmarks for AI risks reducing mathematics to the mass production of correct answers rather than the cultivation of insight. <br />
<br />
The declaration also raises concerns about the speed with which AI-generated results may be announced. Rapid publication can leave insufficient time to clarify arguments, identify genuinely new ideas, connect them properly with previous research, and give appropriate attribution—creating possible problems involving <span style="font-weight: bold;" class="mycode_b">credit and plagiarism</span>. Even when AI produces important ideas, human mathematicians are still needed to interpret, simplify, teach, verify, and integrate those ideas into the broader mathematical body of knowledge. Without this process, the authors fear that the traditional chain through which mathematical understanding is transmitted between generations could weaken. <br />
<br />
The authors are <span style="font-weight: bold;" class="mycode_b">not rejecting AI in mathematics</span>. They acknowledge that AI could greatly accelerate genuine mathematical research and understanding. Their central warning is that the technology should be designed and used so that it strengthens the purposes of mathematics rather than merely optimizing for impressive problem-solving results. They view mathematics as an early example of a much broader challenge facing science and creative work: as AI becomes capable of producing the outputs of intellectual labor, society must ensure that it does not lose the <span style="font-weight: bold;" class="mycode_b">understanding, education, creativity, and human development that the work was meant to produce</span>.<br />
<br />
<a href="https://mathandai.org/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Top mathematicians are outraged by OpenAI’s methods]]></title>
			<link>https://mklab.gr/showthread.php?tid=1940</link>
			<pubDate>Fri, 11 Sep 2026 21:58:16 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1940</guid>
			<description><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">Source: </span><span style="color: #1e92f7;" class="mycode_color">The Economist</span><br />
<span style="color: #c14700;" class="mycode_color">This is a summary/commentary on the original article. </span></span></div>
<div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">The original article is available to subscribers at The Economist.</span></span></div></blockquote>
<br />
The article argues that the central danger of AI in mathematics is <span style="font-weight: bold;" class="mycode_b">not simply that machines may solve difficult problems faster than humans</span>, but that they may weaken the process through which mathematics produces understanding. The September 11th open letter signed by 24 Fields Medalists responds to recent AI claims such as OpenAI’s apparent solution of the Navier–Stokes problem. Its authors worry that AI labs are treating major mathematical problems as benchmarks: producing technically correct proofs while offering little intuition, explanation, or conceptual insight. For mathematicians such as Terence Tao and Hugo Duminil-Copin, the intellectual value of mathematics lies partly in the journey—the failed approaches, new ideas, intermediate lemmas and new questions generated while seeking a proof—not merely in reaching the final theorem.<br />
<br />
The article is strongest when it distinguishes <span style="font-weight: bold;" class="mycode_b">mathematical knowledge from mathematical understanding</span>. A machine-generated 166-page proof could expand what humanity knows while doing comparatively little to explain <span style="font-style: italic;" class="mycode_i">why</span> something is true. If this became common, mathematics could divide into results that machines can verify and results humans actually understand. That would be particularly troubling in pure mathematics, where understanding rather than immediate practical application is often the main objective.<br />
However, the argument is somewhat speculative. Historical comparisons with writing, calculators and search engines show that intellectual tools often change rather than destroy human abilities. AI could similarly become a partner that discovers proofs while mathematicians extract concepts, simplify arguments and build new theories from them. The cited research on “cognitive offloading” and correlations between AI use and critical thinking also does <span style="font-weight: bold;" class="mycode_b">not directly demonstrate that AI-assisted professional mathematics causes intellectual decline</span>.<br />
A deeper issue that the article only partly explores is the <span style="font-weight: bold;" class="mycode_b">structure of scientific credit and competition</span>. If well-funded AI laboratories can use unpublished or recently published human research, enormous computing resources and private models to finish problems that individual mathematicians have worked on for years, questions arise about attribution, priority, transparency and access—not merely cognitive decline.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Critical conclusion:</span> the Fields Medalists' warning should therefore not be read as opposition to AI doing mathematics. The more important question is <span style="font-weight: bold;" class="mycode_b">what kind of mathematical culture develops around AI</span>. If success is measured only by the number of famous conjectures solved, mathematics risks becoming a scoreboard for AI laboratories. If AI-generated proofs are instead followed by human explanation, simplification, verification and conceptual development, AI could greatly strengthen mathematics rather than undermine it. The challenge is ensuring that <span style="font-style: italic;" class="mycode_i">solving the theorem does not become more important than understanding the mathematics</span>.<br />
<br />
<br />
<a href="https://www.economist.com/science-and-technology/2026/09/11/top-mathematicians-are-outraged-by-openais-methods?taid=6aa43972129c9200012a636d&amp;utm_campaign=trueanthem&amp;utm_medium=social&amp;utm_source=twitter" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">Source: </span><span style="color: #1e92f7;" class="mycode_color">The Economist</span><br />
<span style="color: #c14700;" class="mycode_color">This is a summary/commentary on the original article. </span></span></div>
<div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">The original article is available to subscribers at The Economist.</span></span></div></blockquote>
<br />
The article argues that the central danger of AI in mathematics is <span style="font-weight: bold;" class="mycode_b">not simply that machines may solve difficult problems faster than humans</span>, but that they may weaken the process through which mathematics produces understanding. The September 11th open letter signed by 24 Fields Medalists responds to recent AI claims such as OpenAI’s apparent solution of the Navier–Stokes problem. Its authors worry that AI labs are treating major mathematical problems as benchmarks: producing technically correct proofs while offering little intuition, explanation, or conceptual insight. For mathematicians such as Terence Tao and Hugo Duminil-Copin, the intellectual value of mathematics lies partly in the journey—the failed approaches, new ideas, intermediate lemmas and new questions generated while seeking a proof—not merely in reaching the final theorem.<br />
<br />
The article is strongest when it distinguishes <span style="font-weight: bold;" class="mycode_b">mathematical knowledge from mathematical understanding</span>. A machine-generated 166-page proof could expand what humanity knows while doing comparatively little to explain <span style="font-style: italic;" class="mycode_i">why</span> something is true. If this became common, mathematics could divide into results that machines can verify and results humans actually understand. That would be particularly troubling in pure mathematics, where understanding rather than immediate practical application is often the main objective.<br />
However, the argument is somewhat speculative. Historical comparisons with writing, calculators and search engines show that intellectual tools often change rather than destroy human abilities. AI could similarly become a partner that discovers proofs while mathematicians extract concepts, simplify arguments and build new theories from them. The cited research on “cognitive offloading” and correlations between AI use and critical thinking also does <span style="font-weight: bold;" class="mycode_b">not directly demonstrate that AI-assisted professional mathematics causes intellectual decline</span>.<br />
A deeper issue that the article only partly explores is the <span style="font-weight: bold;" class="mycode_b">structure of scientific credit and competition</span>. If well-funded AI laboratories can use unpublished or recently published human research, enormous computing resources and private models to finish problems that individual mathematicians have worked on for years, questions arise about attribution, priority, transparency and access—not merely cognitive decline.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Critical conclusion:</span> the Fields Medalists' warning should therefore not be read as opposition to AI doing mathematics. The more important question is <span style="font-weight: bold;" class="mycode_b">what kind of mathematical culture develops around AI</span>. If success is measured only by the number of famous conjectures solved, mathematics risks becoming a scoreboard for AI laboratories. If AI-generated proofs are instead followed by human explanation, simplification, verification and conceptual development, AI could greatly strengthen mathematics rather than undermine it. The challenge is ensuring that <span style="font-style: italic;" class="mycode_i">solving the theorem does not become more important than understanding the mathematics</span>.<br />
<br />
<br />
<a href="https://www.economist.com/science-and-technology/2026/09/11/top-mathematicians-are-outraged-by-openais-methods?taid=6aa43972129c9200012a636d&amp;utm_campaign=trueanthem&amp;utm_medium=social&amp;utm_source=twitter" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[OpenAI's apparent maths breakthrough raises profound questions]]></title>
			<link>https://mklab.gr/showthread.php?tid=1939</link>
			<pubDate>Fri, 11 Sep 2026 19:24:19 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1939</guid>
			<description><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">Source: </span><span style="color: #1e92f7;" class="mycode_color">The Economist</span><br />
<span style="color: #c14700;" class="mycode_color">This is a summary/commentary on the original article. </span></span></div>
<div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">The original article is available to subscribers at The Economist.</span></span></div></blockquote>
<br />
<span style="font-weight: bold;" class="mycode_b">OpenAI claims AI agents solved the Navier–Stokes Millennium Problem</span><br />
<br />
OpenAI says that a large swarm of AI agents has found a solution to the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness problem</span>, one of the seven Millennium Prize Problems established by the Clay Mathematics Institute. The problem asks whether solutions to the three-dimensional Navier–Stokes equations can develop a finite-time singularity, where a quantity such as fluid velocity becomes unbounded. According to the account, OpenAI began its experiment on September 1st, 2026, using teams of autonomous agents capable of searching the web, running code and collaborating. After an intermediate breakthrough, around <span style="font-weight: bold;" class="mycode_b">10,000 agents</span> were focused on the problem and allegedly produced a singular solution after <span style="font-weight: bold;" class="mycode_b">88 hours</span>, exchanging roughly <span style="font-weight: bold;" class="mycode_b">2.7 million messages</span> and consuming at least <span style="font-weight: bold;" class="mycode_b">&#36;6.5 million in computing resources</span>. The proposed construction involves a rotating vortex whose velocity grows without bound, which—if rigorously validated—would demonstrate finite-time blow-up rather than global smoothness.<br />
<br />
The announcement is controversial because mathematician <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span> of NYU and <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> of Anthropic had been working independently on a closely related AI-assisted approach. Their incomplete research was published shortly before OpenAI's announcement, raising questions about priority, attribution and whether ideas from their work could somehow have influenced OpenAI's models. Buckmaster has suggested that material from their research may have entered training data, while OpenAI reportedly says it cannot completely rule this out. More fundamentally, the episode raises a new question for mathematics: when AI systems build on decades of human research and then cross the final barrier to a proof or counterexample, how should mathematical credit be assigned? OpenAI has said it <span style="font-weight: bold;" class="mycode_b">does not intend to claim the &#36;1 million Millennium Prize</span>.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>The Navier–Stokes problem concerns whether smooth &#36;3&#36;-dimensional fluid flows can develop <span style="font-weight: bold;" class="mycode_b">finite-time singularities</span>.<br />
</li>
<li>OpenAI claims its agents found such a singularity, which would amount to solving the Millennium problem through a counterexample to global smoothness.<br />
</li>
<li>The reported computation involved about <span style="font-weight: bold;" class="mycode_b">10,000 AI agents</span>, <span style="font-weight: bold;" class="mycode_b">88 hours</span>, <span style="font-weight: bold;" class="mycode_b">2.7 million messages</span>, and at least <span style="font-weight: bold;" class="mycode_b">&#36;6.5 million</span> in compute.<br />
</li>
<li>The result should still be regarded as a <span style="font-weight: bold;" class="mycode_b">claim until the full mathematical argument is independently examined and verified</span>.<br />
</li>
<li>Parallel work by <span style="font-weight: bold;" class="mycode_b">Buckmaster and Alpöge</span> has created a dispute over intellectual priority and possible influence between human research and AI training.<br />
</li>
<li>The case may become an important precedent for <span style="font-weight: bold;" class="mycode_b">authorship, attribution and credit in AI-assisted mathematics</span>.<br />
</li>
<li>OpenAI says it will <span style="font-weight: bold;" class="mycode_b">not seek the &#36;1 million Clay Mathematics Institute prize</span>.<br />
</li>
</ul>
<br />
<a href="https://www.economist.com/science-and-technology/2026/09/09/openais-apparent-maths-breakthrough-raises-profound-questions?taid=6aa3e3e42d55bb00014aed7c&amp;utm_campaign=trueanthem&amp;utm_medium=social&amp;utm_source=twitter" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">Source: </span><span style="color: #1e92f7;" class="mycode_color">The Economist</span><br />
<span style="color: #c14700;" class="mycode_color">This is a summary/commentary on the original article. </span></span></div>
<div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #c14700;" class="mycode_color">The original article is available to subscribers at The Economist.</span></span></div></blockquote>
<br />
<span style="font-weight: bold;" class="mycode_b">OpenAI claims AI agents solved the Navier–Stokes Millennium Problem</span><br />
<br />
OpenAI says that a large swarm of AI agents has found a solution to the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness problem</span>, one of the seven Millennium Prize Problems established by the Clay Mathematics Institute. The problem asks whether solutions to the three-dimensional Navier–Stokes equations can develop a finite-time singularity, where a quantity such as fluid velocity becomes unbounded. According to the account, OpenAI began its experiment on September 1st, 2026, using teams of autonomous agents capable of searching the web, running code and collaborating. After an intermediate breakthrough, around <span style="font-weight: bold;" class="mycode_b">10,000 agents</span> were focused on the problem and allegedly produced a singular solution after <span style="font-weight: bold;" class="mycode_b">88 hours</span>, exchanging roughly <span style="font-weight: bold;" class="mycode_b">2.7 million messages</span> and consuming at least <span style="font-weight: bold;" class="mycode_b">&#36;6.5 million in computing resources</span>. The proposed construction involves a rotating vortex whose velocity grows without bound, which—if rigorously validated—would demonstrate finite-time blow-up rather than global smoothness.<br />
<br />
The announcement is controversial because mathematician <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span> of NYU and <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> of Anthropic had been working independently on a closely related AI-assisted approach. Their incomplete research was published shortly before OpenAI's announcement, raising questions about priority, attribution and whether ideas from their work could somehow have influenced OpenAI's models. Buckmaster has suggested that material from their research may have entered training data, while OpenAI reportedly says it cannot completely rule this out. More fundamentally, the episode raises a new question for mathematics: when AI systems build on decades of human research and then cross the final barrier to a proof or counterexample, how should mathematical credit be assigned? OpenAI has said it <span style="font-weight: bold;" class="mycode_b">does not intend to claim the &#36;1 million Millennium Prize</span>.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>The Navier–Stokes problem concerns whether smooth &#36;3&#36;-dimensional fluid flows can develop <span style="font-weight: bold;" class="mycode_b">finite-time singularities</span>.<br />
</li>
<li>OpenAI claims its agents found such a singularity, which would amount to solving the Millennium problem through a counterexample to global smoothness.<br />
</li>
<li>The reported computation involved about <span style="font-weight: bold;" class="mycode_b">10,000 AI agents</span>, <span style="font-weight: bold;" class="mycode_b">88 hours</span>, <span style="font-weight: bold;" class="mycode_b">2.7 million messages</span>, and at least <span style="font-weight: bold;" class="mycode_b">&#36;6.5 million</span> in compute.<br />
</li>
<li>The result should still be regarded as a <span style="font-weight: bold;" class="mycode_b">claim until the full mathematical argument is independently examined and verified</span>.<br />
</li>
<li>Parallel work by <span style="font-weight: bold;" class="mycode_b">Buckmaster and Alpöge</span> has created a dispute over intellectual priority and possible influence between human research and AI training.<br />
</li>
<li>The case may become an important precedent for <span style="font-weight: bold;" class="mycode_b">authorship, attribution and credit in AI-assisted mathematics</span>.<br />
</li>
<li>OpenAI says it will <span style="font-weight: bold;" class="mycode_b">not seek the &#36;1 million Clay Mathematics Institute prize</span>.<br />
</li>
</ul>
<br />
<a href="https://www.economist.com/science-and-technology/2026/09/09/openais-apparent-maths-breakthrough-raises-profound-questions?taid=6aa3e3e42d55bb00014aed7c&amp;utm_campaign=trueanthem&amp;utm_medium=social&amp;utm_source=twitter" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[How OpenAI Responds to Claims It Used Academics’ Work]]></title>
			<link>https://mklab.gr/showthread.php?tid=1938</link>
			<pubDate>Fri, 11 Sep 2026 19:10:08 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1938</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b"><span style="font-size: large;" class="mycode_size">How OpenAI Responds to Claims It Used Academics’ Work in the Navier–Stokes Breakthrough</span></span><br />
<br />
The controversy surrounding OpenAI's claimed progress on the Navier–Stokes Millennium Prize problem has developed into a wider debate about artificial intelligence, academic credit, unpublished research, and the increasingly powerful role of AI laboratories in mathematics.<br />
Mathematician Tristan Buckmaster and other academics have raised concerns about how OpenAI arrived at its result, particularly because Buckmaster and collaborator Levent Alpöge had themselves been working on closely related problems while using OpenAI's Codex system.<br />
However, it is important to distinguish between the different allegations. There is currently no established evidence that OpenAI simply copied or "stole" Buckmaster and Alpöge's unpublished proof.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">1. OpenAI denies using Buckmaster's private Codex work</span><br />
OpenAI has issued a direct denial that Buckmaster's recent private Codex interactions contributed to the Navier–Stokes result.<br />
According to OpenAI, an internal investigation found that Buckmaster's Codex prompts from the period before the announcement:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"could not have influenced the system in any way, including through training."</blockquote>
OpenAI also says that neither its researchers nor the AI agents involved in the project had access to Buckmaster and Alpöge's unpublished research before it became public.<br />
This represents a stronger position than OpenAI initially took.<br />
Early in the controversy, OpenAI reportedly acknowledged that it could not completely exclude the possibility that de-identified product-use data might indirectly have contributed to model improvement.<br />
After investigating the specific case, however, OpenAI stated that the relevant Codex sessions could not have affected the model responsible for the mathematical result.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://openai.com/index/navier-stokes-solution/%5DOpenAI" target="_blank" rel="noopener" class="mycode_url">https://openai.com/index/navier-stokes-solution/]OpenAI</a> — Navier–Stokes Solution[/url]<br />
[url=<a href="https://www.wired.com/story/openai-navier-stokes-math-discovery-academics/%5DWIRED" target="_blank" rel="noopener" class="mycode_url">https://www.wired.com/story/openai-navier-stokes-math-discovery-academics/]WIRED</a> — OpenAI, Navier–Stokes and academic concerns[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">2. OpenAI admits that news of academic progress triggered its effort</span><br />
One important part of the story is not disputed.<br />
OpenAI acknowledges that its intensive Navier–Stokes effort began after researchers at the company heard that major progress had apparently been made on a Millennium Prize problem.<br />
The company says that on September 1 it began directing substantial AI resources toward the problem.<br />
It later became clear that the mathematical progress being discussed involved Buckmaster and Alpöge.<br />
This means that OpenAI is not claiming that its effort was completely unrelated to the academics' work.<br />
Rather, its position is that hearing that progress existed encouraged OpenAI to investigate the mathematical area independently.<br />
This creates an important distinction.<br />
The allegation is no longer simply:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Did OpenAI copy the unpublished proof?"</blockquote>
There is also a broader ethical question:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Should an AI laboratory use information that academics are close to an important breakthrough as a signal to deploy enormous computational resources and attempt to reach the result first?"</blockquote>
Some mathematicians regard this as a modern form of academic "scooping", even if no confidential mathematical details were directly used.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">3. OpenAI argues that the mathematical results are different</span><br />
OpenAI also argues that its mathematical result is substantially different from the work carried out by Buckmaster and Alpöge.<br />
Buckmaster and Alpöge had obtained results involving the Euler equations with external forcing.<br />
OpenAI says its AI-assisted approach went further by finding a construction without the same external forcing, eventually producing what it claims is a route toward the Navier–Stokes problem.<br />
If correct, this would mean that OpenAI did not simply reproduce Buckmaster and Alpöge's proof.<br />
This part of the controversy is potentially easier for the mathematical community to evaluate, because researchers can compare the published mathematical arguments directly.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">4. The dispute over academic credit</span><br />
Another controversial issue concerns authorship and academic recognition.<br />
Buckmaster has described discussions with OpenAI researchers concerning how the respective results might be presented.<br />
According to Buckmaster, OpenAI proposed arrangements under which he could potentially be connected to OpenAI's paper, while Alpöge — who works for Anthropic — would not necessarily appear in the same way.<br />
Buckmaster also reported a particularly tense conversation in which OpenAI researcher Sébastien Bubeck allegedly asked:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Why would you ruin your career?"</blockquote>
Buckmaster interpreted the conversation as pressure.<br />
Bubeck disputes that interpretation.<br />
He says he was not asking Buckmaster to remove Alpöge from their own academic research. Rather, according to Bubeck, the discussion concerned authorship of OpenAI's separate work.<br />
Bubeck has also apologized for the wording concerning Buckmaster's career, describing it as a poor choice of words rather than a threat.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://www.abc.net.au/news/2026-09-10/openai-navier-stokes-millennium-problem-claims/107132242%5DABC" target="_blank" rel="noopener" class="mycode_url">https://www.abc.net.au/news/2026-09-10/openai-navier-stokes-millennium-problem-claims/107132242]ABC</a> News — Navier–Stokes dispute[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">5. Buckmaster has stopped short of accusing OpenAI of theft</span><br />
Despite the strong reaction surrounding the controversy, Buckmaster himself has been relatively careful in his public statements.<br />
He has said:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"I do not know whether our data was used."</blockquote>
He has also stated:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"I am not accusing anyone of anything."</blockquote>
His argument is essentially that the timeline and circumstances were unusual enough that they deserved public scrutiny.<br />
Therefore, the statement:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Buckmaster proved that OpenAI stole his proof"</blockquote>
would currently be inaccurate.<br />
A more precise description would be:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>Buckmaster raised concerns about whether unpublished AI-assisted mathematical work could have indirectly influenced OpenAI's project and questioned the way OpenAI responded after becoming aware of his team's progress.</blockquote>
<span style="font-weight: bold;" class="mycode_b">6. Criticism from the wider mathematical community</span><br />
The controversy has expanded beyond Buckmaster.<br />
A number of mathematicians have expressed concerns about the way large AI laboratories are entering mathematical research.<br />
An open letter associated with members of the Caltech and broader mathematics community criticized the increasing pressure to rapidly announce AI-generated mathematical discoveries.<br />
Critics argue that AI laboratories can deploy enormous amounts of computing power after hearing that traditional researchers are approaching an important result.<br />
Some mathematicians have also complained that the academic community is then expected to spend significant amounts of unpaid time checking extremely long AI-generated proofs.<br />
The open letter reportedly described some of these practices as potentially amounting to:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"research misconduct."</blockquote>
OpenAI subsequently withdrew its sponsorship of a Caltech mathematics event following the controversy.<br />
<span style="font-weight: bold;" class="mycode_b">Sources:</span><br />
[url=<a href="https://proofsandprompts.com/2026/09/10/open-letter-about-the-mathathon/%5DOpen" target="_blank" rel="noopener" class="mycode_url">https://proofsandprompts.com/2026/09/10/open-letter-about-the-mathathon/]Open</a> Letter About the Mathathon[/url]<br />
[url=<a href="https://www.businessinsider.com/openai-caltech-ai-math-hackathon-backlash-anthropic-2026-9%5DBusiness" target="_blank" rel="noopener" class="mycode_url">https://www.businessinsider.com/openai-caltech-ai-math-hackathon-backlash-anthropic-2026-9]Business</a> Insider — OpenAI withdraws from Caltech math event[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">7. Questions about citations and attribution</span><br />
A separate controversy also emerged concerning references in OpenAI's mathematical paper.<br />
Reports stated that the original version did not properly cite earlier work by mathematicians Diego Córdoba and Luis Martínez-Zoroa, whose techniques were considered relevant to the construction.<br />
Those references were subsequently added.<br />
This does not demonstrate that OpenAI copied Buckmaster's research.<br />
However, it has contributed to concerns among mathematicians that the speed of AI-generated mathematical research may sometimes come at the expense of careful attribution.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html%5DEl" target="_blank" rel="noopener" class="mycode_url">https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-</a><br />
<a href="https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html%5DEl" target="_blank" rel="noopener" class="mycode_url">matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html]El</a> País — OpenAI adds mathematical citations[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Where does the evidence currently stand?</span><br />
At present, there is no publicly demonstrated evidence that OpenAI directly stole Buckmaster and Alpöge's unpublished proof.<br />
Two important facts, however, appear to be established.<ul class="mycode_list"><li>OpenAI learned that another group had made significant progress and then deliberately launched a very large computational effort toward the same general mathematical problem.<br />
</li>
<li>Buckmaster had been using OpenAI's Codex system while conducting unpublished mathematical research, which naturally raised questions about whether those interactions could somehow have influenced OpenAI's models.<br />
</li>
</ul>
OpenAI now says that its investigation has ruled out the second possibility for the relevant prompts.<br />
The remaining difficulty is independent verification.<br />
Outside mathematicians can compare the mathematical proofs themselves, but they cannot independently reconstruct OpenAI's internal training pipeline or determine precisely what information was available to every system involved.<br />
<span style="font-weight: bold;" class="mycode_b">Conclusion</span><br />
The controversy therefore appears to be shifting away from the simple question:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Did OpenAI steal Buckmaster's proof?"</blockquote>
OpenAI has issued a fairly specific technical denial of that allegation.<br />
The more difficult question may instead be:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"What should happen when AI laboratories hear that academic researchers are approaching a major breakthrough and can immediately deploy thousands of AI agents and enormous computational resources toward the same target?"</blockquote>
That question is likely to become increasingly important as AI systems become capable of carrying out more sophisticated mathematical research.<br />
Traditional academic norms developed in a world where competing researchers generally had comparable human limitations.<br />
AI laboratories operate under very different conditions.<br />
The Navier–Stokes controversy may therefore become an early example of a much larger debate about authorship, priority, research ethics and the future relationship between mathematicians and AI laboratories.]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b"><span style="font-size: large;" class="mycode_size">How OpenAI Responds to Claims It Used Academics’ Work in the Navier–Stokes Breakthrough</span></span><br />
<br />
The controversy surrounding OpenAI's claimed progress on the Navier–Stokes Millennium Prize problem has developed into a wider debate about artificial intelligence, academic credit, unpublished research, and the increasingly powerful role of AI laboratories in mathematics.<br />
Mathematician Tristan Buckmaster and other academics have raised concerns about how OpenAI arrived at its result, particularly because Buckmaster and collaborator Levent Alpöge had themselves been working on closely related problems while using OpenAI's Codex system.<br />
However, it is important to distinguish between the different allegations. There is currently no established evidence that OpenAI simply copied or "stole" Buckmaster and Alpöge's unpublished proof.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">1. OpenAI denies using Buckmaster's private Codex work</span><br />
OpenAI has issued a direct denial that Buckmaster's recent private Codex interactions contributed to the Navier–Stokes result.<br />
According to OpenAI, an internal investigation found that Buckmaster's Codex prompts from the period before the announcement:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"could not have influenced the system in any way, including through training."</blockquote>
OpenAI also says that neither its researchers nor the AI agents involved in the project had access to Buckmaster and Alpöge's unpublished research before it became public.<br />
This represents a stronger position than OpenAI initially took.<br />
Early in the controversy, OpenAI reportedly acknowledged that it could not completely exclude the possibility that de-identified product-use data might indirectly have contributed to model improvement.<br />
After investigating the specific case, however, OpenAI stated that the relevant Codex sessions could not have affected the model responsible for the mathematical result.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://openai.com/index/navier-stokes-solution/%5DOpenAI" target="_blank" rel="noopener" class="mycode_url">https://openai.com/index/navier-stokes-solution/]OpenAI</a> — Navier–Stokes Solution[/url]<br />
[url=<a href="https://www.wired.com/story/openai-navier-stokes-math-discovery-academics/%5DWIRED" target="_blank" rel="noopener" class="mycode_url">https://www.wired.com/story/openai-navier-stokes-math-discovery-academics/]WIRED</a> — OpenAI, Navier–Stokes and academic concerns[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">2. OpenAI admits that news of academic progress triggered its effort</span><br />
One important part of the story is not disputed.<br />
OpenAI acknowledges that its intensive Navier–Stokes effort began after researchers at the company heard that major progress had apparently been made on a Millennium Prize problem.<br />
The company says that on September 1 it began directing substantial AI resources toward the problem.<br />
It later became clear that the mathematical progress being discussed involved Buckmaster and Alpöge.<br />
This means that OpenAI is not claiming that its effort was completely unrelated to the academics' work.<br />
Rather, its position is that hearing that progress existed encouraged OpenAI to investigate the mathematical area independently.<br />
This creates an important distinction.<br />
The allegation is no longer simply:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Did OpenAI copy the unpublished proof?"</blockquote>
There is also a broader ethical question:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Should an AI laboratory use information that academics are close to an important breakthrough as a signal to deploy enormous computational resources and attempt to reach the result first?"</blockquote>
Some mathematicians regard this as a modern form of academic "scooping", even if no confidential mathematical details were directly used.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">3. OpenAI argues that the mathematical results are different</span><br />
OpenAI also argues that its mathematical result is substantially different from the work carried out by Buckmaster and Alpöge.<br />
Buckmaster and Alpöge had obtained results involving the Euler equations with external forcing.<br />
OpenAI says its AI-assisted approach went further by finding a construction without the same external forcing, eventually producing what it claims is a route toward the Navier–Stokes problem.<br />
If correct, this would mean that OpenAI did not simply reproduce Buckmaster and Alpöge's proof.<br />
This part of the controversy is potentially easier for the mathematical community to evaluate, because researchers can compare the published mathematical arguments directly.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">4. The dispute over academic credit</span><br />
Another controversial issue concerns authorship and academic recognition.<br />
Buckmaster has described discussions with OpenAI researchers concerning how the respective results might be presented.<br />
According to Buckmaster, OpenAI proposed arrangements under which he could potentially be connected to OpenAI's paper, while Alpöge — who works for Anthropic — would not necessarily appear in the same way.<br />
Buckmaster also reported a particularly tense conversation in which OpenAI researcher Sébastien Bubeck allegedly asked:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Why would you ruin your career?"</blockquote>
Buckmaster interpreted the conversation as pressure.<br />
Bubeck disputes that interpretation.<br />
He says he was not asking Buckmaster to remove Alpöge from their own academic research. Rather, according to Bubeck, the discussion concerned authorship of OpenAI's separate work.<br />
Bubeck has also apologized for the wording concerning Buckmaster's career, describing it as a poor choice of words rather than a threat.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://www.abc.net.au/news/2026-09-10/openai-navier-stokes-millennium-problem-claims/107132242%5DABC" target="_blank" rel="noopener" class="mycode_url">https://www.abc.net.au/news/2026-09-10/openai-navier-stokes-millennium-problem-claims/107132242]ABC</a> News — Navier–Stokes dispute[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">5. Buckmaster has stopped short of accusing OpenAI of theft</span><br />
Despite the strong reaction surrounding the controversy, Buckmaster himself has been relatively careful in his public statements.<br />
He has said:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"I do not know whether our data was used."</blockquote>
He has also stated:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"I am not accusing anyone of anything."</blockquote>
His argument is essentially that the timeline and circumstances were unusual enough that they deserved public scrutiny.<br />
Therefore, the statement:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Buckmaster proved that OpenAI stole his proof"</blockquote>
would currently be inaccurate.<br />
A more precise description would be:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>Buckmaster raised concerns about whether unpublished AI-assisted mathematical work could have indirectly influenced OpenAI's project and questioned the way OpenAI responded after becoming aware of his team's progress.</blockquote>
<span style="font-weight: bold;" class="mycode_b">6. Criticism from the wider mathematical community</span><br />
The controversy has expanded beyond Buckmaster.<br />
A number of mathematicians have expressed concerns about the way large AI laboratories are entering mathematical research.<br />
An open letter associated with members of the Caltech and broader mathematics community criticized the increasing pressure to rapidly announce AI-generated mathematical discoveries.<br />
Critics argue that AI laboratories can deploy enormous amounts of computing power after hearing that traditional researchers are approaching an important result.<br />
Some mathematicians have also complained that the academic community is then expected to spend significant amounts of unpaid time checking extremely long AI-generated proofs.<br />
The open letter reportedly described some of these practices as potentially amounting to:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"research misconduct."</blockquote>
OpenAI subsequently withdrew its sponsorship of a Caltech mathematics event following the controversy.<br />
<span style="font-weight: bold;" class="mycode_b">Sources:</span><br />
[url=<a href="https://proofsandprompts.com/2026/09/10/open-letter-about-the-mathathon/%5DOpen" target="_blank" rel="noopener" class="mycode_url">https://proofsandprompts.com/2026/09/10/open-letter-about-the-mathathon/]Open</a> Letter About the Mathathon[/url]<br />
[url=<a href="https://www.businessinsider.com/openai-caltech-ai-math-hackathon-backlash-anthropic-2026-9%5DBusiness" target="_blank" rel="noopener" class="mycode_url">https://www.businessinsider.com/openai-caltech-ai-math-hackathon-backlash-anthropic-2026-9]Business</a> Insider — OpenAI withdraws from Caltech math event[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">7. Questions about citations and attribution</span><br />
A separate controversy also emerged concerning references in OpenAI's mathematical paper.<br />
Reports stated that the original version did not properly cite earlier work by mathematicians Diego Córdoba and Luis Martínez-Zoroa, whose techniques were considered relevant to the construction.<br />
Those references were subsequently added.<br />
This does not demonstrate that OpenAI copied Buckmaster's research.<br />
However, it has contributed to concerns among mathematicians that the speed of AI-generated mathematical research may sometimes come at the expense of careful attribution.<br />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
[url=<a href="https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html%5DEl" target="_blank" rel="noopener" class="mycode_url">https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-</a><br />
<a href="https://elpais.com/tecnologia/2026-09-10/openai-corrige-de-tapadillo-su-prueba-del-milenio-para-citar-a-los-matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html%5DEl" target="_blank" rel="noopener" class="mycode_url">matematicos-clave-que-ninguneo-al-anunciar-el-descubrimiento.html]El</a> País — OpenAI adds mathematical citations[/url]<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Where does the evidence currently stand?</span><br />
At present, there is no publicly demonstrated evidence that OpenAI directly stole Buckmaster and Alpöge's unpublished proof.<br />
Two important facts, however, appear to be established.<ul class="mycode_list"><li>OpenAI learned that another group had made significant progress and then deliberately launched a very large computational effort toward the same general mathematical problem.<br />
</li>
<li>Buckmaster had been using OpenAI's Codex system while conducting unpublished mathematical research, which naturally raised questions about whether those interactions could somehow have influenced OpenAI's models.<br />
</li>
</ul>
OpenAI now says that its investigation has ruled out the second possibility for the relevant prompts.<br />
The remaining difficulty is independent verification.<br />
Outside mathematicians can compare the mathematical proofs themselves, but they cannot independently reconstruct OpenAI's internal training pipeline or determine precisely what information was available to every system involved.<br />
<span style="font-weight: bold;" class="mycode_b">Conclusion</span><br />
The controversy therefore appears to be shifting away from the simple question:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"Did OpenAI steal Buckmaster's proof?"</blockquote>
OpenAI has issued a fairly specific technical denial of that allegation.<br />
The more difficult question may instead be:<br />
<blockquote class="mycode_quote"><cite>Quote:</cite>"What should happen when AI laboratories hear that academic researchers are approaching a major breakthrough and can immediately deploy thousands of AI agents and enormous computational resources toward the same target?"</blockquote>
That question is likely to become increasingly important as AI systems become capable of carrying out more sophisticated mathematical research.<br />
Traditional academic norms developed in a world where competing researchers generally had comparable human limitations.<br />
AI laboratories operate under very different conditions.<br />
The Navier–Stokes controversy may therefore become an early example of a much larger debate about authorship, priority, research ethics and the future relationship between mathematicians and AI laboratories.]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[EMS statement on recent Navier–Stokes announcement]]></title>
			<link>https://mklab.gr/showthread.php?tid=1931</link>
			<pubDate>Thu, 10 Sep 2026 19:23:49 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1931</guid>
			<description><![CDATA[The <span style="font-weight: bold;" class="mycode_b">European Mathematical Society (EMS)</span> has issued a statement on OpenAI’s recent announcement concerning the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes Millennium Prize Problem</span>. The EMS describes the development as potentially a <span style="font-weight: bold;" class="mycode_b">historic milestone in mathematics</span>, both because a major open problem may have been resolved and because the work emerged from collaboration between <span style="font-weight: bold;" class="mycode_b">professional mathematicians and AI systems</span>. <br />
<br />
However, the Society stresses that the result did not arise independently of existing mathematics: it builds closely on ideas developed by <span style="font-weight: bold;" class="mycode_b">Diego Córdoba, Luis Martínez-Zoroa, and Fan Zheng</span>, as well as recent progress by <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> and <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span>, together with decades of earlier research.<br />
<br />
The EMS considers the <span style="font-weight: bold;" class="mycode_b">speed of the human–AI collaboration remarkable</span>, but says the episode raises important questions about <span style="font-weight: bold;" class="mycode_b">authorship, attribution, and scientific credit</span> when mathematics is produced jointly by humans and machines. It also expresses concern that the AI model used by OpenAI is <span style="font-weight: bold;" class="mycode_b">internal and not generally accessible</span>, arguing that unequal access to powerful research systems could conflict with principles of <span style="font-weight: bold;" class="mycode_b">open science and equal opportunity</span>. Despite these concerns, the EMS concludes by joining in the <span style="font-weight: bold;" class="mycode_b">admiration and celebration of the achievement</span> while emphasizing that the mathematical community will need to develop new norms for AI-assisted research. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>The EMS regards the announcement as a potentially historic mathematical achievement.<br />
</li>
<li>It explicitly credits earlier mathematicians whose ideas underpin the approach.<br />
</li>
<li>Human–AI collaboration appears to have accelerated the research dramatically.<br />
</li>
<li>New rules may be needed for <span style="font-weight: bold;" class="mycode_b">authorship and credit</span> in AI-assisted mathematics.<br />
</li>
<li>The EMS is concerned that OpenAI's research model is <span style="font-weight: bold;" class="mycode_b">not openly accessible</span>.<br />
</li>
<li>Its overall position is <span style="font-weight: bold;" class="mycode_b">supportive but cautious</span>: celebrate the mathematics while addressing the scientific and ethical consequences.<br />
</li>
</ul>
<br />
<a href="https://euromathsoc.org/news/225" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[The <span style="font-weight: bold;" class="mycode_b">European Mathematical Society (EMS)</span> has issued a statement on OpenAI’s recent announcement concerning the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes Millennium Prize Problem</span>. The EMS describes the development as potentially a <span style="font-weight: bold;" class="mycode_b">historic milestone in mathematics</span>, both because a major open problem may have been resolved and because the work emerged from collaboration between <span style="font-weight: bold;" class="mycode_b">professional mathematicians and AI systems</span>. <br />
<br />
However, the Society stresses that the result did not arise independently of existing mathematics: it builds closely on ideas developed by <span style="font-weight: bold;" class="mycode_b">Diego Córdoba, Luis Martínez-Zoroa, and Fan Zheng</span>, as well as recent progress by <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> and <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span>, together with decades of earlier research.<br />
<br />
The EMS considers the <span style="font-weight: bold;" class="mycode_b">speed of the human–AI collaboration remarkable</span>, but says the episode raises important questions about <span style="font-weight: bold;" class="mycode_b">authorship, attribution, and scientific credit</span> when mathematics is produced jointly by humans and machines. It also expresses concern that the AI model used by OpenAI is <span style="font-weight: bold;" class="mycode_b">internal and not generally accessible</span>, arguing that unequal access to powerful research systems could conflict with principles of <span style="font-weight: bold;" class="mycode_b">open science and equal opportunity</span>. Despite these concerns, the EMS concludes by joining in the <span style="font-weight: bold;" class="mycode_b">admiration and celebration of the achievement</span> while emphasizing that the mathematical community will need to develop new norms for AI-assisted research. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>The EMS regards the announcement as a potentially historic mathematical achievement.<br />
</li>
<li>It explicitly credits earlier mathematicians whose ideas underpin the approach.<br />
</li>
<li>Human–AI collaboration appears to have accelerated the research dramatically.<br />
</li>
<li>New rules may be needed for <span style="font-weight: bold;" class="mycode_b">authorship and credit</span> in AI-assisted mathematics.<br />
</li>
<li>The EMS is concerned that OpenAI's research model is <span style="font-weight: bold;" class="mycode_b">not openly accessible</span>.<br />
</li>
<li>Its overall position is <span style="font-weight: bold;" class="mycode_b">supportive but cautious</span>: celebrate the mathematics while addressing the scientific and ethical consequences.<br />
</li>
</ul>
<br />
<a href="https://euromathsoc.org/news/225" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Has AI cracked a $1m maths problem?]]></title>
			<link>https://mklab.gr/showthread.php?tid=1928</link>
			<pubDate>Thu, 10 Sep 2026 04:51:08 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1928</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">Has AI cracked a &#36;1m maths problem?</span><br />
<br />
The <span style="font-style: italic;" class="mycode_i">Plus Magazine</span> article discusses OpenAI’s September 2026 announcement that an internal AI system had produced a proposed solution to the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness Millennium Prize Problem</span>, one of the seven problems for which the Clay Mathematics Institute offered a &#36;1&#36; million prize. The Navier–Stokes equations describe the motion of fluids such as air and water and underpin applications ranging from weather prediction to aerodynamics. The fundamental mathematical question is whether initially smooth three-dimensional solutions must remain smooth forever, or whether they can develop a <span style="font-weight: bold;" class="mycode_b">singularity</span> in finite time. <br />
<br />
OpenAI says its system constructed a smooth, finite-energy solution with smooth external forcing in which the velocity becomes unbounded after a finite time. In other words, rather than proving that smooth solutions always exist, the proposed proof takes the opposite route: it constructs a situation in which the Navier–Stokes dynamics <span style="font-weight: bold;" class="mycode_b">blow up</span>. OpenAI states that this establishes cases C and D of the official Millennium Problem formulation, and it released both a conventional mathematical proof and a formalized version checked in <span style="font-weight: bold;" class="mycode_b">Lean</span>.<br />
<br />
However, <span style="font-style: italic;" class="mycode_i">Plus</span> deliberately frames the development as something the mathematical community is <span style="font-weight: bold;" class="mycode_b">still checking and debating</span>, rather than simply declaring the Millennium Problem permanently settled. There is also controversy over attribution and the relationship between OpenAI's work and related research by Tristan Buckmaster, Levent Alpöge and earlier work by Diego Córdoba and Luis Martínez-Zoroa. Buckmaster stresses that important ideas behind the forced-blowup approach arose from this earlier human research and describes extensive collaboration between mathematicians and LLMs. The article also emphasizes that even if the proof is accepted, ordinary engineering applications are not suddenly invalidated: the pathological solutions do not mean aircraft simulations or weather models will cease to work. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>OpenAI has presented a <span style="font-weight: bold;" class="mycode_b">claimed solution</span> of the Navier–Stokes Millennium Prize Problem by demonstrating finite-time singularity formation rather than universal smoothness. <br />
</li>
<li>The result comes with both a traditional proof and a <span style="font-weight: bold;" class="mycode_b">Lean-formalized proof</span>, giving the claim an unusually strong form of machine verification, though broader mathematical scrutiny is still underway. <br />
</li>
<li>The story is also about <span style="font-weight: bold;" class="mycode_b">AI's rapidly changing role in mathematics</span>: AI systems are moving from assisting mathematicians to potentially producing major original proofs.<br />
</li>
<li>For now, it is safest to say that AI has produced a <span style="font-weight: bold;" class="mycode_b">serious proposed resolution</span> of the &#36;1&#36; million problem—not that the Clay Mathematics Institute has already officially awarded or certified the prize. <br />
</li>
</ul>
<br />
<a href="https://plus.maths.org/has-ai-cracked-1m-maths-problem" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">Has AI cracked a &#36;1m maths problem?</span><br />
<br />
The <span style="font-style: italic;" class="mycode_i">Plus Magazine</span> article discusses OpenAI’s September 2026 announcement that an internal AI system had produced a proposed solution to the <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness Millennium Prize Problem</span>, one of the seven problems for which the Clay Mathematics Institute offered a &#36;1&#36; million prize. The Navier–Stokes equations describe the motion of fluids such as air and water and underpin applications ranging from weather prediction to aerodynamics. The fundamental mathematical question is whether initially smooth three-dimensional solutions must remain smooth forever, or whether they can develop a <span style="font-weight: bold;" class="mycode_b">singularity</span> in finite time. <br />
<br />
OpenAI says its system constructed a smooth, finite-energy solution with smooth external forcing in which the velocity becomes unbounded after a finite time. In other words, rather than proving that smooth solutions always exist, the proposed proof takes the opposite route: it constructs a situation in which the Navier–Stokes dynamics <span style="font-weight: bold;" class="mycode_b">blow up</span>. OpenAI states that this establishes cases C and D of the official Millennium Problem formulation, and it released both a conventional mathematical proof and a formalized version checked in <span style="font-weight: bold;" class="mycode_b">Lean</span>.<br />
<br />
However, <span style="font-style: italic;" class="mycode_i">Plus</span> deliberately frames the development as something the mathematical community is <span style="font-weight: bold;" class="mycode_b">still checking and debating</span>, rather than simply declaring the Millennium Problem permanently settled. There is also controversy over attribution and the relationship between OpenAI's work and related research by Tristan Buckmaster, Levent Alpöge and earlier work by Diego Córdoba and Luis Martínez-Zoroa. Buckmaster stresses that important ideas behind the forced-blowup approach arose from this earlier human research and describes extensive collaboration between mathematicians and LLMs. The article also emphasizes that even if the proof is accepted, ordinary engineering applications are not suddenly invalidated: the pathological solutions do not mean aircraft simulations or weather models will cease to work. <br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li>OpenAI has presented a <span style="font-weight: bold;" class="mycode_b">claimed solution</span> of the Navier–Stokes Millennium Prize Problem by demonstrating finite-time singularity formation rather than universal smoothness. <br />
</li>
<li>The result comes with both a traditional proof and a <span style="font-weight: bold;" class="mycode_b">Lean-formalized proof</span>, giving the claim an unusually strong form of machine verification, though broader mathematical scrutiny is still underway. <br />
</li>
<li>The story is also about <span style="font-weight: bold;" class="mycode_b">AI's rapidly changing role in mathematics</span>: AI systems are moving from assisting mathematicians to potentially producing major original proofs.<br />
</li>
<li>For now, it is safest to say that AI has produced a <span style="font-weight: bold;" class="mycode_b">serious proposed resolution</span> of the &#36;1&#36; million problem—not that the Clay Mathematics Institute has already officially awarded or certified the prize. <br />
</li>
</ul>
<br />
<a href="https://plus.maths.org/has-ai-cracked-1m-maths-problem" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[AI Has Solved One of Math’s $1 Million Millennium Prize Problems]]></title>
			<link>https://mklab.gr/showthread.php?tid=1914</link>
			<pubDate>Wed, 09 Sep 2026 01:24:56 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1914</guid>
			<description><![CDATA[Summary<br />
<br />
In a potentially historic development, <span style="font-weight: bold;" class="mycode_b">OpenAI researchers announced on September 8, 2026 that an AI system had produced a proof of finite-time singularity formation for the three-dimensional Navier–Stokes equations</span>, one of the seven Millennium Prize Problems. These equations describe the motion of incompressible fluids and can be written schematically as<br />
&#36;\displaystyle \frac{\partial u}{\partial t}+(u\cdot\nabla)u=-\nabla p+\nu\Delta u+f,&#36;<br />
together with the incompressibility condition<br />
&#36;\displaystyle \nabla\cdot u=0.&#36;<br />
<br />
The central question has been whether initially smooth solutions must remain smooth forever or whether they can develop a <span style="font-weight: bold;" class="mycode_b">singularity</span>, where some quantity associated with the velocity field becomes unbounded in finite time. According to OpenAI, its construction produces such a blow-up starting from smooth data while using a <span style="font-weight: bold;" class="mycode_b">smooth external force</span> and keeping the relevant energy finite. If the argument survives full mathematical scrutiny, it would settle the Millennium problem by demonstrating that global regularity can fail.<br />
<br />
The breakthrough did not arise from AI in isolation. Quanta emphasizes the crucial earlier work of <span style="font-weight: bold;" class="mycode_b">Diego Córdoba and Luis Martínez-Zoroa</span>, who developed an unusual analytic method based on an infinite cascade of individually regular fluid structures. Their previous constructions could create singularities but did not satisfy all the smoothness requirements imposed on the forcing term. The remaining challenge was therefore to make the cascade produce blow-up while the forcing remained sufficiently smooth. OpenAI reports that roughly <span style="font-weight: bold;" class="mycode_b">10,000 autonomous AI agents</span> explored the problem in parallel and eventually discovered a construction satisfying these additional conditions. The resulting argument was subsequently formalized in <span style="font-weight: bold;" class="mycode_b">Lean</span>, allowing its logical steps to be machine-checked.<br />
<br />
The result is also surrounded by important questions concerning mathematical priority and attribution. Shortly before OpenAI's announcement, mathematician <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span> and Anthropic researcher <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> announced related AI-assisted progress for Euler-type fluid equations, also building on ideas developed by Córdoba and Martínez-Zoroa. The episode therefore raises a new question for mathematics: when an AI system completes a proof whose conceptual framework was created by human mathematicians, how should intellectual credit be distributed?<br />
<br />
Another important distinction is that <span style="font-weight: bold;" class="mycode_b">formal verification is not automatically identical to independent mathematical acceptance</span>. Lean can verify that a formal theorem logically follows from its stated assumptions, but mathematicians must still check that the formalized statement corresponds precisely to the Navier–Stokes problem posed by the Clay Mathematics Institute. The wider mathematical community must also examine the construction, its hypotheses, and the relationship between the formal theorem and the original Millennium Prize formulation.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Claimed result:</span> A smooth three-dimensional Navier–Stokes solution can develop a finite-time singularity under the permitted smooth forcing conditions.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">The mathematical system studied is</span><br />
</li>
</ul>
&#36;\displaystyle \frac{\partial u}{\partial t}+(u\cdot\nabla)u=-\nabla p+\nu\Delta u+f,&#36;<br />
with<br />
&#36;\displaystyle \nabla\cdot u=0.&#36;<ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">AI played an unprecedented role:</span> thousands of autonomous agents searched through possible arguments and constructions, with the final proof subsequently formalized in Lean.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">Human mathematics remained fundamental:</span> the breakthrough relies heavily on the earlier infinite-cascade ideas developed by Córdoba and Martínez-Zoroa.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">The &#36;1 million prize has not automatically been awarded.</span> The Clay Mathematics Institute has its own requirements for recognition and independent verification before a Millennium Prize solution can be officially accepted.<br />
</li>
<li>If the proof withstands independent scrutiny, it would represent one of the most important demonstrations so far that AI can contribute not merely to checking mathematics but to producing genuinely new research-level mathematical arguments.<br />
</li>
</ul>
<br />
<span style="font-weight: bold;" class="mycode_b">OpenAI has presented a formally verified candidate solution to the Navier–Stokes Millennium Prize Problem. If independent mathematicians confirm that the argument satisfies the exact Clay conditions, it could constitute the solution of one of mathematics' most famous open problems.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://www.quantamagazine.org/ai-has-solved-one-of-maths-1-million-millennium-prize-problems-20260908/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a> / <a href="https://drive.google.com/file/d/1LXTNZJFIU7uIk-NnrHfWLUvV5c7XsYcU/view?usp=drive_link" target="_blank" rel="noopener" class="mycode_url">ARTICLE [PDF]</a></span>]]></description>
			<content:encoded><![CDATA[Summary<br />
<br />
In a potentially historic development, <span style="font-weight: bold;" class="mycode_b">OpenAI researchers announced on September 8, 2026 that an AI system had produced a proof of finite-time singularity formation for the three-dimensional Navier–Stokes equations</span>, one of the seven Millennium Prize Problems. These equations describe the motion of incompressible fluids and can be written schematically as<br />
&#36;\displaystyle \frac{\partial u}{\partial t}+(u\cdot\nabla)u=-\nabla p+\nu\Delta u+f,&#36;<br />
together with the incompressibility condition<br />
&#36;\displaystyle \nabla\cdot u=0.&#36;<br />
<br />
The central question has been whether initially smooth solutions must remain smooth forever or whether they can develop a <span style="font-weight: bold;" class="mycode_b">singularity</span>, where some quantity associated with the velocity field becomes unbounded in finite time. According to OpenAI, its construction produces such a blow-up starting from smooth data while using a <span style="font-weight: bold;" class="mycode_b">smooth external force</span> and keeping the relevant energy finite. If the argument survives full mathematical scrutiny, it would settle the Millennium problem by demonstrating that global regularity can fail.<br />
<br />
The breakthrough did not arise from AI in isolation. Quanta emphasizes the crucial earlier work of <span style="font-weight: bold;" class="mycode_b">Diego Córdoba and Luis Martínez-Zoroa</span>, who developed an unusual analytic method based on an infinite cascade of individually regular fluid structures. Their previous constructions could create singularities but did not satisfy all the smoothness requirements imposed on the forcing term. The remaining challenge was therefore to make the cascade produce blow-up while the forcing remained sufficiently smooth. OpenAI reports that roughly <span style="font-weight: bold;" class="mycode_b">10,000 autonomous AI agents</span> explored the problem in parallel and eventually discovered a construction satisfying these additional conditions. The resulting argument was subsequently formalized in <span style="font-weight: bold;" class="mycode_b">Lean</span>, allowing its logical steps to be machine-checked.<br />
<br />
The result is also surrounded by important questions concerning mathematical priority and attribution. Shortly before OpenAI's announcement, mathematician <span style="font-weight: bold;" class="mycode_b">Tristan Buckmaster</span> and Anthropic researcher <span style="font-weight: bold;" class="mycode_b">Levent Alpöge</span> announced related AI-assisted progress for Euler-type fluid equations, also building on ideas developed by Córdoba and Martínez-Zoroa. The episode therefore raises a new question for mathematics: when an AI system completes a proof whose conceptual framework was created by human mathematicians, how should intellectual credit be distributed?<br />
<br />
Another important distinction is that <span style="font-weight: bold;" class="mycode_b">formal verification is not automatically identical to independent mathematical acceptance</span>. Lean can verify that a formal theorem logically follows from its stated assumptions, but mathematicians must still check that the formalized statement corresponds precisely to the Navier–Stokes problem posed by the Clay Mathematics Institute. The wider mathematical community must also examine the construction, its hypotheses, and the relationship between the formal theorem and the original Millennium Prize formulation.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Claimed result:</span> A smooth three-dimensional Navier–Stokes solution can develop a finite-time singularity under the permitted smooth forcing conditions.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">The mathematical system studied is</span><br />
</li>
</ul>
&#36;\displaystyle \frac{\partial u}{\partial t}+(u\cdot\nabla)u=-\nabla p+\nu\Delta u+f,&#36;<br />
with<br />
&#36;\displaystyle \nabla\cdot u=0.&#36;<ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">AI played an unprecedented role:</span> thousands of autonomous agents searched through possible arguments and constructions, with the final proof subsequently formalized in Lean.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">Human mathematics remained fundamental:</span> the breakthrough relies heavily on the earlier infinite-cascade ideas developed by Córdoba and Martínez-Zoroa.<br />
</li>
<li><span style="font-weight: bold;" class="mycode_b">The &#36;1 million prize has not automatically been awarded.</span> The Clay Mathematics Institute has its own requirements for recognition and independent verification before a Millennium Prize solution can be officially accepted.<br />
</li>
<li>If the proof withstands independent scrutiny, it would represent one of the most important demonstrations so far that AI can contribute not merely to checking mathematics but to producing genuinely new research-level mathematical arguments.<br />
</li>
</ul>
<br />
<span style="font-weight: bold;" class="mycode_b">OpenAI has presented a formally verified candidate solution to the Navier–Stokes Millennium Prize Problem. If independent mathematicians confirm that the argument satisfies the exact Clay conditions, it could constitute the solution of one of mathematics' most famous open problems.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://www.quantamagazine.org/ai-has-solved-one-of-maths-1-million-millennium-prize-problems-20260908/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a> / <a href="https://drive.google.com/file/d/1LXTNZJFIU7uIk-NnrHfWLUvV5c7XsYcU/view?usp=drive_link" target="_blank" rel="noopener" class="mycode_url">ARTICLE [PDF]</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[OpenAI claims a solution to Navier-Stokes Millennium Prize Problem]]></title>
			<link>https://mklab.gr/showthread.php?tid=1913</link>
			<pubDate>Tue, 08 Sep 2026 22:11:13 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1913</guid>
			<description><![CDATA[<div style="text-align: center;" class="mycode_align"><span style="font-size: large;" class="mycode_size"><span style="font-weight: bold;" class="mycode_b">OpenAI and the Navier–Stokes Millennium Prize Problem</span></span><br />
<span style="font-weight: bold;" class="mycode_b">A proposed AI-generated solution to one of mathematics’ greatest open problems</span></div>
OpenAI has announced a proposed solution to the famous <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness problem</span>, one of the seven Millennium Prize Problems established by the Clay Mathematics Institute.<br />
The three-dimensional incompressible Navier–Stokes equations describing the motion of a viscous fluid are<br />
&#36;\partial_t u+(u\cdot\nabla)u-\nu\Delta u+\nabla p=f,\qquad \nabla\cdot u=0.&#36;<br />
Here &#36;u&#36; represents the velocity of the fluid, &#36;p&#36; its pressure, &#36;\nu&gt;0&#36; the viscosity and &#36;f&#36; an external force.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">The central mathematical problem</span></span><br />
One of the fundamental questions in mathematical fluid dynamics is whether a solution that begins smoothly must remain smooth for all time.<br />
Alternatively, could the equations produce a <span style="font-weight: bold;" class="mycode_b">finite-time singularity</span>, where some quantity associated with the velocity of the fluid becomes infinite after a finite amount of time?<br />
OpenAI's proposed proof takes the second route.<br />
According to the paper, for every viscosity &#36;\nu&gt;0&#36; it is possible to construct a smooth, compactly supported external force &#36;f&#36; and a solution starting from rest,<br />
&#36;u(\cdot,0)=0,&#36;<br />
such that its total kinetic energy remains bounded:<br />
&#36;\sup_{0\le t&lt;1}|u(t)|_{L^2}&lt;\infty,&#36;<br />
while at the same time the maximum magnitude of the velocity becomes unbounded as &#36;t&#36; approaches &#36;1&#36;:<br />
&#36;\limsup_{t\to1^-}|u(t)|_{L^\infty}=\infty.&#36;<br />
In other words, the fluid can retain finite total energy while its velocity becomes arbitrarily large in an increasingly small region of space.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">What does the singularity look like?</span></span><br />
The construction can be pictured as an extremely thin and increasingly stretched vortex.<br />
As time progresses, the vortex becomes concentrated into a smaller region, spirals inward and accelerates. Its local velocity grows without bound, even though the total kinetic energy of the fluid remains finite.<br />
A crucial part of the proof is arranging a delicate cancellation between several terms in the Navier–Stokes equations — nonlinear acceleration, pressure and viscosity — so that the external forcing term &#36;f&#36; itself remains perfectly smooth.<br />
The singular behaviour therefore appears in the velocity field rather than being introduced artificially through a singular external force.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">The role of artificial intelligence</span></span><br />
Perhaps the most remarkable aspect of the announcement is the way in which OpenAI says the proof was discovered.<br />
According to OpenAI, a large multi-agent AI research system explored many different mathematical approaches simultaneously. The system first investigated a related finite-time blow-up problem for the inviscid Euler equations and subsequently concentrated its effort on the Navier–Stokes equations.<br />
The resulting mathematical argument was also subjected to formal verification using <span style="font-weight: bold;" class="mycode_b">Lean</span>, a proof assistant increasingly used for computer-verified mathematics.<br />
If the result is confirmed, the achievement would therefore be important not only for fluid mechanics and partial differential equations, but also for the emerging field of <span style="font-weight: bold;" class="mycode_b">AI-assisted mathematical research</span>.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">Has the Millennium Prize Problem officially been solved?</span></span><br />
<span style="font-weight: bold;" class="mycode_b">Not yet.</span><br />
At present, the result should be described as a <span style="font-weight: bold;" class="mycode_b">proposed solution</span>.<br />
Even a very detailed proof, together with computer formalization, does not automatically settle a Millennium Prize Problem. The argument must be examined carefully by independent specialists and eventually gain broad acceptance within the mathematical community.<br />
The Clay Mathematics Institute also requires a substantial period of public mathematical scrutiny before formally considering a solution for the Millennium Prize.<br />
Therefore the most important stage now begins: mathematicians working in partial differential equations and fluid dynamics must check every part of the construction independently.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">Why this matters</span></span><br />
If the proof survives independent verification, the consequences would be profound.<br />
It would show that smooth solutions of the forced three-dimensional Navier–Stokes equations can develop finite-time singularities, answering one of the most famous questions in modern mathematical analysis.<br />
It would also represent an extraordinary milestone in the relationship between mathematics and artificial intelligence: an AI research system would have contributed directly to resolving a problem that has resisted generations of mathematicians.<br />
For the moment, however, the correct mathematical attitude is one of <span style="font-weight: bold;" class="mycode_b">great interest combined with careful verification</span>.<br />
The proposed proof may ultimately become a historic breakthrough — but its validity will be determined by the mathematical community.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
<a href="https://openai.com/index/navier-stokes-solution/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<div style="text-align: center;" class="mycode_align"><span style="font-size: large;" class="mycode_size"><span style="font-weight: bold;" class="mycode_b">OpenAI and the Navier–Stokes Millennium Prize Problem</span></span><br />
<span style="font-weight: bold;" class="mycode_b">A proposed AI-generated solution to one of mathematics’ greatest open problems</span></div>
OpenAI has announced a proposed solution to the famous <span style="font-weight: bold;" class="mycode_b">Navier–Stokes existence and smoothness problem</span>, one of the seven Millennium Prize Problems established by the Clay Mathematics Institute.<br />
The three-dimensional incompressible Navier–Stokes equations describing the motion of a viscous fluid are<br />
&#36;\partial_t u+(u\cdot\nabla)u-\nu\Delta u+\nabla p=f,\qquad \nabla\cdot u=0.&#36;<br />
Here &#36;u&#36; represents the velocity of the fluid, &#36;p&#36; its pressure, &#36;\nu&gt;0&#36; the viscosity and &#36;f&#36; an external force.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">The central mathematical problem</span></span><br />
One of the fundamental questions in mathematical fluid dynamics is whether a solution that begins smoothly must remain smooth for all time.<br />
Alternatively, could the equations produce a <span style="font-weight: bold;" class="mycode_b">finite-time singularity</span>, where some quantity associated with the velocity of the fluid becomes infinite after a finite amount of time?<br />
OpenAI's proposed proof takes the second route.<br />
According to the paper, for every viscosity &#36;\nu&gt;0&#36; it is possible to construct a smooth, compactly supported external force &#36;f&#36; and a solution starting from rest,<br />
&#36;u(\cdot,0)=0,&#36;<br />
such that its total kinetic energy remains bounded:<br />
&#36;\sup_{0\le t&lt;1}|u(t)|_{L^2}&lt;\infty,&#36;<br />
while at the same time the maximum magnitude of the velocity becomes unbounded as &#36;t&#36; approaches &#36;1&#36;:<br />
&#36;\limsup_{t\to1^-}|u(t)|_{L^\infty}=\infty.&#36;<br />
In other words, the fluid can retain finite total energy while its velocity becomes arbitrarily large in an increasingly small region of space.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">What does the singularity look like?</span></span><br />
The construction can be pictured as an extremely thin and increasingly stretched vortex.<br />
As time progresses, the vortex becomes concentrated into a smaller region, spirals inward and accelerates. Its local velocity grows without bound, even though the total kinetic energy of the fluid remains finite.<br />
A crucial part of the proof is arranging a delicate cancellation between several terms in the Navier–Stokes equations — nonlinear acceleration, pressure and viscosity — so that the external forcing term &#36;f&#36; itself remains perfectly smooth.<br />
The singular behaviour therefore appears in the velocity field rather than being introduced artificially through a singular external force.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">The role of artificial intelligence</span></span><br />
Perhaps the most remarkable aspect of the announcement is the way in which OpenAI says the proof was discovered.<br />
According to OpenAI, a large multi-agent AI research system explored many different mathematical approaches simultaneously. The system first investigated a related finite-time blow-up problem for the inviscid Euler equations and subsequently concentrated its effort on the Navier–Stokes equations.<br />
The resulting mathematical argument was also subjected to formal verification using <span style="font-weight: bold;" class="mycode_b">Lean</span>, a proof assistant increasingly used for computer-verified mathematics.<br />
If the result is confirmed, the achievement would therefore be important not only for fluid mechanics and partial differential equations, but also for the emerging field of <span style="font-weight: bold;" class="mycode_b">AI-assisted mathematical research</span>.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">Has the Millennium Prize Problem officially been solved?</span></span><br />
<span style="font-weight: bold;" class="mycode_b">Not yet.</span><br />
At present, the result should be described as a <span style="font-weight: bold;" class="mycode_b">proposed solution</span>.<br />
Even a very detailed proof, together with computer formalization, does not automatically settle a Millennium Prize Problem. The argument must be examined carefully by independent specialists and eventually gain broad acceptance within the mathematical community.<br />
The Clay Mathematics Institute also requires a substantial period of public mathematical scrutiny before formally considering a solution for the Millennium Prize.<br />
Therefore the most important stage now begins: mathematicians working in partial differential equations and fluid dynamics must check every part of the construction independently.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b"><span style="font-size: medium;" class="mycode_size">Why this matters</span></span><br />
If the proof survives independent verification, the consequences would be profound.<br />
It would show that smooth solutions of the forced three-dimensional Navier–Stokes equations can develop finite-time singularities, answering one of the most famous questions in modern mathematical analysis.<br />
It would also represent an extraordinary milestone in the relationship between mathematics and artificial intelligence: an AI research system would have contributed directly to resolving a problem that has resisted generations of mathematicians.<br />
For the moment, however, the correct mathematical attitude is one of <span style="font-weight: bold;" class="mycode_b">great interest combined with careful verification</span>.<br />
The proposed proof may ultimately become a historic breakthrough — but its validity will be determined by the mathematical community.<br />
<hr class="mycode_hr" />
<span style="font-weight: bold;" class="mycode_b">Source:</span><br />
<a href="https://openai.com/index/navier-stokes-solution/" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Formalizing Fermat's Last Theorem]]></title>
			<link>https://mklab.gr/showthread.php?tid=1853</link>
			<pubDate>Sat, 05 Sep 2026 15:09:30 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1853</guid>
			<description><![CDATA[Formalizing Fermat’s Last Theorem — Anthropic, September 4, 2026<br />
Anthropic reports what it describes as the <span style="font-weight: bold;" class="mycode_b">first complete computer-checked formal proof of Fermat’s Last Theorem (FLT)</span>. The theorem states that there are no positive integers &#36;a,b,c&#36; satisfying<br />
&#36;a^n+b^n=c^n&#36;<br />
for any integer &#36;n&gt;2&#36;. Andrew Wiles, later working with Richard Taylor, proved FLT in the 1990s using deep results connecting elliptic curves and modular forms. Anthropic’s achievement is <span style="font-weight: bold;" class="mycode_b">not a new mathematical proof of FLT</span>, but a formalization of the existing mathematical argument in the <span style="font-weight: bold;" class="mycode_b">Lean proof assistant</span>, where every logical step can be checked mechanically. According to Anthropic, Claude worked largely autonomously for <span style="font-weight: bold;" class="mycode_b">11 days</span>, generated about <span style="font-weight: bold;" class="mycode_b">13 million lines of Lean code</span>, and proved roughly <span style="font-weight: bold;" class="mycode_b">30,300 intermediate theorems</span>.<br />
<br />
The project used a multi-agent system together with <span style="font-weight: bold;" class="mycode_b">Prove2Me</span>, a collaborative formalization platform that organizes mathematical dependencies as a directed acyclic graph. Different Claude agents could therefore work simultaneously on algebra, number theory, geometry, harmonic analysis, and other components of the proof. The final argument follows a streamlined exposition of Wiles’s proof by <span style="font-weight: bold;" class="mycode_b">Henri Darmon, Fred Diamond and Richard Taylor</span>. The finished proof was compiled and verified by Lean, demonstrating that a modern AI system can formalize mathematics at a scale that previously required enormous amounts of specialized human effort.<br />
<br />
The broader significance may extend well beyond Fermat’s Last Theorem. Formalizing advanced mathematics is difficult because proof assistants require every intermediate logical step that ordinary mathematical writing often leaves implicit. AI systems could substantially reduce this burden, making it practical for research papers to be accompanied by <span style="font-weight: bold;" class="mycode_b">machine-verifiable proofs</span>. This could help detect subtle errors in existing mathematics and provide an increasingly important mechanism for checking mathematical arguments generated by AI itself. Formal verification, however, should complement rather than replace clear, human-readable mathematical proofs.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Claude did not discover a new proof of FLT</span>; it formalized an existing proof so that Lean could verify it mechanically.<br />
</li>
<li>Fermat’s Last Theorem states that &#36;a^n+b^n=c^n&#36; has no positive integer solutions when &#36;n&gt;2&#36;.<br />
</li>
<li>The project involved about <span style="font-weight: bold;" class="mycode_b">13 million lines of Lean code</span> and roughly <span style="font-weight: bold;" class="mycode_b">30,300 proved intermediate theorems</span>.<br />
</li>
<li>The major breakthrough is in <span style="font-weight: bold;" class="mycode_b">AI-assisted mathematical formalization and verification</span>, potentially making machine-checked research mathematics much more practical.<br />
</li>
</ul>
<br />
<a href="https://www.anthropic.com/research/formalizing-fermats-last-theorem" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[Formalizing Fermat’s Last Theorem — Anthropic, September 4, 2026<br />
Anthropic reports what it describes as the <span style="font-weight: bold;" class="mycode_b">first complete computer-checked formal proof of Fermat’s Last Theorem (FLT)</span>. The theorem states that there are no positive integers &#36;a,b,c&#36; satisfying<br />
&#36;a^n+b^n=c^n&#36;<br />
for any integer &#36;n&gt;2&#36;. Andrew Wiles, later working with Richard Taylor, proved FLT in the 1990s using deep results connecting elliptic curves and modular forms. Anthropic’s achievement is <span style="font-weight: bold;" class="mycode_b">not a new mathematical proof of FLT</span>, but a formalization of the existing mathematical argument in the <span style="font-weight: bold;" class="mycode_b">Lean proof assistant</span>, where every logical step can be checked mechanically. According to Anthropic, Claude worked largely autonomously for <span style="font-weight: bold;" class="mycode_b">11 days</span>, generated about <span style="font-weight: bold;" class="mycode_b">13 million lines of Lean code</span>, and proved roughly <span style="font-weight: bold;" class="mycode_b">30,300 intermediate theorems</span>.<br />
<br />
The project used a multi-agent system together with <span style="font-weight: bold;" class="mycode_b">Prove2Me</span>, a collaborative formalization platform that organizes mathematical dependencies as a directed acyclic graph. Different Claude agents could therefore work simultaneously on algebra, number theory, geometry, harmonic analysis, and other components of the proof. The final argument follows a streamlined exposition of Wiles’s proof by <span style="font-weight: bold;" class="mycode_b">Henri Darmon, Fred Diamond and Richard Taylor</span>. The finished proof was compiled and verified by Lean, demonstrating that a modern AI system can formalize mathematics at a scale that previously required enormous amounts of specialized human effort.<br />
<br />
The broader significance may extend well beyond Fermat’s Last Theorem. Formalizing advanced mathematics is difficult because proof assistants require every intermediate logical step that ordinary mathematical writing often leaves implicit. AI systems could substantially reduce this burden, making it practical for research papers to be accompanied by <span style="font-weight: bold;" class="mycode_b">machine-verifiable proofs</span>. This could help detect subtle errors in existing mathematics and provide an increasingly important mechanism for checking mathematical arguments generated by AI itself. Formal verification, however, should complement rather than replace clear, human-readable mathematical proofs.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Claude did not discover a new proof of FLT</span>; it formalized an existing proof so that Lean could verify it mechanically.<br />
</li>
<li>Fermat’s Last Theorem states that &#36;a^n+b^n=c^n&#36; has no positive integer solutions when &#36;n&gt;2&#36;.<br />
</li>
<li>The project involved about <span style="font-weight: bold;" class="mycode_b">13 million lines of Lean code</span> and roughly <span style="font-weight: bold;" class="mycode_b">30,300 proved intermediate theorems</span>.<br />
</li>
<li>The major breakthrough is in <span style="font-weight: bold;" class="mycode_b">AI-assisted mathematical formalization and verification</span>, potentially making machine-checked research mathematics much more practical.<br />
</li>
</ul>
<br />
<a href="https://www.anthropic.com/research/formalizing-fermats-last-theorem" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Formalizing 100 Theorems]]></title>
			<link>https://mklab.gr/showthread.php?tid=1851</link>
			<pubDate>Fri, 04 Sep 2026 23:34:23 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1851</guid>
			<description><![CDATA[The <span style="font-weight: bold;" class="mycode_b">“Formalizing 100 Theorems”</span> project, maintained by mathematician and computer scientist <span style="font-weight: bold;" class="mycode_b">Freek Wiedijk</span>, tracks the progress of formalizing a well-known “Top 100” list of important mathematical theorems using computer proof assistants. A formalized theorem is not merely written as an ordinary mathematical proof: every definition, logical step, and inference is encoded in a rigorous formal language so that a proof-checking system can verify it mechanically. The list ranges from classical results such as the irrationality of &#36;\sqrt{2}&#36;, the Pythagorean theorem, and the infinitude of primes to much deeper results such as Gödel’s incompleteness theorem, the Prime Number Theorem, quadratic reciprocity, and the Fundamental Theorem of Algebra. According to the current project page, <span style="font-weight: bold;" class="mycode_b">99% of the 100 theorems have now been formalized in at least one system</span>. <br />
<br />
The project also serves as an informal benchmark for comparing major <span style="font-weight: bold;" class="mycode_b">interactive theorem provers and formal mathematics libraries</span>. It records which systems have formalizations for each theorem, including <span style="font-weight: bold;" class="mycode_b">HOL Light (95 theorems), Isabelle (92), Lean (82), Rocq/Coq (80), Metamath (74), Mizar (71), ACL2 (48), and ProofPower (43)</span>, among others. The aim is not to catalogue every existing proof but to show how broadly different proof assistants can handle substantial mathematics. In this sense, the project documents the remarkable growth of formal mathematics: results that traditionally existed only as human-readable arguments are increasingly being converted into completely machine-verifiable proofs, laying important foundations for computer-assisted mathematics and, increasingly, AI-assisted theorem proving. <a href="https://www.cs.ru.nl/~freek/100/" target="_blank" rel="noopener" class="mycode_url">[/url]<br />
<br />
[url=https://www.cs.ru.nl/~freek/100/]PROJECT</a>]]></description>
			<content:encoded><![CDATA[The <span style="font-weight: bold;" class="mycode_b">“Formalizing 100 Theorems”</span> project, maintained by mathematician and computer scientist <span style="font-weight: bold;" class="mycode_b">Freek Wiedijk</span>, tracks the progress of formalizing a well-known “Top 100” list of important mathematical theorems using computer proof assistants. A formalized theorem is not merely written as an ordinary mathematical proof: every definition, logical step, and inference is encoded in a rigorous formal language so that a proof-checking system can verify it mechanically. The list ranges from classical results such as the irrationality of &#36;\sqrt{2}&#36;, the Pythagorean theorem, and the infinitude of primes to much deeper results such as Gödel’s incompleteness theorem, the Prime Number Theorem, quadratic reciprocity, and the Fundamental Theorem of Algebra. According to the current project page, <span style="font-weight: bold;" class="mycode_b">99% of the 100 theorems have now been formalized in at least one system</span>. <br />
<br />
The project also serves as an informal benchmark for comparing major <span style="font-weight: bold;" class="mycode_b">interactive theorem provers and formal mathematics libraries</span>. It records which systems have formalizations for each theorem, including <span style="font-weight: bold;" class="mycode_b">HOL Light (95 theorems), Isabelle (92), Lean (82), Rocq/Coq (80), Metamath (74), Mizar (71), ACL2 (48), and ProofPower (43)</span>, among others. The aim is not to catalogue every existing proof but to show how broadly different proof assistants can handle substantial mathematics. In this sense, the project documents the remarkable growth of formal mathematics: results that traditionally existed only as human-readable arguments are increasingly being converted into completely machine-verifiable proofs, laying important foundations for computer-assisted mathematics and, increasingly, AI-assisted theorem proving. <a href="https://www.cs.ru.nl/~freek/100/" target="_blank" rel="noopener" class="mycode_url">[/url]<br />
<br />
[url=https://www.cs.ru.nl/~freek/100/]PROJECT</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Fermat's Last Theorem in Lean 4]]></title>
			<link>https://mklab.gr/showthread.php?tid=1850</link>
			<pubDate>Fri, 04 Sep 2026 22:58:40 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1850</guid>
			<description><![CDATA[Anthropic’s Fermat’s Last Theorem project is a large formalization of Fermat’s Last Theorem in Lean 4. It encodes the modern proof developed through the work of Frey, Serre, Ribet, Wiles, and Taylor–Wiles, showing formally that for integers &#36;n \ge 3&#36; and positive natural numbers &#36;a,b,c&#36;, the equation &#36;a^n+b^n=c^n&#36; has no solutions. The repository contains more than 60,000 Lean modules and nearly 30,000 formally stated theorems, together with an offline HTML interface for exploring the proof and its dependencies. Much of the Lean code was produced by AI agents building on existing human-written formal mathematics from projects such as Mathlib and the Imperial College London FLT project.<br />
<br />
The significance of the project is not that it introduces a new proof of Fermat’s Last Theorem, but that it makes the established proof machine-checkable at a very deep level. Anthropic reports verifying the result through a complete Lean build, the Lean comparator tool, and nanoda, an independently implemented Lean kernel written in Rust. The final theorem uses only Lean’s standard axioms and contains no unfinished proofs or unsafe shortcuts. The project therefore serves as an important demonstration of how AI can assist with the formalization of extremely advanced mathematics while leaving the Lean kernel responsible for checking the logical correctness of every step.<br />
<br />
<br />
<a href="https://github.com/anthropics/fermats-last-theorem" target="_blank" rel="noopener" class="mycode_url">PROJECT</a>]]></description>
			<content:encoded><![CDATA[Anthropic’s Fermat’s Last Theorem project is a large formalization of Fermat’s Last Theorem in Lean 4. It encodes the modern proof developed through the work of Frey, Serre, Ribet, Wiles, and Taylor–Wiles, showing formally that for integers &#36;n \ge 3&#36; and positive natural numbers &#36;a,b,c&#36;, the equation &#36;a^n+b^n=c^n&#36; has no solutions. The repository contains more than 60,000 Lean modules and nearly 30,000 formally stated theorems, together with an offline HTML interface for exploring the proof and its dependencies. Much of the Lean code was produced by AI agents building on existing human-written formal mathematics from projects such as Mathlib and the Imperial College London FLT project.<br />
<br />
The significance of the project is not that it introduces a new proof of Fermat’s Last Theorem, but that it makes the established proof machine-checkable at a very deep level. Anthropic reports verifying the result through a complete Lean build, the Lean comparator tool, and nanoda, an independently implemented Lean kernel written in Rust. The final theorem uses only Lean’s standard axioms and contains no unfinished proofs or unsafe shortcuts. The project therefore serves as an important demonstration of how AI can assist with the formalization of extremely advanced mathematics while leaving the Lean kernel responsible for checking the logical correctness of every step.<br />
<br />
<br />
<a href="https://github.com/anthropics/fermats-last-theorem" target="_blank" rel="noopener" class="mycode_url">PROJECT</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Prime Gaps at Most 186]]></title>
			<link>https://mklab.gr/showthread.php?tid=1809</link>
			<pubDate>Thu, 03 Sep 2026 22:50:11 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=1809</guid>
			<description><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #e86e04;" class="mycode_color"><span style="font-size: small;" class="mycode_size">New result by OpenAI on Prime gaps</span></span></span></div></blockquote>
<br />
Summary<br />
OpenAI’s <span style="font-weight: bold;" class="mycode_b">PrimeGaps186</span> repository presents a <span style="font-weight: bold;" class="mycode_b">Lean 4 formalization</span> of a result on bounded gaps between prime numbers, together with a Python program that checks the necessary numerical estimates. The target theorem is<br />
&#36;\liminf_{n\to\infty}(p_{n+1}-p_n)\le 186&#36;,<br />
meaning that <span style="font-weight: bold;" class="mycode_b">there are infinitely many pairs of consecutive primes whose difference is at most 186</span>. The proof proceeds by establishing the sieve-theoretic statement &#36;\mathrm{DHL}[40,2]&#36;: every admissible collection of 40 integer shifts has infinitely many translates containing at least two primes. An explicit admissible 40-element tuple of diameter &#36;186&#36; then yields the stated bound.<br />
<br />
The important qualification is that this is <span style="font-weight: bold;" class="mycode_b">not a completely self-contained formal proof of the prime-gap theorem in Lean</span>. The Lean development relies on <span style="font-weight: bold;" class="mycode_b">three explicit assumptions</span>. Two concern deep estimates for Kloosterman-type exponential sums, derived from established work by Deligne/Katz and Fouvry–Kowalski–Michel. The third consists of a substantial collection of numerical integral bounds. These results are mathematically known or computationally checked, but they have <span style="font-weight: bold;" class="mycode_b">not themselves been formally proved inside Lean</span>. The accompanying Python certificate recomputes the numerical part and verifies that the required bounds pass, but successfully running it does not eliminate the corresponding Lean axiom.<br />
<br />
What makes the project particularly interesting is its combination of <span style="font-weight: bold;" class="mycode_b">analytic number theory, rigorous numerical computation, and formal verification</span>. The Lean kernel has checked the logical deductions from the stated assumptions, and the numerical certificate provides an independently reproducible computational check. Thus the repository should be understood as a <span style="font-weight: bold;" class="mycode_b">conditional machine-verified formalization</span> of the bound &#36;186&#36;, rather than as a new unconditional proof of a previously unknown prime-gap result. It is also a useful example of how advanced mathematical arguments can be split into formally verified reasoning, literature-backed theorems, and certified computation.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Main result:</span> &#36;\liminf_{n\to\infty}(p_{n+1}-p_n)\le 186&#36;.<br />
</li>
<li>It formalizes the implication &#36;\mathrm{DHL}[40,2]\Rightarrow&#36; infinitely many prime gaps &#36;\le 186&#36;.<br />
</li>
<li>The Lean proof is <span style="font-weight: bold;" class="mycode_b">conditional on three explicit axioms</span>; therefore it is not yet a fully formalized end-to-end proof.<br />
</li>
<li>A Python certificate verifies the large numerical component independently.<br />
</li>
<li>The project illustrates a promising model for combining <span style="font-weight: bold;" class="mycode_b">AI-assisted/formal mathematics, Lean, numerical certification, and classical analytic number theory</span>.<br />
<br />
</li>
</ul>
<span style="font-weight: bold;" class="mycode_b">In simple terms:</span> the interesting achievement is not discovering that prime gaps can be bounded by &#36;186&#36;, but showing how a sophisticated prime-gap argument can be turned into a largely machine-checkable mathematical object, with the remaining unformalized assumptions clearly isolated.<br />
<br />
<a href="https://github.com/openai/PrimeGaps186" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></description>
			<content:encoded><![CDATA[<blockquote class="mycode_quote"><cite>Quote:</cite><div style="text-align: center;" class="mycode_align"><span style="font-weight: bold;" class="mycode_b"><span style="color: #e86e04;" class="mycode_color"><span style="font-size: small;" class="mycode_size">New result by OpenAI on Prime gaps</span></span></span></div></blockquote>
<br />
Summary<br />
OpenAI’s <span style="font-weight: bold;" class="mycode_b">PrimeGaps186</span> repository presents a <span style="font-weight: bold;" class="mycode_b">Lean 4 formalization</span> of a result on bounded gaps between prime numbers, together with a Python program that checks the necessary numerical estimates. The target theorem is<br />
&#36;\liminf_{n\to\infty}(p_{n+1}-p_n)\le 186&#36;,<br />
meaning that <span style="font-weight: bold;" class="mycode_b">there are infinitely many pairs of consecutive primes whose difference is at most 186</span>. The proof proceeds by establishing the sieve-theoretic statement &#36;\mathrm{DHL}[40,2]&#36;: every admissible collection of 40 integer shifts has infinitely many translates containing at least two primes. An explicit admissible 40-element tuple of diameter &#36;186&#36; then yields the stated bound.<br />
<br />
The important qualification is that this is <span style="font-weight: bold;" class="mycode_b">not a completely self-contained formal proof of the prime-gap theorem in Lean</span>. The Lean development relies on <span style="font-weight: bold;" class="mycode_b">three explicit assumptions</span>. Two concern deep estimates for Kloosterman-type exponential sums, derived from established work by Deligne/Katz and Fouvry–Kowalski–Michel. The third consists of a substantial collection of numerical integral bounds. These results are mathematically known or computationally checked, but they have <span style="font-weight: bold;" class="mycode_b">not themselves been formally proved inside Lean</span>. The accompanying Python certificate recomputes the numerical part and verifies that the required bounds pass, but successfully running it does not eliminate the corresponding Lean axiom.<br />
<br />
What makes the project particularly interesting is its combination of <span style="font-weight: bold;" class="mycode_b">analytic number theory, rigorous numerical computation, and formal verification</span>. The Lean kernel has checked the logical deductions from the stated assumptions, and the numerical certificate provides an independently reproducible computational check. Thus the repository should be understood as a <span style="font-weight: bold;" class="mycode_b">conditional machine-verified formalization</span> of the bound &#36;186&#36;, rather than as a new unconditional proof of a previously unknown prime-gap result. It is also a useful example of how advanced mathematical arguments can be split into formally verified reasoning, literature-backed theorems, and certified computation.<br />
<br />
<span style="font-weight: bold;" class="mycode_b">Key takeaways</span><ul class="mycode_list"><li><span style="font-weight: bold;" class="mycode_b">Main result:</span> &#36;\liminf_{n\to\infty}(p_{n+1}-p_n)\le 186&#36;.<br />
</li>
<li>It formalizes the implication &#36;\mathrm{DHL}[40,2]\Rightarrow&#36; infinitely many prime gaps &#36;\le 186&#36;.<br />
</li>
<li>The Lean proof is <span style="font-weight: bold;" class="mycode_b">conditional on three explicit axioms</span>; therefore it is not yet a fully formalized end-to-end proof.<br />
</li>
<li>A Python certificate verifies the large numerical component independently.<br />
</li>
<li>The project illustrates a promising model for combining <span style="font-weight: bold;" class="mycode_b">AI-assisted/formal mathematics, Lean, numerical certification, and classical analytic number theory</span>.<br />
<br />
</li>
</ul>
<span style="font-weight: bold;" class="mycode_b">In simple terms:</span> the interesting achievement is not discovering that prime gaps can be bounded by &#36;186&#36;, but showing how a sophisticated prime-gap argument can be turned into a largely machine-checkable mathematical object, with the remaining unformalized assumptions clearly isolated.<br />
<br />
<a href="https://github.com/openai/PrimeGaps186" target="_blank" rel="noopener" class="mycode_url">ARTICLE</a>]]></content:encoded>
		</item>
	</channel>
</rss>