Simplicial Virtual Resolutions

• Simplicial Virtual Resolutions are graded free S-complexes built from labeled simplicial complexes that encode both combinatorial and homological data to resolve monomial and Stanley–Reisner ideals.
• They enable the construction of shorter, computationally efficient complexes even when classical Cohen–Macaulay conditions fail, permitting controlled excess homology on the irrelevant locus.
• These resolutions bridge combinatorial techniques with toric and projective geometry, introducing novel operations like virtual shelling and stellar subdivisions to optimize resolution structures.

A simplicial virtual resolution is a refinement of classical combinatorial commutative algebra methods for resolving monomial and, specifically, Stanley–Reisner ideals over polynomial and Cox rings, central to the study of toric and projective geometry. It allows the construction of free resolutions of such ideals in the context where full Cohen–Macaulayness is absent, by encoding torsion and auxiliary geometric information at the sheafified level, and links the combinatorics of simplicial complexes with homological properties of their associated algebraic objects. Developed principally by Berkesch, Erman, Smith, and collaborators, as well as subsequent work by Stucky, Yang, Van Tuyl, and others, the formalism gives new criteria and construction techniques for short, computationally efficient complexes that are no longer strictly minimal free resolutions, permitting controlled excess homology that vanishes on the irrelevant locus. These tools yield a notion of virtual Cohen–Macaulayness, new classes of combinatorially tractable complexes, and a suite of operations (such as stellar subdivision) to manipulate and improve resolutions in this framework (Yang et al., 2023, Stucky et al., 26 Jan 2026, Berkesch et al., 2020, Kenshur et al., 2020).

1. Definition and Structure of Simplicial Virtual Resolutions

Let $S=k[x_1,\dots,x_n]$ denote a polynomial ring or a Cox ring associated to a smooth toric variety $X$, graded by $\mathbb{Z}^n$ or the class group. For a finitely generated graded $S$-module $M$, a (graded) free $S$-complex

$F_\bullet\colon \cdots \to F_2 \to F_1 \to F_0$

is called a virtual resolution of $M$ if, upon sheafification over $X$, the complex

$$F_\bullet \otimes_S \mathcal{O}_X\colon \cdots \to \widetilde{F}_2 \to \widetilde{F}_1 \to \widetilde{F}_0 \to \widetilde{M} \to 0$$

is a locally free (vector bundle) resolution of the corresponding coherent sheaf $\widetilde{M}$ on $X$ (Yang et al., 2023).

More concretely, for a monomial ideal $I_\Delta$, the Stanley–Reisner ideal of a simplicial complex $\Delta$, the complex $F_\bullet$ arises from a (labelled) simplicial complex $(\Delta, \ell)$, where $\ell$ is an lcm-labeling compatible with the face lattice. The length $\ell(F_\bullet)$ satisfies $\ell(F_\bullet) \geq \mathrm{codim}\, M$, and in the optimal situation is exactly $\mathrm{codim}\, M$. The modules $F_i$ are direct sums of shifts $S(-a_{ij})$ determined by the combinatorial types of faces (Yang et al., 2023, Stucky et al., 26 Jan 2026).

2. Combinatorial and Homological Construction

Given a labeled simplicial complex $(\Delta, \ell)$, one forms $F_\Delta$, a $\mathbb{Z}^n$-graded free $S$-complex,

$$F_{\Delta,i} = \bigoplus_{\substack{\sigma \in \Delta \ \dim{\sigma}=i-1}} S(-\deg(\ell(\sigma)))$$

with boundary operators defined on oriented simplices by

$$\partial_i([\sigma]) = \sum_{\tau \subset \sigma, \dim{\tau}=i-2} \pm \frac{\ell(\sigma)}{\ell(\tau)} [\tau].$$

For a monomial $m \in S$, define the induced subcomplex $$\Delta_m = \{\sigma \in \Delta \mid \ell(\sigma) \mid m\}$$. The key connection is: $$H_i(F_\Delta)_\alpha \cong \widetilde{H}_{i-1}(\Delta_m; k), \quad \text{for } m = x^{\alpha}.$$ Thus, the vanishing of reduced homology (in appropriate subcomplexes) is equivalent to the required exactness conditions (Stucky et al., 26 Jan 2026).

A fundamental characterization for when $F_\Delta$ is a virtual resolution of $S/I$ is: there exists $d \geq 0$ such that for all $m \in B^d$ (where $B$ is the irrelevant ideal), $\widetilde{H}_j(\Delta_m; k) = 0$ for all $j \geq 0$. This enables precise combinatorial criteria for verifying and constructing virtual resolutions (Stucky et al., 26 Jan 2026).

3. Virtual Cohen–Macaulayness and Sufficient Criteria

For a simplicial complex $\Delta$ on the rays of $X$, $\Delta$ is called virtually Cohen–Macaulay if $S/I_\Delta$ admits a virtual resolution of length $$\ell = \mathrm{codim}(S/I_\Delta) = n - (\dim \Delta + 1)$$.

The following theorem gives a constructive sufficient criterion (Yang et al., 2023): If there exists a simplicial complex $\Delta'$ and a surjective simplicial map $v: \Delta' \to \Delta$ such that

1. $\Delta'$ is Cohen–Macaulay,
2. For every face $G \in \Delta'$, $\dim G = \dim v(G)$,
3. Every $F \in \Delta$ with $|v^{-1}(F)| > 1$ lies in the irrelevant complex $B_X$,

then $\Delta$ is virtually Cohen–Macaulay. This allows for "duplication" of faces lying entirely in the irrelevant locus, augmenting $\Delta$ to a Cohen–Macaulay cover $\Delta'$, without altering the geometric support.

