Pure Mathematics: The Next Chess?

Will AI turn theorem proving into an intellectual game? 

For centuries, chess was regarded as one of the highest expressions of human intelligence. Great chess players were admired for their extraordinary powers of logical reasoning, imagination and strategic thinking. Then came computers. In 1997, IBM's Deep Blue defeated world chess champion Garry Kasparov. Today, ordinary chess engines play far beyond the level of any human grandmaster. Chess survived, but something fundamental changed. Being the world's strongest chess player no longer meant being the world's strongest chess-playing intelligence.

Could pure mathematics now face a similar transformation? It has traditionally been regarded as an even higher form of intellectual achievement than chess. Unlike chess, mathematics has played a fundamental role in the development of science and civilization. But here we must distinguish applied from pure mathematics. Applied mathematics develops methods for understanding, predicting and controlling the physical world. Newton's calculus, Fourier's analysis and modern numerical computation exemplify this tradition. Their ultimate value lies in what they make possible. Pure mathematics, by contrast, investigates abstract structures and logical relationships without requiring applications. Its achievements are judged primarily within mathematics itself. 

During the twentieth century, pure mathematics increasingly developed a culture centered on solving difficult problems. Fermat's Last Theorem, the Poincaré conjecture and the Clay Millennium Problems became celebrated intellectual challenges. The resemblance to chess is striking. Both activities operate within precisely defined logical frameworks. Both reward extraordinary ingenuity. Both have hierarchies of increasingly difficult problems. Both celebrate champions who succeed where others have failed. 

But is solving a difficult mathematical problem necessarily more intellectually significant than winning a difficult chess game? The answer depends on whether the mathematical achievement reveals something fundamentally new or merely overcomes a formidable technical obstacle. A profound mathematical concept may transform our understanding of an entire field. A difficult proof may simply establish the truth of a previously formulated conjecture. The distinction is between creating new understanding and demonstrating exceptional problem-solving ability. 

Now AI enters the mathematical arena. Just as computers surpassed human chess champions, AI may eventually surpass human mathematicians in proving difficult theorems. If that happens, the production of proofs may become increasingly routine. A mathematical conjecture could become something like a chess position: a challenge presented to a machine capable of finding the solution. The prestige attached to solving difficult problems would then face the same challenge that confronted competitive chess. Yet mathematics has something chess does not necessarily possess: the possibility of discovering entirely new structures and connections, both within mathematics and with the physical world. 

Perhaps this is where its future lies. The central question will no longer be who can prove the most difficult theorem, but who can formulate the most illuminating mathematical ideas. Chess did not disappear when computers became superior players. It became a game in which humans increasingly learn from machines. Pure mathematics may follow a similar path. 

There is, however, a fundamental distinction. Chess has objective rules for winning, but no claim that winning contributes to understanding reality. Pure mathematics has objective rules for proving, but the significance of what is proved requires a separate judgment. A chess victory is meaningful within the game. A mathematical proof establishes a truth within a mathematical framework, but its importance cannot be measured by proof difficulty alone. 

If pure mathematics increasingly rewards the conquest of difficult problems without asking what new understanding they bring, it risks becoming an intellectual sport governed by its own rules of prestige. AI may now expose this weakness by making increasingly sophisticated theorem proving a machine activity. 

Perhaps the greatest contribution of AI to pure mathematics will not be the theorems it proves, but forcing mathematicians to confront a question long overshadowed by the celebration of difficult proofs:

• What makes a mathematical theorem worth proving?