🔢 mathematics

The arithmetic rank of the residual intersections of a complete intersection ideal

This paper determines the arithmetic rank and provides explicit set-theoretic generators for generic $m$ -residual intersections of complete intersection ideals, establishing a sharp upper bound that proves such intersections fail to be set-theoretic complete intersections in characteristic zero.

Original authors: Manav Batavia, Kesavan Mohana Sundaram, Vaibhav Pandey, Taylor Murray

Published 2026-04-20

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Manav Batavia, Kesavan Mohana Sundaram, Vaibhav Pandey, Taylor Murray

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 build a specific shape out of clay. In mathematics, this "shape" is a geometric object called a variety, and the "clay" is a space defined by equations.

Usually, to define a shape, you need a list of rules (equations). For example, to make a circle, you might need one equation: $x^2 + y^2 = 1$ . But what if the shape is incredibly complex? How many rules do you actually need to describe it?

This paper answers that question for a very specific, tricky type of shape called a Residual Intersection.

Here is the story of the paper, broken down into simple concepts and analogies.

1. The Problem: The "Minimum Rule" Count

In math, there's a concept called Arithmetic Rank. Think of it as the "Minimum Rule Count."

The Goal: You want to describe a shape using the fewest possible equations.
The Catch: You don't need the equations to be perfect. You just need them to carve out the exact same shape (even if they allow for some extra "ghost" points that disappear when you look at the big picture).
The Difficulty: Sometimes, the equations you start with are messy and numerous. The mathematicians want to know: What is the absolute minimum number of equations needed to define this shape?

2. The Setup: The "Residual Intersection"

The paper focuses on a specific construction called a Residual Intersection.

The Analogy: Imagine you have a large, solid block of cheese (the "Complete Intersection"). You cut out a smaller, perfect cube from it (the "Ideal").
Now, imagine you take a new, random set of knives (the "Matrix $X$ ") and slice through the cheese in a specific way.
The Residual Intersection is the weird, leftover piece of cheese that remains after you remove the part that was "caught" by your original cube.
The authors ask: If we do this with a generic set of knives (random cuts), how many equations do we need to describe this weird leftover piece?

3. The Discovery: A Secret Connection to Symmetry

The authors found a surprising shortcut. They realized that this "leftover cheese" problem is secretly the same as a problem in Classical Invariant Theory.

The Analogy: Imagine a spinning top. No matter how you spin it, some features stay the same (like its height). In math, these unchanging features are called Invariants.
The authors discovered that the equations defining their "leftover cheese" are exactly the same as the equations that describe the "unchanging features" of a specific group of symmetries (the Special Linear Group, or $SL_n$ ).
Why this helps: Mathematicians have studied these symmetry groups for centuries. By realizing their problem was just a symmetry problem in disguise, they could use old, powerful tools to solve a new problem.

4. The Solution: The Magic Formula

After doing some heavy lifting (which involves advanced algebra and topology), they found a precise formula for the "Minimum Rule Count" (Arithmetic Rank).

If you have:

$n$ : The size of your original perfect cube.
$m$ : The number of random knives you used ( $m$ is always bigger than or equal to $n$ ).

