You’ve heard about the 500-page proof that no one can understand. It’s been called a masterpiece, a fraud, and everything in between. And now, a team of mathematicians is trying to feed it into a computer to settle the debate once and for all.
But here’s the dirty secret no one is talking about: even if the computer says ‘yes,’ the argument won’t be over. It will just have moved to a new battlefield.
We’ve all been there. You read a paper, feel like you’re drowning in jargon, and wonder if you’re just not smart enough. But Mochizuki’s Inter-universal Teichmüller theory (IUT) is different. It’s not just hard; it’s famously opaque. Even top number theorists can’t agree on whether the proof of the ABC conjecture actually works. The frustration is real. The hope is that a machine—Lean, the proof assistant—can force clarity.
Project Lana is that attempt. It’s a formalization effort that aims to translate Mochizuki’s sprawling, 500-page, nearly impenetrable argument into Lean’s machine-checkable language. The idea is simple: if the computer can verify every step, the controversy dissolves. Right?
Wrong.
Formalization doesn’t prove a proof is true. It proves that a computer can follow the rules you gave it. The hard part—the part that can still be disputed—is whether those rules faithfully capture the original argument.
Think about it. The entire project hinges on human decisions: which axioms to use, how to encode Mochizuki’s conceptual framework, which definitions count as faithful. Those decisions are themselves contestable. The formalization might be impeccable, but if the translation is slightly off—if it imposes a structure Mochizuki never intended—then the computer’s thumbs-up means nothing for the original debate.
And that’s the twist most people miss. The controversy isn’t really about whether the math is right. It’s about whether the translation is faithful. The machine can’t judge that. It can only follow the rules you gave it. The most dangerous words in mathematics are ‘clearly’ and ‘obviously.’ Mochizuki’s proof is a monument to that danger.
So what happens when Project Lana finishes? Expect a celebration from formalization enthusiasts. Expect headlines like ‘Computer Finally Verifies Mochizuki’s Proof.’ But don’t expect the skeptics to fold. They’ll just ask a new question: ‘Is the formalization faithful?’ And that’s a question that no algorithm can answer.
This isn’t the end of a controversy. It’s the beginning of a new one—one that forces us to confront what we mean by ‘proof’ in an age of machine assistance. The computer can check consistency. It can’t check meaning.
FAQ
Q: If the computer says the proof is correct, does that settle it?
A: No. The computer only checks the formal version, not the original. The crucial question is whether the formalization is faithful to Mochizuki's intent. That's a human judgment call.
Q: What's the practical implication?
A: This project will force mathematicians to confront the limits of formalization. It shows that even with machine-checkable proofs, deep conceptual disputes can persist. The real work is in defining the axioms and encoding the ideas.
Q: What's the contrarian take?
A: Formalization is a distraction from the real issue: Mochizuki's theory is so alien that no one—including the formalizers—can be sure they've translated it correctly. The computer won't resolve that; it might just reveal the translation problem more starkly.