An AI model provided the critical missing pieces for a formal mathematical proof that had stumped human researchers.
April 24, 2026
Original Paper
A Quadratic Lower Bound for Noncommutative Circuits
arXiv · 2604.20575
The Takeaway
This analysis uses Gemini 3.1 Pro to help prove a quadratic lower bound for a specific type of arithmetic circuit. While the math is highly technical, the implication is that frontier AI can now participate in high-level theoretical research. The AI didn't just write a summary. it generated the core logical steps needed to finish the proof. This marks a new era where computer-assisted math means the AI is doing the creative heavy lifting. It suggests that the next generation of mathematical laws will be co-authored by machines. Theoretical limits of computation are finally being mapped out with silicon help.
From the abstract
We prove that every fan-in $2$ noncommutative arithmetic circuit computing the palindrome polynomial has size $\Omega(n^2)$. The proof builds on and refines a previous work of the author. The new ingredients in the proof were generated by Gemini 3.1 Pro.