An Exact Counterexample to Carlson's Associated-Prime Depth Conjecture from a Group of Order 128
This paper refutes Carlson's 1995 conjecture that the depth of a finite group's cohomology ring is always realized by an associated prime, by constructing an explicit counterexample using a specific group of order 128 where the depth is 2 but no associated prime of dimension 2 exists.
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
The Detective Work of Mathematical Shapes
Imagine you are a detective trying to solve a mystery inside a giant, invisible city made entirely of numbers and shapes. This city is called "Group Cohomology," and it's a place where mathematicians study the hidden patterns of symmetry in finite groups—think of a group as a set of rules for how objects can be shuffled or rotated without breaking them. In this city, there are two very important clues that help detectives understand the layout: "depth" and "associated primes."
Think of depth as the height of a sturdy ladder you can build inside the city. To build a rung on your ladder, you need to find a special number that doesn't cause the whole structure to collapse (a "non-zero-divisor"). The deeper the ladder, the more stable and complex the city is. On the other hand, think of associated primes as the specific addresses of the city's weakest spots or "dead ends." These are the locations where certain numbers get stuck and can't move forward.
For a long time, mathematicians had a hunch, a rule of thumb called Carlson's Conjecture. They believed that the height of your ladder (the depth) would always match the size of the smallest dead end (the dimension of an associated prime). It seemed logical: if you can build a ladder of height 2, there should be a dead end exactly 2 units wide. But in the world of math, hunches are just guesses until someone proves them true or finds a single exception that breaks the rule.
The Great Counterexample
This paper is the story of a team of mathematicians who decided to test that hunch by building a very specific, tricky city and seeing if the rule held up. They chose a group called SmallGroup(128, 859), which is a collection of 128 elements, and they looked at it through the lens of a field called F2 (a number system with only two values, 0 and 1).
First, they did the hard work of measuring the "ladder height" of this group. Using precise algebraic tools, they proved that the depth of this group's cohomology ring is exactly 2. This means you can build a ladder with two rungs, but no more.
Next, they had to check the "dead ends." According to the old rule (Carlson's Conjecture), there should be a dead end that is exactly 2 units wide. To find this, they used a clever mathematical bridge discovered by a researcher named Okuyama. This bridge said: "If there is a dead end of width 2, there must be a specific type of smaller group inside our city—a 'rank-two elementary abelian subgroup'—whose own internal structure has a depth of exactly 2."
So, the team went on a hunt. They listed every single one of these special subgroups inside their city. They found exactly 75 of them. Then, they checked the "depth" of the centralizer (the neighborhood) for each of these 75 subgroups.
Here is where the surprise happened.
- For most of these subgroups, a known theorem (Duflot's theorem) showed that their neighborhoods were very deep—at least 3 units deep.
- For the remaining two tricky types, the team did a massive, exact calculation using computer-assisted algebra. They found that even these neighborhoods had a depth of at least 3.
The result was a perfect contradiction. The main city had a depth of 2, but every single possible "dead end" they could find was associated with a neighborhood that was at least 3 units deep. There was no dead end of width 2 anywhere to be found.
The Verdict
Because they found a city where the ladder height (2) is strictly smaller than the smallest dead end (3), the team has proven that Carlson's Conjecture is false. They didn't just guess; they provided an "exact certificate," a step-by-step algebraic proof that can be checked by anyone. They showed that for the group SmallGroup(128, 859), the depth is 2, but the smallest associated prime has a dimension of at least 3.
In simple terms, they found a place in the mathematical universe where the rules of symmetry are more complex and "deep" than the simple rule of thumb suggested. The ladder is shorter than the smallest gap, proving that the old map was missing a crucial detail. This isn't just a small correction; it's a complete rewrite of a long-held belief about how these mathematical cities are built.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.