Motives of Nullcones of Quiver Representations

This paper presents two distinct formulas—one explicit and one of the wall-crossing type—for calculating the motives of nullcones associated with quiver representations.

The Gist

Imagine you are an architect trying to understand a massive, chaotic city built by a group of builders. This city is made of Quiver Representations.

To make this paper accessible, let's break down the complex math into a story about building blocks, city planning, and finding the "empty" spots.

1. The City and the Builders (Quivers and Representations)

Think of a Quiver as a blueprint for a city. It has:

• Nodes (Vertices): These are the districts (like Downtown, Uptown, etc.).
• Arrows: These are the roads connecting the districts.

A Representation is a specific version of this city. In each district, you have a certain number of "people" (vectors). On every road, you have a specific rule for how people move from one district to another (linear maps).

The Builders are the General Linear Groups ($GL$). They are like the city planners who can rearrange the people within a district or rotate the roads, but they must keep the overall structure of the city intact. If you rearrange the people but the city looks the same, it's just a different view of the same city.

2. The "Nullcone": The City of Ghosts

Now, imagine a special part of this city called the Nullcone.

• In normal cities, you have stable buildings.
• In the Nullcone, everything is "unstable." If you let the builders work long enough, they can shrink these buildings down until they vanish completely into a single point (the origin).
• Mathematically, these are nilpotent representations. Think of them as "ghost cities" where if you follow the roads in a loop, you eventually lose all the people. They are the "zero" states of the system.

The authors of this paper want to count these ghost cities. But not just "how many?" (which is hard because there are infinitely many). They want to count them using a special tool called a Motive.

3. The Motive: The "DNA" of a Shape

In this paper, a Motive is like a DNA sequence for a shape.

• Instead of counting the number of houses, the authors assign a "fingerprint" to the entire collection of ghost cities.
• This fingerprint tells you the shape's complexity, its holes, and its dimensions all at once. It's a way of saying, "This ghost city is made of 5 cubes and 3 tunnels," but in a very sophisticated algebraic language.

4. The Two Formulas: Two Ways to Count

The paper provides two different recipes (formulas) to calculate this DNA fingerprint for the Nullcone.

Recipe A: The Recursive Ladder (The "Explicit" Formula)

Imagine you are climbing a ladder to count the ghosts.

• You start at the bottom (a tiny city with 0 people).
• To find the count for a slightly bigger city, you look at the smaller cities you've already counted.
• The formula says: "To get the big city's fingerprint, take the fingerprints of all the smaller sub-cities, mix them with some magic numbers (powers of $L$, which represents a line), and add them up."
• The Analogy: It's like building a tower of blocks. You know the weight of a 1-block tower. To find the weight of a 2-block tower, you look at the 1-block tower and add the weight of the new block. The authors found a precise rule for how to stack these "motivic blocks" to get the answer.

Recipe B: The Wall-Crossing Storm (The "Wall-Crossing" Formula)

This is the more complex, "wall-crossing" method.

• Imagine the city is being hit by a storm. The storm represents a change in the rules of stability (the "slope").
• As the storm hits, the city breaks apart into different "strata" (layers or zones).
• Some zones are stable (they survive the storm), and some are unstable (they collapse into the Nullcone).
• The Hesselink Stratification is like a map of these zones. The authors realized that the "Ghost City" (Nullcone) is actually the sum of all the "unstable zones" created by this storm.
• The Wall-Crossing: When the storm changes direction (crosses a "wall"), the way the city breaks apart changes. The authors found a way to multiply the "DNA" of the stable parts of the city in a specific order (like a chain reaction) to reconstruct the DNA of the Ghost City.
• The Metaphor: It's like taking a complex puzzle, breaking it into pieces based on how they react to wind, and then realizing that if you multiply the pieces in the right order, you get the picture of the empty space (the Nullcone).

5. Why Does This Matter?

Why do we care about counting "ghost cities"?

1. Symmetry: It helps us understand the hidden symmetries of complex systems.
2. Physics: These mathematical structures often appear in string theory and quantum physics, where "nilpotent" states represent particles that decay or vanish.
3. Universality: The formulas work for any quiver (any city blueprint). Whether it's a simple line of districts or a chaotic web, the same rules apply.

Summary

The paper is a masterclass in counting the uncountable.

• The Problem: How do you describe the shape of all the "vanishing" configurations in a complex system?
• The Solution: The authors built two "machines" (formulas).
  • One machine builds the answer step-by-step from small pieces (Recursion).
  • The other machine breaks the system apart using a storm (Stratification) and reassembles the pieces in a specific order (Wall-Crossing).
• The Result: They gave us a precise "DNA fingerprint" for these vanishing shapes, allowing mathematicians to predict their properties without having to build them one by one.

In short, they figured out how to weigh the wind and measure the shadows of a mathematical city.

Technical Summary

1. Problem Statement

The paper addresses the problem of computing the motives (classes in the Grothendieck ring of complex varieties, $K_0(\text{Var}_{\mathbb{C}})$) of nullcones associated with quiver representations.

• Context: For a complex reductive group acting on a representation space, the nullcone consists of points where all non-constant invariant polynomials vanish. In the context of quivers, the representation space $R_d$ is acted upon by a product of general linear groups $G_d$. The nullcone $N_d \subset R_d$ parametrizes nilpotent representations (those where all cyclic compositions of arrows are nilpotent operators).
• Goal: The authors aim to derive explicit, systematic formulas for the class $[N_d]$ in the localized ring of motives $\mathcal{M}$. While qualitative descriptions (stratifications) existed previously, this work provides quantitative, motivic formulas, generalizing classical results on nilpotent matrices to arbitrary quivers.