The number of equations needed is:
$\text{Count} = n \times (m - n + 1) + 1$
(Unless $n=1$ , in which case it's just $m$ .)

In plain English:
If you have a 2D cube ( $n=2$ ) and you use 4 knives ( $m=4$ ), you need $2 \times (4-2+1) + 1 = 7$ equations to describe the leftover shape.
This formula works perfectly, whether you are working with real numbers, complex numbers, or even numbers in a "clock arithmetic" system (positive characteristic).

5. The "Gotcha": Why It's Not a "Complete" Shape

One of the most interesting findings is about Set-Theoretic Complete Intersections.

The Dream: A "Complete Intersection" is a shape that is defined by exactly as many equations as its dimension suggests. It's a "perfect" shape.
The Reality: The authors proved that for these residual intersections (when $n \ge 2$ ), the shape is never a "perfect" shape.
The Metaphor: It's like trying to build a complex sculpture using only the minimum number of bricks. No matter how hard you try, you always need one extra brick (or a few more) to hold the structure together. You can't do it with the "theoretical minimum."

6. How They Proved It (The Two-Pronged Attack)

To prove their formula was correct, they had to show two things:

The Upper Bound (We can do it with this many): They used a structure called an ASL (Algebra with a Straightening Law).
- Analogy: Imagine a messy closet. An ASL is a specific way of organizing clothes so that you can always find a "straightening rule" to put a shirt and pants together neatly. They showed that the equations for their shape could be organized this way, proving you can define the shape with their formula.
The Lower Bound (We can't do it with fewer): They used Topology (the study of shapes and holes).
- Analogy: Imagine the space around the shape. If the shape is too "complicated" (has too many holes or twists), you can't describe it with too few equations. They used advanced "cohomology" (a way of counting holes) to prove that if you tried to use fewer equations than their formula, the shape would fall apart mathematically.

Summary

This paper is a triumph of connecting different areas of math.

The Problem: How many rules define a specific complex geometric leftover?
The Trick: Realizing it's actually a problem about symmetry and invariants.
The Result: A precise formula for the minimum number of rules needed.
The Takeaway: These shapes are inherently "messy." They can never be defined by the absolute theoretical minimum number of equations; they always require a little bit of extra complexity to exist.

The authors didn't just find a number; they showed us that the "leftover" pieces of algebraic geometry have a hidden, beautiful structure that connects symmetry, topology, and the very nature of how we define shapes.

1. Problem Statement

The paper addresses the computation of the arithmetic rank ($ara(I)$) of ideals in commutative algebra. The arithmetic rank of an ideal $I$ in a Noetherian ring $R$ is defined as the smallest number of elements required to generate $I$ up to radical (i.e., the minimum number of equations needed to define the vanishing locus $V(I)$ set-theoretically).

The specific focus is on residual intersections of complete intersection ideals.

Let $I = (f_1, \dots, f_n)$ be a complete intersection ideal generated by a regular sequence in a Noetherian local ring $(R, \mathfrak{m})$ .
Let $\mathfrak{a} \subsetneq I$ be an ideal generated by $m$ elements ( $m \geq n$ ).
The $m$ -residual intersection is defined as $J = \mathfrak{a} : I$ .
The authors investigate the arithmetic rank of the generic $m$ -residual intersection, denoted $RI(m, \mathbf{y})$ , where $\mathbf{y}$ are indeterminates and the generators of $\mathfrak{a}$ are linear combinations of $\mathbf{y}$ with generic coefficients.

The central question is: What is the exact value of $ara(RI(m, \mathbf{y}))$ for all $m \geq n$ and in any characteristic?

2. Methodology

The authors employ a multi-faceted approach combining invariant theory, combinatorial commutative algebra, and algebraic topology.

A. Connection to Invariant Theory (Characteristic 0)

In characteristic zero, the authors identify a connection between the generic residual intersection and the nullcone of a group action.

They consider the action of the special linear group $SL_n(K)$ on the polynomial ring $S = K[X, \mathbf{y}]$ , where $X$ is an $m \times n$ matrix of indeterminates.
The ring of invariants $S^{SL_n}$ is generated by the entries of $X\mathbf{y}$ and the $n \times n$ minors of $X$ .
The ideal $RI(m, \mathbf{y})$ is identified as the ideal generated by the positive-degree invariants (the nullcone ideal).
Using the fact that $SL_n$ is linearly reductive in characteristic zero, they utilize local cohomology obstructions. Specifically, they show that the non-vanishing of the local cohomology module $H^d_{RI(m, \mathbf{y})}(S)$ (where $d$ is the dimension of the invariant ring) provides a lower bound for the arithmetic rank.

B. Structure of the Auxiliary Ring (Arbitrary Characteristic)

To establish an upper bound and explicit generators valid in any characteristic, the authors analyze the "auxiliary ring" $K[B]$ , where $B$ is the set of generators of the invariant ring (entries of $X\mathbf{y}$ and minors of $X$ ).

ASL Structure: They prove that $K[B]$ is an Algebra with a Straightening Law (ASL) over a specific poset. This allows them to construct an explicit homogeneous system of parameters for $K[B]$ .
Dimension Calculation: The dimension of this ASL is calculated to be $n(m - n + 1) + 1$ . Since a system of parameters generates the maximal ideal up to radical, this dimension serves as an upper bound for the arithmetic rank.
Singularity Properties:
- They prove $K[B]$ is a Gorenstein factorial domain (UFD).
- In positive characteristic, they prove $K[B]$ is $F$ -regular (and thus $F$ -rational). This is achieved by showing the initial subalgebra with respect to a lexicographic order is a normal ASL, and then deforming the singularity back to the original ring.

C. Topological Obstructions (Positive Characteristic)

In positive characteristic, the local cohomology obstruction used in characteristic zero vanishes. To recover the lower bound, the authors shift to topological methods.

They study the topology of the open complement $U = \mathbb{A}^{mn+n} \setminus V(RI(m, \mathbf{y}))$ .
Using the Mayer-Vietoris sequence for singular cohomology (in characteristic 0) and étale cohomology (in characteristic $p$ ), they analyze the cohomology groups of $U$ .
They construct a fiber bundle structure over a product of Grassmannians to compute the highest non-vanishing cohomology group.
The non-vanishing of a specific cohomology group $H^N(U)$ implies that $U$ cannot be covered by fewer than $N - d + 1$ affine open sets, thereby establishing the lower bound for the arithmetic rank.

3. Key Contributions and Results

Main Theorem (Theorem 4.7)

The authors determine the exact arithmetic rank of the generic $m$ -residual intersection $RI(m, \mathbf{y})$ in the polynomial ring $K[X, \mathbf{y}]$ :
$ara(RI(m, \mathbf{y})) = \begin{cases} n(m - n + 1) + 1 & \text{if } n \geq 2, \\ m & \text{if } n = 1. \end{cases}$
This result holds for any field $K$ (or the integers $\mathbb{Z}$ ) and is independent of the characteristic.

Explicit Generators

The paper provides an explicit description of the set-theoretic generators. These are constructed as sums of the generators of the auxiliary ring $K[B]$ grouped by their rank in the poset (Proposition 3.6 and Theorem 3.7). Specifically, the generators are of the form:
$\sum_{\text{rank}(\mu)=i} \mu$
where $\mu$ ranges over the elements of the generating set $B$ (entries of $X\mathbf{y}$ and minors of $X$ ).

Sharp Upper Bound for General Residual Intersections (Theorem 4.9)

The result for the generic case immediately yields a sharp upper bound for any residual intersection $J$ of a complete intersection ideal in a Noetherian local ring $R$ :
$ara(J) \leq n(m - n + 1) + 1 \quad (\text{for } n \geq 2).$
This bound is attained if the intersection is generic, the ring has characteristic 0, or specific flatness conditions are met.

Non-Set-Theoretic Complete Intersection

A significant corollary is that for a complete intersection ideal of height at least 2, any of its generic residual intersections (including its generic link) fails to be a set-theoretic complete intersection in characteristic zero. This is because the arithmetic rank ( $n(m-n+1)+1$ ) strictly exceeds the height of the ideal ( $m$ ) when $n \geq 2$ .

4. Significance

Resolution of a Long-standing Problem: The paper provides the first exact formula for the arithmetic rank of generic residual intersections across all characteristics, resolving a gap in the literature where only bounds were known.
Bridging Fields: It successfully bridges invariant theory, combinatorial algebra (ASLs), and algebraic topology (cohomology of varieties) to solve a purely algebraic problem.
Refinement of Bounds: The derived upper bound is significantly sharper than previous bounds for colon ideals (e.g., in [Has25]), specifically improving the estimate by the difference in codimensions ( $m-n$ ).
Characteristic Independence: By utilizing both local cohomology (char 0) and étale cohomology/topology (char $p$ ), the authors demonstrate that the arithmetic rank of these specific ideals is a robust invariant independent of the field's characteristic.
Structural Insights: The proof that the auxiliary ring is a Gorenstein factorial domain and $F$ -regular in positive characteristic adds to the understanding of the singularity structure of varieties of complexes.

In summary, the paper establishes that the complexity of defining residual intersections set-theoretically is governed by the dimension of the associated invariant ring, providing a precise, characteristic-free formula and explicit generators.