← Latest papers
🔢 mathematics

Proxy smallness meets tt-structures

This paper introduces the concept of proxy smallness for tt-structures on triangulated categories over Noetherian schemes, leveraging tensor actions to provide a new characterization of locally complete intersection schemes and a topological classification of preaisles on the bounded derived category of coherent sheaves.

Original authors: Michal Hrbek, Pat Lank, Giovanna Le Gros, Sergio Pavon

Published 2026-05-26
📖 4 min read🧠 Deep dive

Original authors: Michal Hrbek, Pat Lank, Giovanna Le Gros, Sergio Pavon

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 an architect trying to understand the blueprint of a complex building. In the world of mathematics, specifically algebraic geometry, these "buildings" are called schemes (which are generalizations of shapes defined by equations), and the "blueprints" are categories of objects called derived categories.

For a long time, mathematicians have had a special tool to check if a building is structurally sound (specifically, if it is a "complete intersection," a type of smooth or nicely behaved shape). This tool is called proxy smallness. Think of proxy smallness as a way to say, "This complex object can be built using a small, manageable set of Lego bricks." If every object in the building's blueprint can be built this way, the building is "nice."

However, there was a problem. This tool worked great for small, local rooms (local rings), but when you tried to use it to describe the whole building (global schemes), it sometimes gave the wrong answer. It was like trying to judge the stability of a skyscraper by only looking at a single brick; the local logic didn't always hold up for the whole structure.

The New Tool: "t-Proxy Smallness"

The authors of this paper, Hrbek, Lank, Le Gros, and Pavon, introduced a new, more refined tool called t-proxy smallness.

To understand this, imagine the blueprint isn't just a pile of bricks, but a construction site with a strict schedule (a t-structure). In this schedule, you can only build things in a specific order: you can't put the roof on before the walls, and you can't add a second floor before the first is done.

  • Proxy Smallness asks: "Can this object be built from a small set of bricks?"
  • t-Proxy Smallness asks: "Can this object be built from a small set of bricks following the strict schedule?"

The paper shows that this new, schedule-aware tool is much better at detecting the true nature of the building. Specifically, they prove a major discovery: A building is a "locally complete intersection" (a nice, well-behaved shape) if and only if every single object in its blueprint can be built using this new, schedule-aware method.

This is a big deal because it fixes the "globalization" problem. The old tool failed when moving from local rooms to the whole building, but this new tool works perfectly everywhere.

The "Tensor" Twist

The paper also adds a layer of complexity involving tensor actions. Imagine that your building materials can interact with each other. If you have a "perfect" brick (a perfect complex), you can use it to multiply or combine with other bricks to create new ones.

The authors developed a version of their tool that respects these interactions, calling it t-⊗-proxy smallness. They found that if you have a building where every object can be built using this interaction-aware, schedule-aware method, the building is definitely a "locally complete intersection."

Classifying the Blueprints

The second half of the paper is like a massive filing system. The authors wanted to know: "If we look at all the possible ways to organize these blueprints (subcategories), how can we list them all?"

They discovered a way to map every possible valid organization of the blueprint to a pair of simple data points:

  1. A "Singular" Map: A list of the "broken" or "weird" spots in the building (the singularity category).
  2. A "Topological" Filter: A list of which parts of the building are allowed to exist at which time steps (Thomason filtrations).

They proved that for certain types of buildings (like those with "hypersurface" singularities, which are shapes defined by a single equation), this mapping is a perfect one-to-one match. It's like saying, "If you give me this list of broken spots and this schedule, I can tell you exactly how the blueprint is organized, and vice versa."

Why This Matters (According to the Paper)

  • It fixes a broken tool: It provides a way to check if a geometric shape is "nice" (a complete intersection) that works globally, not just locally.
  • It creates a dictionary: It translates complex, abstract mathematical structures (subcategories of derived categories) into simpler, topological data (lists of points and schedules).
  • It reveals hidden differences: The authors show that the old "proxy smallness" and the new "t-proxy smallness" are not the same thing. There are objects that pass the old test but fail the new, stricter schedule test. This helps mathematicians understand the subtle differences between different types of mathematical "buildings."

In short, the paper introduces a smarter, more disciplined way to check the structural integrity of mathematical shapes and provides a complete catalog of how to organize their blueprints.

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 →