2. Methodology

The authors employ two distinct but complementary approaches to derive formulas for $[N_d]$:

A. Geometric Stratification by Socle Type (Explicit Recursive Approach)

• Strategy: They utilize a stratification of the nullcone based on the socle (the maximal semisimple subrepresentation) of a representation.
• Mechanism:
  • They define strata $S_f$ based on the dimension vector $f$ of the kernel of the map $\Phi_i: V_i \to \bigoplus_{\alpha: i \to j} V_j$.
  • They construct a correspondence between the nullcone $N_d$ and a bundle over a product of Grassmannians, relating $N_d$ to $N_{d-f}$ and the geometry of the base change group $G_d$.
  • This leads to a recursive relation involving Gaussian binomial coefficients and the Euler form of the quiver.

B. Hesselink Stratification (Wall-Crossing Approach)

• Strategy: They interpret the classical Hesselink stratification of the nullcone (based on optimal one-parameter subgroups) as an identity of motives.
• Mechanism:
  • The strata are indexed by dominant, minimal coweights $s$.
  • The authors refine this indexing set by introducing balanced coweights and relating them to level quivers (quivers with vertices indexed by levels of the coweight).
  • They introduce the Rational Level Quiver $Q_{\mathbb{Q}}$ and the Integral Level Quiver $Q_{\mathbb{Z}}$.
  • The stratification is reinterpreted in terms of $\theta$-semistable representations of these level quivers.
  • The final formula is derived as an ordered product over slopes, resembling wall-crossing formulas found in Donaldson-Thomas theory.

3. Key Contributions and Results

I. Explicit Recursive Formulas

The first major result provides a direct, recursive computation of the motive $[N_d]$.

• Theorem 2.2: Establishes a recursion relation:
  $$\frac{[N_d]}{[G_d]} = - \sum_{0 \neq e \leq d} L^{-\langle e, d-e \rangle} (L)_{d-e}^{-1} \frac{[N_e]}{[G_e]}$$
  where $\langle \cdot, \cdot \rangle$ is the Euler form and $(L)_n$ is the Pochhammer symbol.
• Corollaries:
  • Corollary 3.1: An equivalent form using explicit polynomials $n_d(L)$.
  • Corollary 3.2: A generating function identity in a twisted formal power series ring:
    $$\left( \sum_{d} \frac{[N_d]}{[G_d]} t^d \right) \cdot \left( \sum_{d} \frac{t^d}{(L)_d} \right) = 1$$
  • Corollary 3.3: An explicit sum formula over ordered decompositions of the dimension vector $d = d_1 + \dots + d_s$.
  • Corollary 3.4: For symmetric quivers, a relation to Donaldson-Thomas (DT) invariants, linking the nullcone motive to the generating series of DT invariants via an exponential identity.

II. Wall-Crossing Type Formula

The second major result interprets the Hesselink stratification as a product formula.

• Theorem 5.2 & 5.7: The generating function for nullcone motives is expressed as an ordered product over rational slopes $\mu \in [0, 1] \cap \mathbb{Q}$:
  $$\sum_{d} \frac{[N_d]}{[G_d]} t^d = \overrightarrow{\prod}_{\mu \in [0, 1] \cap \mathbb{Q}} \left( 1 + \sum_{\sigma(e)=\mu} L^{-\dots} \frac{[R^{\theta\text{-sst}}_e(Q_{\mathbb{Z}})]}{[G_e]} u^e \right)$$
  This formula relates the nullcone of the original quiver to the generating functions of semistable representations of the integral level quiver $Q_{\mathbb{Z}}$.
• Significance: This structure mirrors wall-crossing phenomena in moduli spaces, providing a deep structural link between nilpotent representations and semistable ones.

III. Examples and Applications

The paper validates these formulas with concrete examples:

• Acyclic Quivers: Recovers the trivial result that the nullcone is the entire space.
• One Vertex with Loops: Recovers the classical formula for the motive of nilpotent $d \times d$ matrices, $[N_d] = L^{d(d-1)}$.
• Multi-loop Quivers: Provides explicit polynomial expansions for small dimensions ($d=2, 3$) and arbitrary loop counts $m$.
• Extended Dynkin Quivers: Demonstrates the wall-crossing formula on a specific $\tilde{A}_2$ quiver.

4. Significance and Impact

• Unification: The paper unifies two different perspectives on quiver nullcones: a direct geometric recursion (socle stratification) and a sophisticated stratification based on stability conditions (Hesselink/wall-crossing).
• Generalization: It generalizes the classical count of nilpotent matrices (a prototypical result in invariant theory) to arbitrary quivers and their representation spaces.
• Motivic Donaldson-Thomas Theory: By linking nullcone motives to DT invariants (Corollary 3.4), the work bridges the study of nilpotent orbits with modern enumerative geometry and wall-crossing phenomena.
• Computational Utility: The recursive formulas allow for the algorithmic computation of motives for specific quivers and dimension vectors, while the product formula offers a structural understanding of the generating series.
• Characteristic Zero Assumption: The authors note that while the formulas are expected to hold for point counts over finite fields (positive characteristic), the current proofs rely on methods (specifically those of [2, 5]) requiring a base field of characteristic zero.

In summary, this work provides a comprehensive toolkit for understanding the geometry of nilpotent quiver representations through the lens of motivic integration, offering both explicit computational tools and deep structural insights via wall-crossing identities.