Topic
Everything filed under Mathematics, newest first.
RSS · JSON · All topics
Chemistry is Actually Geometry
An essay arguing theoretical biologists should know Feinberg's Deficiency Zero Theorem, explaining how chemical reaction network theory turns questions about reaction dynamics into questions about the geometry of the network.
46 min · 10,553 words
A Linebender wiki survey of squircle curves, from Piet Hein's superellipse to alternatives like the Fernández-Guasti squircle, comparing their parametrization, measurement and curvature for graphics use. Licensed CC BY 4.0.
6 min · 1,304 words
Steinar H. Gunderson strongly solves the Norse Fox Game (halatafl): with perfect play the sheep win, even with 19 sheep (18 moving first), and 9 sheep can force a draw. He explains the bitboard representation and retrograde search behind his ~1000-line solver.
9 min · 2,096 words
The avalanche that hit math is coming for AI development
Dwarkesh Patel explains why he now expects superintelligence by 2030: the rapid AI-driven progress that hit mathematics is coming for AI research itself, with compute fleets able to run huge numbers of automated experiments.
39 min · 8,896 words
Advancing science & engineering with Antigravity's /teamwork
Google Research shares results from Antigravity's /teamwork multi-agent workflows, used with human experts to tackle long-open problems in mathematics, chemistry, systems software and ML engineering, and says the tools are being made available externally.
13 min · 3,076 words
“…and the proof is checked in Lean”
Kevin Buzzard explains how to interpret claims that a theorem is correct because it was checked in Lean, and which tests are needed when the Lean code is AI-generated, citing OpenAI's recent theorem dump.
8 min · 1,864 words
Lexifina describes formalizing parts of the US tax code in the Lean theorem prover and using formal search over the encoded rules to identify novel loopholes.
14 min · 3,161 words
The Stacks Project, formalized in Lean
Axiom releases a Lean formalization of the entire Stacks Project, the roughly 7,500-page open-source reference for modern algebraic geometry: about 16 million lines of code forming a single machine-checked library, with every declaration linked back to its Stacks tag.
8 min · 1,858 words
Fraction comparison trick revisited
John D. Cook revisits the result that a/b is usually greater than c/d when a + d exceeds b + c (with probability 11/12), restates it for uniform random variables on [0, 1], and extends it to the probability as a function of how much larger a + d is.
2 min · 371 words
Egoless Mathematics in the AI Era
A guest post on Terence Tao's blog by Karthik C. S., Amit Sahai and Jie Xue arguing that AI forces mathematicians to ask what gives mathematical work its worth, and making the case for an 'egoless' view centred on understanding rather than personal credit.
7 min · 1,646 words
Making peace with the projective plane
John D. Cook argues projective space and homogeneous coordinates feel arbitrary only when taught top-down, and shows how they arise naturally as the fix for practical problems with exceptional cases and points 'at infinity'.
2 min · 512 words
Wir müssen wissen – wir werden wissen
Remy Wang revisits Hilbert's programme, Gödel's and Turing's impossibility results and the rise of Lean, then argues that even as AI starts proving theorems, people must keep thinking for themselves rather than handing understanding over to machines.
4 min · 911 words
Mathematics has changed. Let’s act like it
A guest post by mathematician Frank Calegari on Terence Tao's blog arguing that after OpenAI's release of 700+ AI-written research papers, mathematicians should stop mourning and instead change how they hire, publish, referee and train students for a world where AI can make real contributions.
17 min · 3,877 words
Constructing a Quine from Kleene's Second Recursion Theorem
A walkthrough of formalizing Kleene's second recursion theorem from both classical and functional programming perspectives, then using the construction to build a working quine in untyped lambda calculus.
10 min · 2,293 words
Galactus the Devourer: Efficient algorithms, the Exponential Time Hypothesis, and losing the plot
Ben Recht traces how computer science never rigorously defined 'efficient' algorithms, from Jack Edmonds' 1965 digression through polynomial time and P vs NP to the Exponential Time Hypothesis, arguing complexity theory's scaffolding drifted away from the practical problems, such as industrial SAT solving, it was meant to describe.
6 min · 1,428 words
When AI Writes the Code, Who Proves It Works?
Ben Lorica interviews Lean creator Leo de Moura (AWS, Lean FRO) on how AI is making formal verification more accessible, why AI-generated code and autonomous agents need machine-checked specifications and proofs, verifying Rust, autoformalization, Mathlib, and what this means for engineers and mathematicians.
33 min · 7,503 words
Formalizing the Enormous Theorem
Axiom releases the first complete computer-checked Lean proof of the Classification of Finite Simple Groups, the roughly 15,000-page 'enormous theorem'. Over 24 days, its engineers and mathematicians directed swarms of AI agents that produced about 43.1 million lines of Lean, surfacing 34 notable deviations from the published record and a new group theory result.
18 min · 4,183 words
Working with academic communities to build scientific understanding
OpenAI announces AI-produced results in harmonic analysis (local smoothing and Kakeya in all dimensions), complexity theory (a claimed refutation of the Exponential Time Hypothesis) and quantum field theory (existence of QCD), and describes external expert-led collaborations to verify and explain them.
8 min · 1,739 words
oai-math-revised: a community hub for revising OpenAI’s math write-ups
A guest post on Terence Tao's blog by Abhinav Nellore, Johannes Schmitt, Soledad Villar and Rachel Ward announcing oai-math-revised, an open community GitHub effort to make OpenAI's published math write-ups easier to understand and better cited, and inviting mathematicians at every level to contribute and review.
1 min · 111 words
A Fix for Softmax and Cross-Entropy
Jonathan T. Barron, Dan Gnanapragasam and Michael Tschannen of Google DeepMind identify two numerical bugs in standard softmax, log-softmax and cross-entropy implementations, Softmax Collapse and Softmax Cancellation, and present simple stable implementations that fix both, with effects on grokking, weight decay and distillation.
26 min · 5,999 words