Abstractions blog

Graced With Knowledge, Mathematicians Seek to Understand

A landmark proof in computer science has also solved an important problem called the Connes embedding conjecture. Mathematicians are working to understand it.

Is there always a way to approximate the infinite photons in a beam of light with a finite array of numbers?

Imagine aliens landed on Earth and handed us certifiably correct answers to our most pressing questions: Does God exist? Is the Riemann hypothesis true? Did Oswald act alone?

We’d appreciate the info, but it wouldn’t be really useful if we didn’t know how they got their answers.

This is the situation in which mathematics now finds itself. In January, a team of computer scientists posted a sweeping proof that has been hailed as one of the top results in its field this century. Yet the proof went far beyond computer science. Through a long chain of implications, it also solved a major open problem in mathematics.

Mathematicians — in the field of operator algebra, where the problem occurs — are now like those earthlings, graced with knowledge from afar. Computer science has told them that a conjecture they care about is false. But to do anything useful with the information, they need to find a way to translate the proof into a language they can understand.

“If more people in the operator algebra community had been paying attention to this for the last couple years, the community as a whole might be closer to digesting this result,” said Vern Paulsen, a mathematician at the University of Waterloo in Canada. “We have a lot of catching up to do.”

The Conjecture

The mathematical problem is the Connes embedding conjecture, posed in 1976 by Alain Connes of the Institute of Advanced Scientific Studies in France. It has to do with certain numerical objects that arise in the mathematics of quantum mechanics.

First, consider a simpler scenario. Picture a ball tossed through the air. You need three numbers to specify its position along the x, y and z axes of space. By plugging those numbers into equations, you can model the ball’s trajectory.

OK.

Now imagine you want to mathematically describe a beam of light. This is a quantum mechanical system that mathematicians and physicists describe by plugging square arrays of numbers into equations. These arrays, called matrices, play the role of the numbers in the ball example: They contain all the information needed to describe the beam of light’s position.

But while a mere three numbers suffice to describe the ball, the matrices that describe the beam of light are huge: They contain infinite rows and columns of numbers.

Why so many? Because a beam of light is really a stream of photons.

One way to think about it is to build up a model from individual photons. A beam of light with a single photon can be described by a 2-by-2 matrix whose numbers represent the photon’s “angle of vibration,” a measurement that roughly corresponds to its direction of travel. A beam with twice as many photons — two — requires a 4-by-4 matrix. Three photons need an 8-by-8 matrix. Four photons take a 16-by-16 matrix, and so on, with the number of rows and columns increasing by a power of 2 each time you add a photon.

So if you eventually work your way up to the entire beam of light, how big a matrix will you need to describe it? That depends on how many photons the beam contains — and quantum mechanics considers the beam, in one sense, as a wave containing an unlimited number of photons.

“You need to think of it as an infinite stream,” Paulsen said. That beam would require a matrix with an infinite number of rows and columns to describe it. The mathematician and polymath John von Neumann initiated the study of the infinite-dimensional matrices that arise from quantum mechanical systems in the 1930s.

Four decades later, Connes built on this work. He proposed a systematic way of thinking about the infinite-dimensional matrices that describe a system like a stream of photons, conjecturing that they can be built in an orderly way from smaller, finite-dimensional matrices.

Photo showing Alain Connes working in an office

The mathematician Alain Connes came up with a rigorous way to approximate matrices of infinite dimensions, but it doesn’t always hold true.

©️ Jérome Chatin / CNRS Photo library

You can think of it like this.

Imagine you have a flat map of Earth’s surface, and you want to know the temperature everywhere. You could take a thermometer reading at each of the infinitely many points on this map. Then you could represent those readings by constructing a matrix with an infinite number of rows and columns.

But that’s a lot of work. So now try for a cruder approximation: Divide the map into four quadrants and calculate the average temperature in each quadrant. You could represent this information in a simple 2-by-2 matrix.

Let’s say you want to do a little better. Divide each quadrant into quadrants. Now you have 16 areas in all. Calculate the average temperature in each, and represent that information in a 4-by-4 matrix. You could keep going like this, dividing quadrants into quadrants and representing the average temperature of the quadrants as matrices with a larger and larger — but still finite — number of rows and columns.

Now, for each finite-dimensional matrix, you could ask yourself: How well does it approximate the temperature readings in the infinite-dimensional matrix? With the 2-by-2 matrix, for example, you might hope that the average temperature for a quadrant is within 10% of the actual temperature at each point within that quadrant. The 4-by-4 matrix is slightly more refined, so you might hope to do a little better, maybe getting within 9% of the actual temperature at each point.

The Connes embedding conjecture has a similar flavor. But instead of temperature readings on a map, it has to do with the matrices that describe quantum mechanical systems like the beam of light.

Connes predicted that knowing the behavior of the system at a simplified level — the 2-by-2 matrix version — always allows you to approximate the behavior of the entire system within some margin of error. That error shrinks as the size of the matrix increases. As you add photons and expand the size of the matrix, you creep ever closer toward the infinite-dimensional matrix that really describes what’s going on with the beam of light.

Proved False

But the new result from computer science proves that Connes’ prediction is false. This means that while the approximation scheme works for some infinite-dimensional matrices describing quantum mechanical systems, it doesn’t work for all of them.

“His conjecture predicted that knowing enough info about each subsystem was enough information to describe the whole system, to some error bound,” Paulsen wrote in an email. “Now we know that it is not.”

The failure of the Connes embedding conjecture has several implications for mathematics. The first is the point above, that not all infinite-dimensional matrices can be well approximated by finite-dimensional matrices.

The second implication is that there must exist families of infinite-dimensional matrices that mathematicians don’t know about. Connes predicted that all families of infinite-dimensional matrices can be well approximated by finite-dimensional matrices, and so far, that’s always been the case. The new proof establishes that this approximation scheme doesn’t always work, but it doesn’t actually identify any specific families of matrices that deviate from it. So now mathematicians have to go and find ones that don’t work.

The ripples go in other directions, too. A number of other conjectures were tied to the Connes embedding conjecture: If it were true, as many mathematicians assumed it was, those other problems would automatically be true, too. But since it’s false, those other conjectures are now more uncertain than ever. And mathematicians have neglected them up until now.

“This really kept people from working on these problems. But now the game is once again afoot,” Paulsen said.

Before mathematicians can pursue any of these implications, however, they need to understand the computer science result that triggered them. It won’t be easy. The new proof is a sprawling 165-page work developed over several years and rooted firmly in the theory of computation, not operator algebra. As Quanta recently explained, it harkens back to Alan Turing’s early theory of computation and also draws on quantum entanglement and those funny quiz-show-type contests called nonlocal games. Much of this is foreign to mathematicians.

“If you haven’t been paying attention to the last two years,” Paulsen said, “then it’s pretty flabbergasting that [these methods] solved Connes, which is a question about matrices.”

Mathematicians are now attempting to read the paper themselves. The ones who understand it are organizing seminars to teach it to others. The five computer scientists who wrote it have also been planning lectures to explain their work to the mathematical community.

Eventually mathematicians will absorb the new result and likely find ways to rearticulate it in the language of their field. But human civilization wouldn’t adjust to a jolt of extraterrestrial insight overnight. Mathematics won’t, either.

“It’s going to take some time,” Paulsen said.

Comment on this article