Harmonic
308 posts

Harmonic
@HarmonicMath
Building Mathematical Superintelligence

We are very happy that Emily Riehl @emilyriehl joined or little podcast #aboutlogic and talked about higher categories, synthetic mathematics, formalization and much more. youtu.be/4MQbd5wTlI8?si…

Happy to share that our paper “Mapping Uncharted Symmetries: Machine Discovery in Combinatorics” has been accepted to the ICML 2026 AI4Math Workshop. We study AI for discovery in algebraic combinatorics, with verification in @leanprover using @HarmonicMath’s Aristotle. 1/11

Oh and Kim Morrison used Claude + Aristotle + Codex to formalize the negation of the Erdos unit distance conjecture: github.com/kim-em/erdos-u… It's nice to see that this was built on top of PNT+; so despite the fact that we haven't been able to upstream it to Mathlib (the Residue Theorem we have in PNT+ is just for rectangles, and Mathlib will want a much more general version...), it's still useful in other applications!...




As we discussed with @VitalikButerin on our Fireside, formal verification is a big positive outcome from AI that will more than counterbalance the effects of AI finding new bugs. I am strongly supportive of math AI tools like Aristotle from @HarmonicMath driving this forward.


Today at the New York Number Theory Seminar, Wouter and Pietro were discussing their new paper. Really cool use of the AI-human feedback loop, with Aristotle as the main AI ingredient. I explained how I think formalization feels like doing the low-tech steps of algebraic geometry proofs with commutative algebra. You can have high-brow intuitions, but eventually one has to prove all the details. I wonder how this will evolve, but we are definitely at the level of assembly language being written by models like Aristotle. Tactics feel like the first glimpses of higher-level programming principles. The next step might be a more conversational style of working with the models. I am now working on a tighter integration of Lean with computer algebra languages. Stay tuned!



got a framed copy to hang by the ai team


Here's what András Sárközy, Erdős's most prolific collaborator, asked 25 years ago: "How small can one make the maximal gap between the consecutive elements of a multiplicative Sidon set selected from {1, 2, ..., n}?" In particular: does there exist a multiplicative Sidon set A ⊆ {1, 2, …, n} such that every sub-interval of [1, n] of length at least √n contains at least one element of A? The answer is yes. The solution was autonomously discovered and formally verified in #Lean by Aristotle. We then improved the bound below √n and Aristotle formalised our proof too.









Interesting update: a few days ago, Nathanson presented a talk at the New York Number Theory Seminar explaining how Aristotle solved some of his problems.


