Associate Professor of Math & Statistics at UAlbany-SUNY

Albany, New York, USA
Joined November 2009
Today I was trying to give a good, geometric proof of the Loomis-Whitney inequality. It states that for a measurable subset E in R^d, vol(E)^d-1 is bounded by the product of areas of the projections of E to the d coordinate hyperplanes. A very simple corollary of this inequality is the Euclidean isoperimetric inequality with non-sharp constants in every dimension, because area of the projection can be compared upto a factor of 2 with the area of the boundary of E.
6
8
1
100
8,701
Also burnt out on the lamentations of the old. The “joy” of being stuck for months or years *for no good reason* needs to be tucked in for a long nap. We will get stuck on new things and mechanistic interpretability is one of those things! Going further, one of the incidental reminders I gleaned from the Harvard Summit write-up is that math has always been the science of abstraction. With AI, things are going to get a lot more abstract! There are lots of opportunities for research and we need all hands on deck.
I am back with a few thoughts. I stopped reading all the trauma logs of mathematicians who recently got impacted by AI. Instead I switched to building a corpus of knowledge for why and how AI is interacting with mathematics. I teach this term a new course here at Adam Mickiewicz University. It's title is "Computer assisted solutions to mathematical problems". I proposed it because I realized in the last 6 months something important. A. It makes no sense to grieve the "good old ways". We should study to the bone how mathematics and computers interact. There are three levels: numeric, symbolic and formal. B. The only way to prepare yourself for the rise of the technology is to understand it well. You cannot understand the progress of AI in mathematics if you don't know how the models are trained on the symbolic representation of mathematical proofs, how the training goes, why specific transformer architectures, reinforcement learning and basically a huge amount of incredible insights gives in practice some new value in mathematics. C. It is incredibly fun to train your own models (yes I use generative models to help me build training pipelines too, otherwise I would not have enough lifetimes to do so). D. The AIxMaths space is so incredibly complex - you have these weird, scalable token generating algorithms, recently in agentic form with memory, interactions etc. This is a field of study - we need to understand how it works. On the other hand, mathematics as a field of science is incredibly complex, people do very different kinds of axiomatic theories with their intuitions, tactics and strategies. This was never studied too seriously as a whole. We need to study it deeply. So I am spending this term gearing up my students and myself for whatever is coming. We don't have any assumptions. I don't claim that models will become better at maths than all of human mathematicians. I don't think it's a good question. We just want to stay in the loop with the developments and see whether we can contribute to the change and see if this can be useful and productive. I am looking forward to your feedback. The current plan contains the following topics: - basic distinction between numerical computation, symbolic calculations and formal proofs - basic understanding of the IEEE 754 standard and things around numerical computations - how to build your own computer algebra system in Python and why it's so tricky - why and how proof-checking software is important; we start with the basic principles of such designes, I plan to talk first about the foundations going back to Automath and the foundational work of de Bruijn. - practical examples spanning real use cases of computer algebra, numerical integration and proofs in Peano arithmetic and how to read languages like Lean - in the end I want to present some little post-trained models like Qwen which I taught how to do Peano arithmetic better and how they prove statements about this theory; there will be AlphaGeometry too and maybe a bit more about Mizar, Metamath and Lean. Just to give students some scope and perspective. I plan to continue working on this course into a full book. I think I won't stop until I understand deeply why language models are currently so good at maths. It's something of utmost importance. It's important to see where this might stop and what lies beyond. I personally think these kind of questions will be the most important problems to answer by mathematicians themselves. We shouldn't stop until we find good answers to all of this. Reading AI slop is perhaphs a bit useful, but deep understanding of why it sometimes makes sense is even more challenging.
4
1
10
557
Justin Curry retweeted
This playlist on is meaning created, given, or revealed by Billy Clark is an engaging watch on the different approaches through which we can make sense of our lives: youtube.com/watch?v=Y4hphh9L…
1
1
8
589
Yessss… my ideal pathway for proving the 4-color theorem, as outlined by Kronheimer-Mrowka. Thanks for the link @nihilunbounded ! “We use SO(3) gauge theory to define a functor from a category of unoriented webs and foams to the category of finite-dimensional vector spaces over the field of two elements. We prove a non-vanishing theorem for this SO(3) instanton homology of webs, using Gabai's sutured manifold theory. It is hoped that the non-vanishing theorem may support a program to provide a new proof of the four-color theorem.”
Thanks for the question! I don't think about the four color theorem; I try not to comment on things I don't understand (although a proof along the lines of Kronheimer-Mrowka would be awesome; see arxiv.org/abs/1508.07205) But in general I think (and of course, sinxe I am a nobody, you can vehemently disagree) a proof should be redefined to be something that brings insight and understanding, and not (just) a verifiable collection of symbols that lead to a certain truth value of the original statement. This may require overturning a century and a half of mathematician's conception of what constitutes a proof, but I think it is a worthwhile endeavour (and I also think the alternative is paperclip universe where LLM slop rules math and very few people understand wtf is going on). I think a computer assisted proof can do that (eg I have used SnapPy before). I think some nontrivial amount of rich mathematics is lost in this great project to pin down mathematics to the domain of dry formalism. This is most noxiously evident in LLM proofs with an autoformalized Lean certificate.
1
5
1
45
4,885
"The Linear Algebra Behind Google" is a short paper that explains the mathematics behind Google's original PageRank algorithm. The paper covers eigenvalues and eigenvectors, stochastic matrices, Markov chains, and iterative methods, using numerical examples and graphs to illustrate how PageRank works. Beyond the algorithm itself and the original paper by Larry Page and Sergey Brin, this is an interesting read for anyone curious about how linear algebra applies to one of the most influential algorithms in the history of the web. sites.cs.ucsb.edu/~gilbert/c…
29
237
14
1,670
58,566
This AI acknowledgement takes the win. From this paper: arxiv.org/pdf/2610.27918.
12
67
4
719
80,306
Exactly! I have seen so many cases of AI psychosis where one person + LLMs drift on their own raft away from consensus reality. This shows the need for conferences and shared human space more than ever, where consensus building will hopefully occur… However, inter-human alignment has always been a struggle. The lone traveler will be viewed with increased suspicion.
increasingly concerned that ai is revealing the mathematical world as negatively curved. instead of everyone wandering about in idea-space and clustering around the same famous conjectures (local positive curvature), ai is pushing out the boundaries rapidly and revealing that the space of mathematical ideas is ~hyperbolic (negative curvature). though this means there's lots left to discover, it also means that small separations between people/agents will lead to wandering alone. we may be emerging into an idea-space where there's so much to see and do but everyone is alone in a private heaven, unable to share their subtle joys with others...
2
360
Justin Curry retweeted
I’d like to recommend this piece by Sartre. I guess we all think we write because we want to know that we mean something in this world. That we spotted something that had eluded us and gave it expression. Sartre removes that from us. We uncover things about our world we didn’t++
4
422
12
2,826
45,196
Just spotted this. Many thanks to Proofs & Prompts for the shoutout in their newsfeed.
2
5
1
101
2,784
Sad. “According to First Proof, every one of the open-weight submissions contained major errors.”
It's happening. We're finally moving from the artisanal, bespoke world of chalkboard mathematics to large-scale industrialization in the mathematical sciences. current.fas.harvard.edu/stor…
1
19
3,723
Justin Curry retweeted
Conley Index🤝 Flow Categories Landfall Geometry arxiv.org/abs/2610.30993 Joint with Frances Kirwan!
Landfall Geometry Frances Kirwan, Vidit Nanda arxiv.org/abs/2610.30993 [𝚖𝚊𝚝𝚑.𝙰𝚃 𝚖𝚊𝚝𝚑.𝙳𝚂]
3
9
34
2,657
Justin Curry retweeted
Pope Leo: “We live in a performance-driven culture that constantly compares and ranks people, sometimes ruthlessly” and a “misguided understanding of meritocracy ultimately fails to respect people.” vaticannews.va/en/pope/news/…
17
333
39
1,700
54,638
Albany-Troy grew /slightly/ faster than the national average!
U.S. city metro areas with over 500,000 people.
233
Justin Curry retweeted
A new NPR investigation has found a troubling problem in AI-generated mathematics. Cambridge mathematician Anders Hansen identified a discrepancy between an AI-generated proof and its Lean formalization. A constant had changed from 4 to 5, making the formally verified statement weaker than the original claim. The Lean verification itself was not necessarily incorrect. The concern is that it may have verified something different from what the original mathematical argument asserted. The report also features Daniel Litt, who identified an error invalidating a separate AI-generated paper, and Dana Moshkovitz, who discusses a proposed solution to the Unique Games Conjecture. The investigation highlights a distinction that is becoming increasingly important: verifying a formal proof is not enough unless the formal statement faithfully represents the intended theorem. Source: NPR, 21 October 2026 (US), 22 October 2026 (IST).
13
32
9
146
28,107
Justin Curry retweeted
Act only according to that maxim whereby you can at the same time will that it should become ... a global section of the law sheaf. events.blackthorn.io/en/2Eo1… h/t Dave Anderson
1
3
258
Etingof’s figures in this 22-page essay on “Mathematics of the Future” are unhinged! dropbox.com/scl/fi/zmqzdrney… Here’s two of them.
5
2
24
3,478
Justin Curry retweeted
In 1852, Ludwig Schläfli proved that above four dimensions only three regular shapes can exist. The paper sat unpublished for 34 years - too far ahead of its time. Two dimensions have infinitely many regular shapes. Three have five. Four have six. Then the universe hard-codes exactly three forever - and every LLM embedding space and every quantum chip operates in the dimensions where this permanent pattern lives. The reason five platonic solids exist and not six is pure angle arithmetic. Stack regular polygons around a shared corner - sum below 360 degrees and you get a valid 3D corner, hit exactly 360 and you get a flat tiling, exceed it and the surface warps like a potato chip. Triangles give three valid solids, squares one, pentagons one. In four dimensions the same logic produces six polytopes - including the 600-cell with 600 tetrahedral faces and 1152 symmetries. Above four dimensions only three families survive: the simplex, the hypercube, and the cross-polytope. The hypercube tiles n-dimensional space the way cubes tile 3D - the same structure indexing positions across every transformer attention grid today. 25 minutes. Bookmark & watch today. The sequence 5, 6, 3, 3, 3, 3 and the geometry behind every dimension your model operates in.
21
111
5
715
23,211
Justin Curry retweeted
Over the past year, the Discovery team at @GoogleDeepMind, in a project led by student researcher @dsantosmarco, has made new discoveries in one of the most beautiful open problems at the edge of computation: Finding the 6th Busy Beaver (BB) number. While most AI math systems solve human-generated problems, like theorems, this work tackles a different aspect of mathematical creativity: Discovering hidden problems. For years, the BB Community has pursued one of theoretical computer science’s most captivating collaborative quests: finding the simplest programs that run the longest before halting. Because determining whether these programs ever stop is uncomputable, no universal algorithm can solve it, meaning new mathematical techniques need to be found and invented to make progress. In this way, the BB challenge serves as an open ended domain for mathematical creativity and, in particular, a generator of hard math problems called Cryptids. These are tiny programs whose halting behavior is governed by and equivalent to deep, unsolved math problems in number theory, similar to the Collatz or Goldbach conjectures. Historically, the BB community had recognized ~20 Cryptids in BB(6), and the best problems were selected for the Busy Math Olympiad (BMO). Building on their work, Marco built a pipeline powered by Gemini 4 Argon that: 1️⃣ Simulates raw Turing machine traces to compress recurring patterns. 2️⃣ Conjectures mathematical transition rules & runs synthetic experiments to test edge cases. 3️⃣ Proves the equivalence formally in Lean 4.

Using this pipeline, Marco and the team discovered 20 new potential Cryptids and verified 33 more machines previously studied in the BB community. All the proofs were open sourced and shared in the community discord channel and we hope that they will help the community to make progress towards resolving BB(6). We also contributed related halting/non-halting proofs directly to the community GitHub repository. Finding these Cryptids shows hidden links between simple programs and number theory, and helps mathematicians map the limits of computation. I'm also excited about Gemini 4 Argon's ability to help researchers both solve hard problems and accelerate scientific discoveries, of which Busy Beaver is just one example. Work led by our student researcher @dsantosmarco with paper contributions from @vivek_veeriah, @Dahoas1 , Andrew Bolt, @zuza777 , Satinder Singh, and myself with additional contributions from Hussain Masoom, @maxencefaldor , @MoritzFirsching and Petar Sirkovic. Read more about it in our paper: arxiv.org/abs/2610.22603
30
76
19
533
50,975
Love the last slide! “What would change if we evaluated systems by how well they cultivate curiosity, judgment, and learning in people?”
Learn about the forgotten history of IA (not AI): What would change if we evaluated systems by how well they cultivate curiosity, judgment, and learning in people?
2
455