← Latest papers
🔢 mathematics

Varieties with representable CH_0-group and a question of Colliot-Thélène

This paper answers a question posed by Colliot-Théline by constructing a smooth projective variety with a representable CH₀-group that lacks a universal 0-cycle, utilizing a counterexample to the integral Hodge conjecture provided by Benoist and Ottem.

Original authors: Claire Voisin

Published 2026-07-08
📖 5 min read🧠 Deep dive

Original authors: Claire Voisin

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to organize a massive, complex party where every guest represents a specific point on a geometric shape (a "variety"). Mathematicians have long been trying to figure out if there is a perfect, universal "guest list" or "seating chart" that can describe how these points relate to each other in a specific, organized way.

This paper, written by mathematician Claire Voisin, solves a puzzle that another mathematician, Jean-Louis Colliot-Thélène, had been wondering about for a while.

Here is the breakdown of the story, the problem, and the solution, using simple analogies.

The Main Characters and the Goal

1. The "Albanese Map" (The Party Organizer)
Imagine your geometric shape is a huge, complex building. The "Albanese map" is like a special elevator system that takes any point in the building and sends it to a central "control room" (called the Albanese variety). This control room is a very organized, smooth space (like a torus or a donut shape) that captures the essential "loops" and connections of the building.

2. The "Universal 0-Cycle" (The Perfect Guest List)
Mathematicians want to know: Is there a single, perfect "guest list" (a mathematical object called a universal 0-cycle) that lives in the control room? If this list exists, it means you can take any location in the control room and use this list to perfectly reconstruct a corresponding set of points back in the original building. It's like having a master key that can unlock any specific configuration of guests.

3. The "Representable CH0-group" (The Organized Crowd)
Sometimes, the crowd of points in the building is so well-behaved that the elevator system (the Albanese map) is a perfect one-to-one match. Every point in the control room corresponds to exactly one unique group of points in the building, and vice versa. When this happens, we say the group is "representable."

The Big Question

For a long time, mathematicians knew two things:

  1. Some buildings have a "perfect crowd" (representable group).
  2. Some buildings do not have a "master guest list" (no universal 0-cycle).

But they didn't know if these two things could happen at the same time.
The Question: Can you have a building where the crowd is perfectly organized (representable), but you still cannot find a single master guest list (no universal 0-cycle)?

Most people suspected the answer was "No." They thought that if the crowd was organized enough to be representable, a master guest list must exist.

The Solution: A Counter-Example

Claire Voisin says: "Yes, it is possible."

She constructs a specific, 3-dimensional geometric building (a "threefold") that breaks the rule.

  • The Crowd: The points in this building are perfectly organized. The elevator system works flawlessly (the group is representable).
  • The Missing List: Despite this perfect organization, there is no master guest list that can describe all the points at once.

How She Built It (The Recipe)

To build this strange building, Voisin used a clever recipe involving two other shapes:

  1. A K3 Surface: Think of this as a very complex, flat, 2D sheet with a special symmetry (like a pattern that repeats but flips).
  2. An Elliptic Curve: Think of this as a simple loop or a donut shape.

She took these two shapes, twisted them together, and then applied a "folding" operation (a mathematical symmetry) that glued certain parts together. The result is a new 3D shape.

Why does this shape have no master list?
The proof relies on a deep connection to a famous unsolved problem in math called the Integral Hodge Conjecture.

  • Imagine trying to build a wall out of specific bricks. The Hodge Conjecture asks: "If a wall looks like it's made of bricks (mathematically speaking), is it actually made of bricks?"
  • In Voisin's example, the "wall" (the geometry of the shape) looks like it should be buildable with bricks, but it turns out it's impossible to build it using the specific "bricks" (algebraic cycles) available.
  • Because the "bricks" don't fit together to form the wall, the "master guest list" (the universal 0-cycle) cannot exist, even though the crowd is otherwise perfectly organized.

The "Index" Clue

The paper also discusses a concept called the "index."

  • Imagine you are trying to cover a floor with tiles. If the floor is 10 feet wide and your tiles are 1 foot wide, you need 10 tiles. If the floor is 10 feet wide and your tiles are 3 feet wide, you can't cover it perfectly without cutting them.
  • In Voisin's example, the "tiles" (the geometric pieces she uses to build the list) don't fit the "floor" perfectly. The "index" is 2, meaning there is a slight mismatch that prevents the creation of the universal list.

The Takeaway

This paper proves that perfect organization does not guarantee a master key.

Voisin showed that you can have a geometric world where the points are perfectly mapped to a control center, yet the fundamental "blueprint" (the universal 0-cycle) required to reconstruct those points from the center simply doesn't exist. This answers Colliot-Thélène's question with a definitive "Yes, such a thing exists," and it does so by using a counter-example to a deep theory about how shapes are built from smaller pieces.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →