The Frontier

Ankur Moitra says OpenAI prompted thousands of problems and released roughly 700 results, with about a 10% success rate; the public release included positive solutions, leaving mathematicians unsure where AI’s limits lie.

Alex sees the sudden results as both disruption and opportunity, while Ankur Moitra worries that graduate students and postdocs have lost a reliable career blueprint. Stephen Brunton expects major uncertainty about whether AI will augment human work or displace it.

Ankur Moitra argues that mathematics means more than proving theorems: mathematicians build theories, explanations, and connections that help people understand why results hold. The doorman fallacy captures the risk of reducing a profession to its most visible task and automating that task alone.

Alex questions the idea that AI has reached a point where anything humans can solve with AI could be solved by AI alone. He says mathematicians value understanding, generality, and the ideas learned along the way, not merely a correct theorem or formal proof.

Alex describes AI’s quasi-Riemann result as a long chain of established techniques, while Ankur Moitra cautions against dismissing such work as mere recombination: existing methods may reach far beyond what humans have had time to explore. The release also changed which problems researchers consider worth pursuing.

Ankur Moitra says journals and referees were already strained before AI-generated research increased the verification burden. He favors new, possibly collaborative review models; Lean and Mathlib could support shared formal checking, reusable mathematics, and proofs whose specifications are explicit.

Alex says Anthropic produced a sorry-free Lean proof of Fermat’s Last Theorem, but the 13-million-line result is not yet a clean, Mathlib-quality proof. Alex estimates two or three people were involved, mostly encouraging the system to continue rather than supplying mathematical expertise.

Alex explains that the Riemann hypothesis predicts every nontrivial zero of the zeta function lies on the line with real part one-half. The quasi-Riemann result establishes a zero-free strip between seven-eighths and one; another proof reaches eleven-twelfths, but neither method reaches the full hypothesis.

Alex says primes are the basic factors of whole numbers, and their distribution remains mysterious even if the Riemann hypothesis is true. He values proofs for the explanation they provide, not just the truth of a statement; the prime number theorem corresponds to the absence of zeta zeros on the line with real part one.

Ankur Moitra says the unique games conjecture would organize approximation algorithms by identifying optimal hardness for many constraint-satisfaction problems. Human work, including the two-to-one games theorem, had established a path toward the conjecture before AI supplied a proof.

Ankur Moitra explains that factoring large integers underpins widely used public-key cryptography, while a polynomial-time factoring algorithm would threaten e-commerce and secure communications. He stresses that complexity theory’s hardness claims are usually worst-case guarantees, even though many practical instances are easier.

Ankur Moitra says satisfiability is easy to verify once someone supplies an assignment, but finding one is presumed hard; researchers still lack superlinear lower bounds for SAT. Practical SAT instances can nevertheless be easy, and worst-case analysis may miss the structure that makes them solvable.

Stephen Brunton says the Navier-Stokes result proves finite-time blow-up under smooth external forcing in three dimensions, using a specially orchestrated vortex. He says the construction is nonphysical and leaves practical fluid prediction and engineering design essentially unchanged.

Stephen Brunton says turbulence is hard to predict because motion across large, medium, and small scales all affects outcomes such as lift and drag. He sees major engineering value in finding compact coordinates for turbulent flows; better prediction could benefit aircraft, hearts, turbines, transportation, energy, and health.

Stephen Brunton says insects control flight without full flow-field measurements, using strain-sensitive neurons on their wings to respond to gusts. Ankur Moitra connects natural systems to computation: biological solutions can reveal how uncertainty, limited information, and robust strategies shape what an effective model must capture.

Ankur Moitra describes subliminal learning: a model prompted to favor owls can transfer that preference through random-number outputs to another model trained on those numbers. He links the effect to concepts encoded in overlapping directions, creating unintended behavioral spillovers during fine-tuning.

Alex argues that formal proof engineering and communicating mathematical insight are different tasks; future papers may pair Lean verification with clearer explanations of the ideas and reasoning. He says AI can help readers enter unfamiliar fields, but students still need curiosity, judgment, and the ability to challenge answers.

Alex says mathematics has repeatedly rebuilt itself after foundational crises, including 19th-century disputes about limits and infinity. Stephen Brunton sees mathematics as both invented and discovered: people create useful formalisms, then uncover compact structures that describe the world.

The sponsor messages promoted Whisper Flow for voice dictation, Finn for customer-service agents, Element for electrolytes, Blitzy for large codebases, Shopify for online stores, NetSuite for business management, and Perplexity for knowledge exploration.