Dévissage for Algebraic K-theory of Small Stable $\infty$-categories

This paper extends the theorem of the heart to generic small stable $\infty$-categories by establishing sufficient conditions under which an exact functor induces isomorphisms of non-negative algebraic K-groups, thereby generalizing Quillen's dévissage theorem.

The Gist

Imagine you are trying to understand the "shape" or "structure" of a massive, complex building (let's call it The Category). This building is made of infinite, shifting blocks that can be rearranged, stretched, and twisted. In mathematics, this is called a Stable $\infty$-category.

Now, imagine you have a special tool called Algebraic K-Theory. Think of this tool as a "structural scanner." It doesn't just look at the building; it assigns numbers (called K-groups) to it that tell you about its stability, its holes, and its fundamental components.

The problem is: Calculating these numbers for the whole massive building is incredibly hard. It's like trying to count every single atom in a skyscraper.

The Big Idea: "De-vissage" (The Art of Peeling an Onion)

The paper introduces a method called De-vissage (a French word meaning "unscrewing" or "taking apart").

The Analogy:
Imagine you want to know the weight of a giant, sealed suitcase filled with nested boxes.

1. The Hard Way: Weigh the whole suitcase, then try to guess what's inside.
2. The De-vissage Way: You open the suitcase. Inside, you find a box. You open that box, find a smaller box, and so on. Eventually, you reach the very core: a tiny, simple object (like a single coin).
3. The Insight: If you know the weight of that tiny coin, and you know exactly how the boxes were nested inside each other, you can mathematically prove that the weight of the entire suitcase is the same as the weight of the coin.

In this paper, the author, Chunhui Wei, is saying: "If you can break a complex mathematical building down into smaller, simpler pieces that look like a specific 'core' category, then the structural scanner (K-theory) will give you the same reading for the big building as it does for the small core."

The New Twist: "Fillability"

The paper goes a step further. Previous mathematicians (like Quillen and Barwick) knew this "onion-peeling" trick worked under very strict conditions. Wei asks: What if the boxes are a bit messy? What if they don't fit perfectly?

He introduces a new concept called Fillability.

The Analogy:
Imagine you have a puzzle. You have the picture of the final image (the complex category) and a pile of puzzle pieces (the simple category).

• De-vissage says: "If your pieces can be arranged to look like the final image, we are good."
• Fillability says: "Not only can they look like the image, but if there are any gaps or missing edges in your arrangement, can you fill them in with more pieces to make it a perfect, solid block?"

If your puzzle pieces are fillable, it means they are robust enough to reconstruct the whole structure without any "leaks" or missing information.

The Main Results (Simplified)

The paper proves three main theorems using these ideas:

1. The "Good Enough" Rule (Theorem A):
   If you have a map from a simple category to a complex one, and it satisfies the "onion-peeling" rule (De-vissage) and the "gap-filling" rule (Fillability), then the structural scanner (K-theory) will give you the exact same numbers for both.

   • Translation: You can safely study the complex building by just studying the simple core, provided the connection between them is "fillable."

2. The "Empty" Rule (Theorem B):
   If a category is "infinitely fillable" (meaning you can keep filling gaps forever), then its structural scanner reads zero for all higher levels.

   • Translation: Some structures are so "perfectly filled" that they have no hidden complexity or holes left to discover. They are mathematically "empty" in terms of K-theory.

3. The "Super-Strong" Rule (Theorem C):
   If the connection is Strongly 1-fillable (a very robust version of gap-filling), then the numbers match perfectly, even for the very first level of the scan ($K_0$).

   • Translation: With a super-strong connection, you don't just get a match for the complex parts; you get a perfect match for the entire foundation.

Why Does This Matter? (The "Heart" Theorem)

The paper ends by applying this to a famous problem called the Theorem of the Heart.

The Analogy:
Imagine a building has a "Heart" (a central, simple room) and a "Shell" (the complex outer walls).

• Mathematicians have long suspected that if the building is built correctly (has a "bounded t-structure"), the structural scanner should give the same reading for the Heart as it does for the whole Shell.
• Wei uses his new "Fillability" tools to prove this suspicion is true.

He shows that the process of turning the "Heart" into the "Shell" is like a perfect, gap-filling puzzle. Because it is fillable, the K-theory numbers are identical.

Summary for the General Audience

This paper is a new instruction manual for simplifying the complex.

• Old Way: To understand a complex mathematical object, you had to check if it could be broken down perfectly into simple pieces.
• New Way (Wei's Contribution): You can also understand it if you can show that the simple pieces can "fill in" any gaps to reconstruct the complex object.
• The Payoff: This allows mathematicians to take very hard problems (calculating K-theory for huge, abstract categories) and solve them by looking at much smaller, easier problems (the "Hearts" of those categories). It's like proving that to understand the ocean, you only need to understand a single drop of water, provided you know how that drop fills the entire sea.

Technical Summary

1. Problem Statement

The paper addresses the generalization of Quillen's Dévissage Theorem and Barwick's Theorem of the Heart to the setting of small stable $\infty$-categories.

• Context: Classical dévissage (Quillen) and the theorem of the heart (Barwick) establish that under certain conditions (e.g., a category being filtered by subcategories or having a bounded t-structure), the algebraic K-theory of a category is equivalent to that of a "simpler" subcategory (like the heart of a t-structure).
• Gap: While Barwick [Bar15] and Efimov [Efi25] established these results for specific contexts (often involving t-structures or specific models), there was a need for a unified framework that characterizes when an exact functor between arbitrary small stable $\infty$-categories induces isomorphisms on K-groups.
• Goal: To establish sufficient conditions under which an exact functor $F: \mathcal{A} \to \mathcal{C}$ induces isomorphisms on non-negative K-groups ($K_n$), generalizing the classical results to the $\infty$-categorical setting without relying solely on t-structures.

2. Methodology and Framework

The author employs the language of stable $\infty$-categories and localizing invariants (following the framework of Blumberg, Gepner, and Tabula [BGT13]). The methodology involves several key constructions:

A. The Dévissage Condition

The paper formalizes a Dévissage Condition for an exact functor $F: \mathcal{A} \to \mathcal{C}$.

• Definition: $F$ satisfies the condition if every object in $\mathcal{C}$ can be built from objects in the image $F(\mathcal{A})$ via a finite sequence of extensions (cofiber sequences).
• Weak Dévissage: If $\mathcal{C}$ is idempotent-complete, a "weak" condition is sufficient, requiring that the idempotent completion of the extension closure of $F(\mathcal{A})$ equals $\mathcal{C}$.

B. Categorification of Fibers and Loops

To analyze the difference between $K(\mathcal{A})$ and $K(\mathcal{C})$, the author constructs auxiliary categories to "categorify" the fiber of the map $K(F)$.

• Gap Categories: The author defines $\text{Gap}([n], F)$ and $\text{Gap}(F)$, which are limits of categories of sequences (filtrations) in $\mathcal{C}$ compatible with $\mathcal{A}$.
• The Cone Construction: Using the work of Raptis [Rap18] and Raptis-Schlichting-Waldhausen [RSW24], the author defines a category $Q(F)$ (a "cone" of the functor) such that $K(Q(F))$ represents the homotopy fiber of $K(F)$.
• Loop Theorems: The paper establishes that the K-theory of certain constructed categories (like $\Theta(\mathcal{C})$) corresponds to the loop space of the K-theory of $\mathcal{C}$ (i.e., $K(\Theta(\mathcal{C})) \simeq \Omega K(\mathcal{C})$).

C. Fillability

A central new concept introduced is Fillability.

• 1-Fillability: An exact functor $F$ is 1-fillable if a specific "evaluation" map from a double-gap category $\text{Gap}(\text{Gap}^\vee(F))$ to $\text{Gap}^\vee(F)$ is essentially surjective. Intuitively, this means that "cofiber sequences in the image" are sufficient to describe "cofiber sequences in the whole category" up to a certain depth.
• Higher Fillability: The concept is iterated to define $n$-fillable and fillable functors. This property controls the vanishing of the K-groups of the fiber category $Q(F)$.

3. Key Contributions and Results

The paper provides three main theorems characterizing the behavior of K-theory under these conditions.

Theorem A: $n$-Fillability and Partial Isomorphisms

Let $F: \mathcal{A} \to \mathcal{C}$ be an $n$-fillable exact functor.

• If $F$ satisfies the weak dévissage condition, it induces:
  • Isomorphisms $K_i(\mathcal{A}) \xrightarrow{\sim} K_i(\mathcal{C})$ for $1 \leq i \leq n-1$.
  • An epimorphism $K_n(\mathcal{A}) \twoheadrightarrow K_n(\mathcal{C})$.
  • A monomorphism $K_0(\mathcal{A}) \hookrightarrow K_0(\mathcal{C})$.
• If $F$ satisfies the strong dévissage condition, the map on $K_0$ is also an isomorphism.

Theorem B: Vanishing of K-groups for Fillable Categories

Let $\mathcal{C}$ be a small, idempotent-complete, $n$-fillable stable $\infty$-category.

• Then $K_i(\mathcal{C}) = 0$ for all $1 \leq i \leq n$.
• If $\mathcal{C}$ is fully fillable, then $K_n(\mathcal{C}) = 0$ for all $n \geq 1$.
• Significance: This provides a structural constraint showing that "fillable" categories have trivial higher K-theory.

Theorem C: Strong 1-Fillability and Full Isomorphism

Let $F: \mathcal{A} \to \mathcal{C}$ be a strongly 1-fillable exact functor satisfying the dévissage condition.

• Then $F$ induces isomorphisms $K_n(\mathcal{A}) \xrightarrow{\sim} K_n(\mathcal{C})$ for all $n \geq 0$.
• Significance: This is the strongest result, generalizing Quillen's theorem to the $\infty$-categorical setting without requiring the existence of a t-structure, provided the "strong fillability" condition holds.

4. Application: The Theorem of the Heart

The paper culminates in Section 5 by applying these general results to recover Barwick's Theorem of the Heart.

• Setup: Let $\mathcal{C}$ be a stable $\infty$-category with a bounded t-structure, and let $\mathcal{C}^\heartsuit$ be its heart. Let $\Phi: D^b(\mathcal{C}^\heartsuit) \to \mathcal{C}$ be the canonical inclusion.
• Proof Strategy:
  1. The author proves that $\Phi$ satisfies the dévissage condition (because the t-structure is bounded).
  2. Using the inductive construction of $n$-fillable functors, the author shows that $\Phi$ is fillable.
  3. By applying Theorem C (or the corollary for fillable functors), it follows that $K_n(D^b(\mathcal{C}^\heartsuit)) \xrightarrow{\sim} K_n(\mathcal{C})$ for all $n \geq 0$.
• Result: This provides a new, self-contained proof of the theorem of the heart using the machinery of dévissage and fillability, linking it directly to Efimov's work [Efi25].

5. Significance

• Unification: The paper unifies classical dévissage, the theorem of the heart, and modern $\infty$-categorical K-theory under a single framework of "fillability" and "dévissage conditions."
• Generalization: It extends these results beyond categories with t-structures to general stable $\infty$-categories, provided the specific "fillability" conditions are met.
• Structural Insight: The introduction of fillability offers a new structural invariant. It identifies a class of categories (fillable ones) that have trivial higher K-theory, offering new tools for computing K-groups by identifying when they vanish.
• Methodological Advance: The use of categorified fibers ($Q(F)$) and loop theorems ($\Theta(\mathcal{C})$) provides a robust machinery for analyzing the homotopy fibers of K-theory maps, which is essential for higher K-theory computations in the $\infty$-categorical context.

In summary, Chunhui Wei's paper establishes a powerful set of sufficient conditions (dévissage + fillability) for an exact functor to induce K-theory isomorphisms, successfully generalizing classical results and providing a fresh perspective on the structure of stable $\infty$-categories.