Further, a more specialized notion—virtually shellable simplicial complexes—vividly generalizes classical shellability and inherits virtual Cohen–Macaulayness whenever a suitable virtual shelling (ordered CM cover, duplicating only irrelevant faces) exists (Yang et al., 2023).

Balanced simplicial complexes—each facet including exactly one variable from each multigrading component—are always virtually Cohen–Macaulay (Kenshur et al., 2020). A radical-of-monomial extension criterion further generalizes this to settings where an auxiliary monomial ideal $J$ can be found so that $S/(I_\Delta \cap J)$ is Cohen–Macaulay (Kenshur et al., 2020).

4. Minimality, Nontrivial Homology, and Homology-Reduction Techniques

Although virtual resolutions permit controlled homology off the irrelevant locus, it is crucial to characterize the minimal supporting structure for such homology. If $F_\Delta$ has $H_i(F_\Delta) \ne 0$ for some $i > 0$, then any subcomplex $\Delta_m$ exhibiting nontrivial homology must be large enough: specifically, the total number of vertices satisfies

$$\# V(\Delta) \geq \mathrm{codim}(B) + \# V(\Delta_m).$$

In the minimal case where $\# V(\Delta) = \mathrm{codim}(B) + 2$, $\Delta$ must be a bipyramid over a simplex of dimension $\mathrm{codim}(B)-1$ (Stucky et al., 26 Jan 2026).

Eliminating unwanted homology is achieved via virtual-compatible stellar subdivisions. A new vertex is added at a chosen face, with label $\ell'(v')$ compatible with the divisibility and ideal-theoretic saturation relative to the irrelevant ideal. Under such subdivisions, one produces a new complex $F_{\Delta'}$ that supports a virtual resolution and in general has strictly less homology, with precise criteria dictating when homology is strictly reduced (Stucky et al., 26 Jan 2026).

5. Comparison with Classical Resolutions and Computational Aspects

Classical simplicial (cellular or Taylor) resolutions are genuine free resolutions, requiring exactness off the defining ideal. Simplicial virtual resolutions relax this, allowing extraneous homology supported entirely on the irrelevant locus. This relaxation can strictly shorten the required length: a typical non-CM complex may admit a virtual resolution of length equal to codimension, while any genuine resolution is longer (Yang et al., 2023).

A combinatorial comparison is illustrated in the following table:

Resolution Type	Length	Homology Location
Minimal Free Resolution	$\ge$ codimension	Vanishes off ideal
Virtual Resolution	codimension	Permitted on irrelevant locus

The combinatorial sufficient tests for virtual resolutions avoid the full strength of e.g., Reisner's criterion. Rather than requiring vanishing of all reduced link homologies, it suffices to produce a Cohen–Macaulay or shellable cover duplicating faces only on the irrelevant subcomplex.

Constructing virtual resolutions is done explicitly:

• by finding a monomial ideal $J$ with $J:B_X^\infty = I_\Delta:B_X^\infty$, and using its minimal free resolution,
• by splitting vertices (duplicating) in $\Delta$ along faces in $B_X$ to generate a Cohen–Macaulay cover.

These are computationally tractable, and, in practice, often yield simpler complexes than direct minimal resolutions.

6. Applications, Examples, and Generalizations

Key examples illustrate the construction:

• In $S=k[x_0,x_1,y_0,y_1,y_2]$, for a $\Delta$ not Cohen–Macaulay as in $\mathbb{P}^1 \times \mathbb{P}^2$, a shellable complex $\Delta'$ is formed by splitting a variable, and yields a virtual resolution of minimal length (Yang et al., 2023).
• In $S=k[x_0,x_1,y_0,y_1]$ (the 4-cycle), $I_\Delta=(x_0y_1,x_1y_0)$ is not CM, but $J=(x_0,x_1)$ makes $S/(I_\Delta \cap J)$ a hypersurface, so the induced $F_\bullet$ provides a virtual resolution of minimal length (Kenshur et al., 2020).
• In products of projective spaces, many Stanley–Reisner rings, especially from balanced complexes, are virtually Cohen–Macaulay even in the absence of classical CM properties (Kenshur et al., 2020).

Homological tools, such as the vanishing of sheafified Ext and Tor beyond the length of a virtual resolution, mapping cone constructions, and virtually regular elements (for dimension control), enable further algebraic manipulation and deeper understanding of module-theoretic invariants (Berkesch et al., 2020).

7. Relationships with Cohen–Macaulayness and Open Questions

Three related notions are emphasized:

• Arithmetically Cohen–Macaulay: a module has a free resolution of minimal length (codimension).
• Virtually Cohen–Macaulay: a virtual resolution of minimal length exists.
• Geometrically Cohen–Macaulay: the sheaf is locally Cohen–Macaulay at all relevant primes.

There is a strictly descending implication chain: $$\text{arithmetic CM} \implies \text{virtual CM} \implies \text{geometric CM},$$ with known strictness—in particular, virtual CM captures modules that are not classical CM but admit virtual resolutions of optimal length (Berkesch et al., 2020, Kenshur et al., 2020).

Open questions concern the dependence of virtual Betti numbers on combinatorial type, the existence of combinatorial criteria analogous to Reisner's for general virtual CMness, and stability under fundamental operations (joins, links, subdivisions) (Kenshur et al., 2020). A plausible implication is that virtual shellability provides a combinatorial framework parallel to, but more flexible than, classical shellability in guaranteeing Cohen–Macaulay-type homological properties (Yang et al., 2023).