Mathematicians achieved a major breakthrough on a long-standing open problem in combinatorics known as the cap set problem.

What it means

The item reports that mathematicians, with AI assistance, have made a major breakthrough on the cap set problem, a long-standing open question in combinatorics. The problem asks how large a collection of points can be in a high-dimensional space built from three symbols if no three chosen points lie on a straight line; the exact growth rate of that maximum had resisted proof. The headline's 'AI solves' is a compressed way of describing an AI-assisted collaboration, not necessarily a fully autonomous machine proof.

Accuracy & sourcesGrounded

This is reputable secondary reporting (Scientific American and New Scientist) on a named primary source, presumably a research preprint or paper by the team behind the breakthrough; the existence of a claimed result is solidly sourced. The 'million-dollar/millennium' language in the linked headlines is loose, since the cap set problem is not one of the Clay Millennium Prize Problems, and the full scope of the result should be confirmed against the primary source.

How new

Reported on 8 September 2026, so this is genuinely new coverage, not a recirculation of older material.

Go deeper

• Scientific American
• New Scientist