WorksMathematics
A quotient formula for the Behrend function
Abstract
The Behrend function is essential in enumerative geometry. However, computing it, even in zero dimension, has been a highly subtle and mysterious matter since its introduction in the 2000s. We present a quotient formula for the Behrend function of any closed -dimensional affine scheme , evaluated at a singular point, where . In particular, if the scheme is monomial, we associate parallelepipeds to it and interpret the Behrend function as simple volume information about them. The results here, in particular, recover the recent results of Graffeo-Ricolfi for the zero-dimensional case in 2D in \cite{Graffeo-Ricolfi}, and also the more recent result of Polini-Sammartan-Ulrich on the zero-dimensional case in \cite{PSU26}.
Introduction
The Behrend function (introduced by Kai Behrend in [4]) plays a central role in enumerative geometry; in particular, the Behrend function of zero-dimensional subschemes is crucial in counting invariants in enumerative theories with symmetric perfect obstruction theories ([5, 6]). However, this function is infamous for having unpredictable behaviour; hence, it has been very hard to compute it, even in low dimensions. We provide a practical and elementary way to calculate the Behrend function of any affine scheme at a singular point; the case becomes more interesting when it comes to monomial (affine) schemes1, which come with a combinatorial intuition.
The case of zero-dimensional subschemes in was first considered in [11] by Graffeo and Ricolfi using toric geometry, which covers many interesting non-trivial classes and confirms the difficulties of the Behrend function calculation. Also, more recently, the case of zero-dimensional subschemes in was considered in [21]. For more information on the applications of the Behrend function in enumerative geometry, we also refer to [11]. For the application of the Behrend function in Donaldson-Thomas theory, we refer to [17].
Before we state the main results, we give some quick key definitions (more details will be in Section 1.1).
Definition 0.1 (Normal cone and special fibre). Let be an -dimensional2 ideal in and let be singular at the origin . We define the geometric normal cone of to be . Note that defines the exceptional locus of .
We, respectively, denote by and , the maximum-dimensional irreducible components of , for , respectively, zero-dimensional or positive-dimensional. We denote by the normalised leading coefficient of the Hilbert polynomial of .
Also, we define the special fibre of , , to be the reduction3 of .4
We use the term degree for either ideal/quotient rings or their corresponding affine or (quasi-)projective schemes.5
Definition 0.2 (Behrend function, see definitions 1.2, 1.3, 1.4). Let be an affine scheme. We define the Behrend function on as , where
where is the length of at the generic point of , and is a function from the integral algebraic cycles on to constructible -valued functions on , and is the canonical projection map.
Main results
We prove the following main results.
Setup. Let be the geometric normal cone of an -dimensional ideal in the polynomial ring , as above. As in the proof of Theorem 2.1, we see that we can write the normal cone as , for an ideal . We can write , where is its -primary decomposition. Let be the degree of . Let be the degree of , for , and , where is the number of the irreducible components of of the maximal dimension, dominating an -dimensional component of .
In addition, we set , which is the number of irreducible components of the maximal dimension of .
In this article, for simplicity, we assume that the origin is a singular point of , but the results can be considered for any singular point. We are interested in evaluating at the origin . When , we can simply use for .
Theorem A. (Quotient formula; see Theorem 2.1). For an -dimensional ideal in , suppose has a singularity at the origin . Then we have
where are the maximal-dimensional irreducible components of , and is the canonical projection, and is the local Euler obstruction.
An interesting combinatorial interpretation of this quotient formula for monomial ideals is described below. For a monomial ideal in variables, we associate the convex hull, , as the convex hull of the exponents of the monomial terms of in .
Theorem B (A combinatorial interpretation for monomial ideals; see Theorem 5.2). Let and . Let be an -dimensional monomial ideal in , and let be the origin as a singular point of . Then
where is a triangulation of , where the latter is the projection of onto the -coordinate plane for every fixed . Also, are the maximal-dimensional irreducible components of , and is the canonical projection, and is the local Euler obstruction. Also, corresponds to an irreducible component of the normal cone with maximal dimension, dominating a -coordinate plane component of in . The parallelepiped over is a parallelepiped produced by the vectors from the origin on to the vertices of (see Figure 1 and Figure 2).

Figure 1. Let the simplex correspond to exponents associated to vertices , and . The parallelepiped over the simplex is the parallelepiped generated over the vectors from the origin of to the vertices , and .

Figure 2. Irreducible components of the normal cone of maximal dimension are pictured with different colours. We have also picture the triangulation corresponding to each irreducible components. The numbers attached to each component are the corresponding gcd’s.
Remark 0.3. Note that since in the statement of Theorem B, we assumed that has the origin as its singularity, the components of correspond to -coordinate planes (i.e., -dimensional coordinate planes). Therefore, the last sentence of the theorem makes sense.
Remark 0.4. Note that in many interesting cases, for instance when is smooth at the singularity point , or it is a single point, by Lemma 1.5, we have both formulas in Theorem Theorem A and Theorem B without the contribution the local Euler obstruction. Also, when , we always have .
To clarify How Theorem A and Theorem B work, we give an explicit example.
Example 0.5. Let be a zero-dimensional ideal and , which contains the origin as its singularity. We can see that there are three irreducible components of the normal cone of the maximal dimension. From Theorem A, we have
Since is a monomial ideal, alternatively from Theorem B, we have
See Figure 2.
An even simpler interpretation of the Behrend function for monomial schemes is the following.
Theorem C (see Theorem A.1). Let be a monomial ideal in that is singular at the origin, and let . Then, for any polygon in the lower boundary of the convex hull of , we have
where is the contribution of the Behrend function evaluated at the origin (considering with a suitable sign), and is the constant term of the primitive equation $a_{1}x_{1}+a_{2}x_{2}+\cdots+
of the plane defined by . Then can be computed as a signed sum of s, weighted with the corresponding .
To prove Theorem B, we need the following theorem, which will be proved inductively.
Theorem D (Normal cone/convex hull correspondence; see Theorem 4.4). Let be an -dimensional monomial ideal. The maximal dimensional irreducible components of the normal cone of correspond to the polytope decomposition of the lower boundary of the convex hull of in each -coordinate plane for .
From Theorem B and the minimisation procedure of a monomial ideal (we denote the minimisation of by ), we can characterise zero-dimensional monomial ideals with a maximal Behrend number, i.e., when the Behrend number is equal to the multiplicity:
Corollary 0.6 (Characterisation of zero-dimensional monomial ideals with maximal Behrend number; see Proposition 6.4). A zero-dimensional monomial ideal in has maximal Behrend number if and only if the -boundary of the minimisation only consists of -simplices and the removed monomials in the process of minimisation lie strictly above the lower boundary of the convex hull of .
Note that this corollary can be generalised to higher dimensions, but we skip the statement. Our procedure shares the spirit of the following combinatorial result, which will be proved in the appendix. More precisely, we have a generalised version of the celebrated Pick’s Theorem that relaxes the condition that the vertices be integral for certain types of plane polygons.
Theorem E (Generalised Pick’s formula; see Theorem A.7). Let be a plane convex polygon with some non-lattice vertices so that it can be integrally and generically embedded in , i.e., there is an embedding of into with all vertices lattice points so that it is not perpendicular to any of the three coordinate planes. Let and be the number of internal lattice points and the number of lattice points on the boundary of the embedded polygon in , respectively. Then
where is the equation of the plane defined by the embedded polygon in , is primitive, and .
Remark 0.7. A generalised version for is given in [23].
Richard Thomas raised the following question, but we do not know the answer, and it could be an interesting future direction.
Question. What is the enumerative interpretation of the Behrend function of ideals that do not define a critical locus of a function?
Previous work. In [11], the authors used toric geometry to compute the Behrend number of fat points in . Our approach recovers their formulas and extends them to higher dimensions using combinatorial methods. Regarding the constancy of the Behrend function on the Hilbert scheme of points in 3D, we refer to [15]. Also, there is a more recent result, [21], on the Behrend number of fat points in using Rees valuations.
Remark 0.8. This work was developed completely independently of and concurrently with [21], which appeared on arXiv in August 2026. While both studies independently derive the formulas for the zero-dimensional case, the present work specifically highlights the arbitrary-dimensional case. Also, while both studies reach similar conclusions for the zero-dimensional case, the different languages and tools used confirm the independence of the results. After conversations with one of the authors, we noticed the following overlaps in the zero-dimensional case: Restricting the formulas for the general case and the monomial case (in Theorem A and Theorem B, respectively) to dimension zero are equivalent to the formulas in [21]. Moreover, the formula for the monomial case in terms of the constant term of the defining hyperplanes in Theorem C, restricted to dimension zero, is equivalent to the results in [21].
Convention. By a polytope, we mean a convex bounded polytope. Furthermore, we always consider ideals with a minimal number of generators. By a lattice point, we mean a point with integer coordinates. Also, a lattice polytope is a polytope such that all its vertices are lattice points. For simplicity, in the polynomial ring with two variables we use instead of , and in the polynomial ring with three variables we use instead of . A generator of a monomial ideal in is a mixed term or a mixed generator, if it has more than one variable . For example is a mixed generator of the ideal in . We use the convex hull of an ideal and the convex hull of the normal cone of the ideal interchangeably. We denote the origin of by . The proofs are considered for , but it can be replaced by any singular point of . When is zero-dimensional, we simply denote by . As mentioned above, the term degree will be used for either ideal/quotient rings or their corresponding affine or (quasi-)projective schemes.
Notation. For an -dimensional ideal in and with the origin as its singular point, we have the following notations for some numbers/notions associated with (or ). For the definition of degree, see Definition 1.1.
The normal cone of (see Definition 0.1).
The special fibre of as the reduction of (see Definition 0.1).
Number of the maximal dimensional irreducible components of or (see definition 0.1), where is the number of the irreducible components of of the maximum dimension, dominating a -dimensional component of .
or Components of , for zero-dimensional or higher dimensional, respectively (see Definition 0.1).
The normalised leading coefficient of the Hilbert polynomial of .
The degree of the -primary decomposition component of the ideal of the normal cone . When is zero-dimensional, we simply denote this by .
The degree of , where are primary decomposition components of the ideal of the normal cone for , and . When is zero-dimensional, we simply denote this by .
The length of at the generic point of (see Definition 1.3).
Integral cycle on (see Definition 1.3).
Local Euler obstruction (see Definition 1.4).
Behrend function of at the origin, when is positive dimensional. (see Definition 1.2 and Definition 1.4).
Behrend function (Behrend number) of , when is zero-dimensional. (see Definition 1.2 and Definition 1.4).
Acknowledgements. The author thanks Michele Graffeo, Joachim Jelisiejew, and Andrea Ricolfi, for several discussions at the beginning of the project in 2021/2022. The author also thanks Hal Schenck for several helpful discussions in 2024. The author is grateful to Mark Gross for his support over the years. The author benefited from discussions with David Eisenbud, Barbara Fantechi, Rahul Pandharipande, Francisco Santos, Johannes Schmitt, Mike Stillman, Richard Thomas, Ajith Urundolil-Kumaran, Ravi Vakil, Andrzej Weber and Volkmar Welker. We thank Yunfeng Jiang, Andrea Ricolfi, Alessio Sammartano and Richard Thomas for comments on the final draft. This material is partially based upon work supported by the NSF under Grant No. DMS-1928930, while the author was in residence at SLMath (formerly known as MSRI) in Berkeley during the Fall 2022. The author was supported by the ERC Advanced Grant MSAG, the UKRI grant No. EP/X032779/1, and was partly in residence at ETH Zürich. The author thanks the Isaac Newton Institute for providing the space to discuss with the members of the program “New Equivariant Methods in Algebraic and Differential Geometry”. The rough ideas of the general subject were initiated when the author was partially supported by EPSRC grants EP/T015896/1 and EP/W522648/1. The author also acknowledges using GeoGebra [13] and Macaulay2 [12]. The codes in Appendix § 9 are duo to Mike Stillman, while visiting Cambridge in 2023. While searching for relevant recent results, we noticed a recent preprint, [21], on the zero-dimensional case; we acknowledge that our work is independent of it.
Definitions and Commutative algebra background
In this section, we give some basic definitions related to the original definition of the Behrend function. We also review some definitions and facts in commutative algebra that we need in the following sections. We first define the Behrend function as in [4 Definition 3.6, and Introduction].
Definition 1.1 (Degree of an ideal or a quotient ring). Throughout the paper, by degree of an ideal or a quotient ring, we mean the factorial of the (Krull) dimension of the ideal or the quotient ring, times the leading coefficient of the corresponding Hilbert polynomial.
We also use the term ‘degree’ for the corresponding affine or (quasi-)projective scheme.
Behrend function
We have the following original key definition.fire
Definition 1.2 (Behrend function, [4]). Let be a scheme over complex numbers. The Behrend function on is defined to be a constructible function
so that if the scheme is proper and embeddable, then for any symmetric obstruction theory on it with associated virtual count , we have
where is the virtual fundamental class, and is the weighted Euler characteristic.
To give a more precise definition of the Behrend function, we need to define the zero locus cycle associated with . We use the version in [4 Section 1.1].
Definition 1.3 (Distinguished cycle, [4]). For an ideal in , let be the normal cone of , with irreducible components of maximal dimension , and let . Let be the length of the normal cone at the generic point of . Then, there is a canonical projection . Now define
to be the unique integral cycle on (or the distinguished cycle on ).
We also need the notion of local Euler obstruction as originally defined in [19 Section 3]. We use the version defined in [4 Section 1.2].
Definition 1.4 (Local Euler obstruction, [4, 16]). Let be as in Definition 1.3. We define
More precisely, let be an embedding and . Let be local coordinate at . Also, define to be the smooth locus in and be a section defined by , where is the Grassmannian bundle of dimensional subspaces of over . Then, we can define to be the closure of the image of . Let , defined by restriction. Also, define the function to be ; so, the differential is a section of . Let be the pullback of under the embedding. Define and . We can then define
where and denotes the obstruction to extending as a non-zero section of from to .
Now, the Behrend function of as above (Definition 1.3) can be defined as (See [4 Definition 1.4])
Applying to 1.2, we get
We have the following properties for.
Lemma 1.5. [16, Definition 2.4],[19, Section 3], [22] We have
if is nonsingular at .
if .
.
If or Deligne-Mumford stack which is reducible at the point , and let are the irreducible components, then .
We give another definition for future reference.
Definition 1.6 (Dominating the support). We say that a maximum-dimensional irreducible component of dominates the support in .
Remark 1.7. Note that on a smooth point of , the value of equals . Thus, the value of the Behrend function is interesting only on the singular points of , which is the subject of this article.
If is a critical locus, its Behrend function has a particular enumerative geometric interpretation as in (3), and, in theory, can be computed as follows.
Lemma 1.8. [4 Section 1.2] If is a critical locus, i.e., if is the zero locus of , for some regular function on , then for any -valued point , we have
where the Milnor fibre of at .
Proof. See [20 Corollary 2.4 (iii)].
We devote the rest of the section to the commutative algebraic definitions.
Associated primes and primary decomposition
Definition 1.9. [1 Chapter 4] Let be a ring. An ideal in is primary if it is not equal to the whole ring and if , then either or , for some . If , then is called -primary.
Definition 1.10. [9 Section 3.1] Let be a ring and be an -module. A prime ideal in is called associated to if it is the annihilator of some .
The set of all prime ideals associated with is denoted by or .
Lemma 1.11. [9 Theorem 3.1] Let be a Noetherian ring and be a finitely generated -module. Then, is a finite non-empty set of primes, each containing the annihilator of . The set includes all primes minimal among primes containing .
If is a commutative ring, the minimal elements in are called isolated primes, and the non-minimal ones are called embedded primes.
Noether normalization
The following lemma, which is called Noether normalization lemma, is a version of it that we need later:
Lemma 1.12. [24 Lemma 10.115.4] For a field , and an -dimensional ideal , let . Then, there exist a polynomial ring and a finite injective homomorphism .
Normalization and convex hull
Definition 1.13. Let be a monomial ideal in . An element is integral if there are such that
The integral closure of a monomial ideal is denoted by and consists of all the integral elements as above. A monomial ideal is integrally closed if .
Definition 1.14. We define the geometric normal cone of an ideal in to be
Note that we may use the word normal cone for either or , interchangeably.
Note that minimal primes of , the defining ideal of , are equivalent to the maximal dimensional components of the normal cone .
Lemma 1.15. [9 Exercise 4.23], [14, Proposition 1.4.6] Let be a monomial ideal in , and be the set of exponents of monomials in . Let be the convex hull of , and be the set of integral points in . Then, the integral closure of is the ideal generated by .
Corollary 1.16. Let be a monomial integrally closed ideal in . Then, the restriction of to any non-empty subset of variables is still integrally closed.
Proof. By Lemma 1.15, there is a one-to-one correspondence between the normal cone of an ideal and the convex hull of the exponents. As the restriction of the convex hull to any non-empty subset of variables is still a convex hull, the same lemma implies the result.
The quotient formula: proof of the abstract version
In this section, we give a simple proof of Theorem A (see Theorem 2.1 below) using algebraic arguments. Then, in the following sections, we will see a geometric interpretation of this abstract version of the quotient formula.
Theorem 2.1. Let be an ideal in with minimum number of generators, and let . Then, for any -dimensional ideal in , and the origin as a singular point of , we have
where is the degree of the -primary decomposition component of maximal dimension, , of , and is the degree of , for , and . Also, are the maximal-dimensional irreducible components of , and is the canonical projection, and is the local Euler obstruction. Also, is the number of the irreducible components of the maximal dimension of , and is the number of the irreducible components of the maximal dimension of , dominating a -dimensional component of in .
Proof. Let , and . We can write as , where , and is an ideal in , and is the (minimum) number of generators of . We write , where is its -primary decomposition.
Let be the set of maximum-dimensional irreducible components of , corresponding to . Think of as the reduction of , and let be the set of corresponding irreducible components of . Since , the components correspond to . Since , from Noether normalization lemma (Lemma 1.12), there is a finite injective map
For , induces a free injection
where is the function field of . Taking Spec of the finite map reverses it to
and taking Spec of gives
Hence, the generic fibre of is given by , which has irreducible components corresponding to maximum-dimensional () irreducible components of , i.e., , for and . Therefore, the rank of the free map is .
Now, let be the local ring of at the defining ideal of ; hence, can be written as . Therefore, by taking the degree of the map , we can write the multiplicity, , as .
On the other hand, can be written as , where is the residue field of and is a finite extension over .
Since is not necessarily algebraically closed, it is not necessarily equal to its finite extension. The difference measures the difference between the multiplicity and the Behrend function as below.
Similarly as the case of multiplicity, the degree of can be written as
Note that by taking the residue field of , we obtain
Note that we can write , for some integers . From this, we have . Thus, .
Recall that, by our definition, is the degree of , and is the degree of ; i.e., is the contribution of to , and is the contribution of the degree of to . Now, from (10), for each fixed , for the component , we have
where is the length of at (the generic point of) .
Restricting to , we have . Also, in this case, we have the notation: , , , , , , and . Then, (11) becomes
where is the contribution of to each irreducible component of the normal cone, and the last equality comes from the definition of the Behrend number for the zero-dimensional case (see in (4) and (5)). Hence, for zero-dimensional (for which, the contribution of is 1 by Lemma 1.5), from (12), we have
Now, let , and with a singular point at the origin . Following Definition 1.3, let us consider the canonical projection . By definition 1.6, any maximum-dimensional irreducible component of the normal cone, , dominates its corresponding -dimensional support , for each and fixed . Note that since we assume that the origin is a singular point for , the components of are coordinate planes of possibly different dimensions (as in Remark 0.3). Hence, the general alternating sum in the formula comes from the formula for the cycle on introduced in Definition 1.3 (also, see [22 Section 2.2]), and also (11) and (13) above. This means that we have
as claimed.
Corollary 2.2 (Upper bound on the Behrend number). For any zero-dimensional ideal in and , we have
Proof. Note that . So by Theorem 2.1(iii), we obtain the result.
Minimisation
In this section, we introduce the notion of minimisation and apply it to give a more practical interpretation of the quotient formula for monomial ideals. This will also characterise monomial ideals for which the Behrend number is maximal (see Proposition 6.4).
Convention. In this section, we assume that the ideals have a minimum number of generators.
Definition 3.1 (Minimal ideal). We say that a monomial ideal with a minimum number of generators in is minimal if the removal of any mixed generator from it changes the multiplicity, that is, if , where could possibly be zero (if is of a dimension greater than zero), and are mixed monomial terms. Then,
for any omitted mixed term . The minimisation of , which is indicated by , is a minimal ideal with a minimal number of generators such that the set of its generators is contained in the set of the (minimal) generators of such that .
Equivalently, an ideal is minimal, if and only if .
The following lemma is a consequence of the definition:
Lemma 3.2. Let . Then
Now, we list some properties of minimisation in the following proposition, which are direct consequences of the combinatorial interpretation of minimisation in the following sections:
Proposition 3.3. Let be a monomial ideal in .
Minimisation preserves normalization: normalization of normalization of .
Normalization preserves minimisation: .
Minimisation preserves the number of maximal dimensional irreducible components of the normal cone of the ideal: .
An algorithm for minimisation
Let be an ideal minimally generated by monomials in , such that are mixed terms and possibly being zero for some (or all) . Also, suppose that is contained in the (minimal set of generators of the) normalization of for , and is not in the (minimal set of generators of the) normalization of for . Then, we have the following algorithm to find :
Remove all 's for , so that we are left with ,
Omit each one by one from and check if appears in the (minimal set of generators of the) normalization of . (a) if appears in the (minimal set of generators of the) normalization of
then mark to remove it after completing step (2) for each . (b) if does not appear in the (minimal set of generators of the) normalization of , then mark to keep it after completing step (2) for each . We rename such to .
The ideal generated by and the monomials in (b) is the (minimal set of generators of the) minimisation of ; i.e., , where .
Remark 3.4. Note that in step (2), ordering does not matter. We remove one at a time, check the process for it, and then return it and repeat the process for another .
Let us look at an example and apply the algorithm above:
Example 3.5. Let
be an ideal in . One can easily check that
and
Therefore, we have .
Combinatorial interpretation: background
This section provides a combinatorial background for giving a geometric interpretation of the quotient formula for monomial ideals. The first step is to correspond the monomial terms of a monomial ideal in to points in ; i.e., we have
where some can possibly be zero.
A combinatorial interpretation of the minimisation: determination of vertices in -boundary
We make a combinatorial sense of the abstract notion of minimisation introduced previously.
Definition 4.1 (()-boundary). For a minimal ideal with a minimal number of generators
in , where some can possibly be zero, the -boundary is the lower boundary of the unique convex hull generated by or , for and .
The existence and uniqueness of such a decomposition passing through any given finite set of points (after omitting unsuitable points) in is a well-known combinatorial fact; for example, see [8 Corollary 1.7]. The following proposition summarises this for zero-dimensional monomial ideals:
Proposition 4.2. Let be a zero-dimensional monomial ideal in , and let be the corresponding points (vectors) in associated with the exponents of the generators of . Then, for some , there exists a convex -boundary in with the maximum number of -polytopes (as lower facets of the corresponding convex hull) so that:
the vertices of the -polytopes cover all ’s
the vectors corresponding to the vertices of each -simplex generate an dimensional parallelepiped.
The following corollary shows that minimisation provides a way to present exactly the vertices of the -boundary:
Corollary 4.3. Minimisation removes the non-vertices monomials in the corresponding -boundary; i.e., minimal ideals only consist of vertices.
Proof. Without loss of generality, we consider the zero-dimensional monomial ideals in 2 variables. The proof for the general case is similar.
Let , be a monomial ideal, where , as in Figure 3. First, we note that if a monomial generator is not among the minimal generators of the normalization (which is the case for the mixed monomial term in Figure 3), then it will not appear on the boundary of the convex hull of the ideal; therefore, if the generators omitted in step (1) of the minimisation are not among vertices. For step (2), if we temporarily ignore a generator that is among the minimal generators of normalization but is not in the normalization of the rest of the generators, then that generator must be a vertex (this is the case for vertex in Figure 3(ii)).
Figure 3. The minimisation of is .
Finally, if the monomial is not a vertex but is on the lower boundary of the convex hull, then by definition it will be omitted in the minimisation process (This is the case for the mixed monomial generator in Figure 3(iii)).
As another corollary, we prove Theorem D:
Theorem 4.4. Let be an -dimensional monomial ideal with singularity at the origin. The maximal dimensional irreducible components of the normal cone of correspond to the polytope decomposition of the lower boundary of the convex hull of in each -coordinate plane for .
Proof. From [10 Section 3.3], we know that the rays of the associated fan to the normal cone correspond to the torus invariant exceptional divisors. Then, from [26 Corollary 2.53], these rays correspond to the maximal dimensional components of the normal cone. So, the way to construct a fan corresponding to the maximum-dimensional irreducible components of the normal cone is as follows. First, we start with the components dominating the origin, i.e., the ones embedded in the whole -space and part of the lower boundary of the convex hull there, and consider their corresponding -hyperplanes containing those components. Next, for the components dominating the axes we need to project the lower boundary of the convex hull onto the -coordinate planes, look at the restricted convex hull there and consider the -hyperplanes containing the components corresponding to the lower boundary of the convex hull there there. We continue this process and produce -hyperplanes containing the components corresponding to the lower boundary of the convex hull in coordinate planes of lower dimensions until we reach to the -coordinate plane(s). Note that if , then the corresponding -hyperplanes for the last step are parallel to some coordinate planes. See Figure 4 for and , in which the hyperplane (line) associated to
Figure 4. (i) The maximum-dimensional components of the normal cone associated to . (ii) The fan generated by the orthogonal rays to the maximum-dimensional components. See the proof of Theorem 4.4
::: the projection onto the -axis is the line , which is parallel to the -axis (as a coordinate plane).
After constructing all the hyperplanes, the orthogonal vectors to them (which determine a fan) determine the divisors representing the maximal dimension irreducible components of the normal cone. This also aligns with [11 Theorem 5.13] for and .
Now, we present a 3D examples for a better visualization.
Example 4.5. Let be an ideal in . In Figure 5, apart from the hyperplane containing the triangle of the generators, there are three non-coordinate hyperplanes. Hence, the fan of the normal cone in has four rays corresponding to four maximal dimension irreducible components of the normal cone. Also, see Example 6.7.

Figure 5. The lower boundary of the convex hull of the normal cone of has four component corresponding to the illustrated four non-coordinate planes. See Example 4.5
A combinatorial version of the quotient formula
Volume interpretation
In this sub-section, we interpret the ingredients of the quotient formula in terms of the information about the corresponding parallelepipeds. Note that using this interpretation, we can directly compute the Behrend number without using the quotient formula. First, we have the following straightforward lemma.
Lemma 5.1. Let be a Noetherian ring and let be minimal primes in . Let be a -primary ideal corresponding to with maximal dimension. Then, we have
where , where is the polynomial ring in the Noether normalization lemma (Lemma 1.12).
Theorem 5.2. Let be a monomial ideal of dimension in , and let be the origin as a singular point of . Then
where is a triangulation of , where the latter is the projection of onto the -coordinate plane for every fixed . Also, are the maximal-dimensional irreducible components of , and is the canonical projection, and is the local Euler obstruction. Also, corresponds to an irreducible component of the normal cone with maximal dimension, dominating a -coordinate plane component of in .
In particular, if is zero-dimensional, we have
where is a -polytope corresponding to each irreducible component, and are the maximal-dimensional irreducible components of .
Proof. From the proof of Theorem 2.1 and Theorem 4.4, the irreducible components of maximal dimension of the normal cone of are given by the maximum-dimensional components of the component corresponding to the -primary decomposition of the defining ideal of . To compute this using Macaulay2, see Appendix § 9. These components dominate the -coordinate plane(s), which are projected onto the -coordinate planes for .
Let . We follow the notation in the proof of Theorem 2.1. For volume interpretation, we correspond each monomial term in to a point in (which can be thought of as a point in ). Note that for a monomial ideal , the number is the number of components (polytopes) in the lower boundary of the convex hull . The defining hyperplanes of the components of the lower boundary of the convex hull can be seen as orthogonal hyperplanes to the rays of associated toric fan, and each ray corresponds to an exceptional divisor of , where is the origin as a singularity point of . So, by Theorem 4.4, there is a one-to-one correspondence between the irreducible component of the normal cone corresponding to and the lower boundary of the irreducible components of the convex hull of .
Following the notations in the proof of Theorem 2.1 and Lemma 5.1, we have
where is a -primary, so that are minimal primes in .
Let be an embedding from into some , where . Note that contains the lattice , which in turn contains the sub-lattice , since . Now, since the maximal dimension components of the normal cone correspond to , then maps to a an ideal lattice .7 Hence, is an additive isomorphism on . Since is -dimensional, is a sub-lattice of (which, in turn, is a sub-lattice of ) generated by the points in corresponding to the lower boundary component of the convex hull of associated to .
Therefore, using Theorem 4.4, under , the restriction of to the -th component of the normal cone, , is
as is -primary, for minimal (isolated) prime.
The key point here is that is the gcd of all possible (normalised) volumes of -simplices associated to , considering the associated points plus the origin (by [7 Lemma 2.4]; also it can be obtained from the proof of [25 Theorem 2.2]). Hence, they are volumes of corresponding parallelepipeds.
For , first note that if is a sub-lattice of , and is a sub-lattice of , then (by a straightforward argument in [7 Lemma 2.3(1)]). Now, let be as above and be a sub-lattice of generated by vertices of any fixed triangulation of ’s into -simplices. By a similar argument as above, and from the proof of Theorem 2.1, we have
As , we have the result.
Finally, for the degree of the special fiber, we note that
Therefore
hence
For , to evaluate the Behrend function at the origin, we need to consider the alternating sum based on the dimension of the maximal dimensional irreducible component of the normal cone to obtain the formula. Using Corollary 1.16 and also from the proof of Theorem 2.1, and the projection , for each and fixed , we know that dominates the corresponding -dimensional support in . For monomial , this means that the support can be viewed as the projection of onto the corresponding -dimensional complement coordinate plane. Hence, the length is basically the (gcd of the) volume(s) of the parallelepiped(s). This gives us the desired formula. □
Remark 5.3. One can use the existing algorithms for the convex hulls in higher dimensions (for example, see [2] and [3]).
Examples
In this section, we provide examples of different flavours and calculate the Behrend function using our main results. Note that in all the examples, we have we always have . So, the contribution of the local Euler obstruction will not appear in the formulas.
Zero-dimensional examples
Let us look at some examples and directly compute the Behrend number:
Example 6.1. Let be a zero-dimensional ideal in and let . From Theorem 5.2, we have .
Example 6.2. Let

Figure 6. The monomial term is removed in the minimisation process, but it plays a role here as it is contained in the lower boundary of the convex hull, and it gives two polytopes, each with an associated parallelepiped of volume 24.
be a zero-dimensional ideal in and let . By Theorem 2.1, we have
More directly, from Theorem 5.2, we have
See Figure 7.

Figure 7. The monomial terms are removed in the minimisation, but they play a role in the Behrend function calculation as they are on the lower boundary of the convex hull. See Example 6.2.
Example 6.3. Let
be an ideal in and let . Then, we have
As mentioned above, we can compute the Behrend number as follows.
See Figure 8.

Figure 8. The colored L-shape area indicates for one of the corresponding components. The length of each diagonal over the smallest possible length piece of the diagonal is (hence in the pictured component, we have = the number of coloured squares, and ). See Example 6.3.
Maximal Behrend number
We characterise the zero-dimensional monomial ideals with the maximum possible Behrend number (i.e., zero-dimensional ideals in with , where ):
Proposition 6.4. A zero-dimensional monomial ideal in has a maximal Behrend number if and only if the -boundary of consists only of -simplices and the possible removed monomials in the minimisation process lie strictly above the -boundary.
Proof. Assuming the conditions in the statement and from the proof of Theorem 5.2, we observe that there is only one option for the associated with each , which is the volume of the parallelepiped over itself. So, is trivial and maximal, which in turn gives the maximal Behrend number.
Example 6.5. Let
be a zero-dimensional ideal in and . One can easily check that the associated 2-polytope (or polygon) decomposition only consists of triangles, and the monomials , and , which are removed in the minimisation process, lie strictly above the lower boundary of the associated convex hull. Therefore, by Proposition 6.4, has maximal Behrend number (). See Figure 9.

Figure 9. The red points corresponding to the removed monomials are strictly above the surface (lower boundary of the convex hull)
Higher dimensional examples
We see a couple of examples of the Behrend function for the higher-dimensional monomial affine subschemes of and , respectively.
Example 6.6. Let be a one-dimensional ideal in , and . Then, by Theorem 5.2, the Behrend function at the origin (as a singularity of ) is
See Figure 10.
Figure 10. (1) The convex hull for . (2) The volume of the two-dimensional parallelogram is 4. (3) The projection on the and axes gives the lengths 1 and 2, respectively.
Example 6.7. Let , and . Then
This comes from Theorem 5.2:
This can be generalised to any number of variables , with , for which we have . A particular example of and is discussed in [22 Example 2.5]. This can also be checked by Lemma 1.8.
A non-monomial example
We provide an example of a non-monomial zero-dimensional ideal in two variables that also fits for using results in [11].
Example 6.8. Let
be a 0-dimensional ideal in and . Then, we can use the M2 codes in Appendix § 9 to calculate the ingredients of the quotient formula and calculate the Behrend function
To double-check our answer, as this is a 0-dimensional ideal in two variables for which also the conditions of [11 Theorem 3.17 (2)] hold, we can write , where and and conclude that , by [11 Theorem 3.17 (2)].
Why does minimisation preserve multiplicity?
As we saw in this section, the multiplicity is the sum of the volumes of parallelepipeds spanned by (sub)-simplices of each -boundary associated with each monomial ideal. Without loss of generality, we answer the question for . To answer the question, we need to check it for each , i.e., for the parallelogram generated by vectors and , for each . For the sake of simplicity, we restrict to two dimensions, and the argument could be easily generalised to higher dimensions. Let be an ideal in , so that the parallelogram produced by two of the successive generators of is as in Figure 11.

Figure 11.
Now, assume that there is a removed generator on the smaller diagonal of the parallelogram, which is removed in the process of minimisation. Associated to such a point, there are two smaller parallelograms as in Figure 12.

Figure 12.
We want to show that the area of the parallelogram generated by the vectors and is equal to the sum of the areas of the parallelograms generated by and , on the one hand, and and , on the other hand. We denote the area of the parallelogram generated by vectors and by . First note that the line from the point to the point is given by the following equation in the plane:
As the point is on this line, we have
Therefore, we have
as desired.
Appendix A. A generalised Pick’s Theorem
The argument in this section can be written without any mention of the Behrend function. However, as we use a similar combinatorial spirit as of the Behrend function for monomial ideals, we put the result here.
Behrend function in terms of the equations of the lower boundary of the convex hull in three dimensions
We have the following lemma to recover the contribution of the Behrend function on each component from the equation of the plane containing the polygon.
Theorem A.1. Let be a monomial ideal in that is singular at the origin, and let . Then, for any polygon in the lower boundary of the convex hull of , we have
where is the contribution of the Behrend function evaluated at the origin (considering with a suitable sign), and is the constant term of the primitive equation of the plane defined by .
Proof. Let be the primitive8 equation of the plane defined by . We only need to restrict to the case when the polygon is just a -simplex, and the only lattice points on it are just the vertices. From Theorem 5.2, we have
If are the vertices (as in the Figure 13 for and setting and ), then we have

Figure 13.
where is the distance of the origin from , which is equal to
On the other hand, , where is the normal vector to . It is straightforward to check that by our assumption, we have , in this case. Hence, we have
Example A.2. Let be a zero-dimensional ideal in . Using Theorem A.1, we can see that the defining equation of the three planes containing the irreducible component of the normal cone of are , and . Hence, the Behrend number is . See Figure 14. Note that this is the example in [11 Section 7] where the authors introduce to show the difficulties in three dimensions.
Figure 14. (1) The irreducible components of the normal cone of . (2) The corresponding defining planes.
Pick’s Theorem for embedded polygons
We prove a generalised version of Pick’s theorem for embedded polygons in . The classical Pick’s theorem states the area of a plane polygon in terms of the number of the lattice points inside and on the boundary of the polygon. First, we need the following definition and lemma.
Definition A.3 (Fine triangulation). A fine triangulation for a polygon, is an integral triangulation (i.e., the vertices of all the triangles are lattice points) with the maximum number of triangles.
Definition A.4 (Empty simplex/empty triangle). An empty -simplex is a simplex with lattice points only on the vertices. An empty -simplex is an empty triangle.
Lemma A.5. Let be a polygon in the primitive plane , and let be the number of internal lattice points and the number of lattice points on the boundary of , respectively. Then
the number of empty triangles in a fine integral triangulation of .
Proof. Without loss of generality, and up to transformations, we can assume that . We proceed by induction on the number of lattice points which are not vertices. The base case is when a empty triangle, for which we have , hence , which is obviously the number of empty triangles in . Now, let be a polygon with at least one non-vertex lattice point, and let be a polygon purely inside with lattice points on its boundary and internal lattice points, and we can assume that the statement holds for and we want to show that is also the number of empty triangles in . See Figure 15Figure 1.
Figure 15. (1) Proof by induction. (2) Any lattice point between and adds two additional empty triangles.
If there is no lattice point between and , then there are empty triangles between and : set and . Then there are (potentially, degenerate or concave) quadrilaterals with two sides of it being a side of and a side of . This gives empty triangles. On the other hand, for each remaining side, there exist a unique triangle. Totally this gives empty triangles between and . Now, note that each lattice points between and adds two more empty triangles to (see Figure 15Figure 2); i.e., there are totally empty triangles between and . Combining this with the induction hypothesis (the number of empty triangles in is ), we conclude that there are
empty triangles in , as claimed.
Note that the result holds for every plane in , since linear transformation of planes in preserves the lattice points and empty triangles.
Example A.6. Figure 15 shows two examples related to Lemma A.5, for , (left) and , (right).
Now, we can prove a generalised version of Pick’s Theorem:
Theorem A.7. Let be a plane convex polygon with some non-lattice vertices so that it can be integrally and generically embedded in , i.e., there is an embedding of into with all vertices lattice points so that it is not perpendicular to any of the three coordinate planes. Let and be the number of internal lattice points and the number of lattice points on the boundary of the embedded polygon in , respectively. Then
where is the primitive equation of the plane defined by the embedded polygon in , and is primitive, and .
Proof. From the proof of Theorem A.1 for , the volume of each empty triangle in with primitive equation is , and from Lemma A.5, the number of such empty triangles in is . Combining these implies the claim.
Macaulay2 codes
The codes in this appendix are due to Mike Stillman in April 2023. The codes compute the ingredients of the quotient formula for a given ideal, which defines our affine scheme. Here, we consider the example of the one-dimensional subscheme of defined by the ideal . Here, L is the same as in the proof of Theorem 2.1, and Qs is the same as or , and Ps is the same as or (as in the proof of Theorem 2.1).
R=QQ[x,y,z];
I=ideal (x*y,y*z,x*z);
J=trim I;
R1 = normalCone J;
S = first flattenRing R1;
Rsg = (coefficientRing S)[gens S];
L = sub(trim ideal S, Rsg);
Qs = primaryDecomposition L;
maxdim = max (Qs/dim);
Qs = select(Qs, q -> dim q == maxdim);
Ps = Qs/radical;
Qs/degree
Ps/degree
References
Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, CB3 0WA, Cambridge, United Kingdom
Email address: [email protected]
References
- [1]M. F. Atiyah and I. G. MacDonald, Introduction to commutative algebra, Addison-Wesley Publishing Company, 1969. 2. D. Avis, D. Bremner, and R. Seidel, How good are convex hull algorithms?, Computational Geometry: Theory and Applications 7 (1997), no. 5-6, 265–301.
- [3]C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software 22 (1996), no. 4, 469–483.DOI
- [4]K. Behrend, Donaldson–Thomas type invariants via microlocal geometry, Ann. of Math. 2 (2009), no. 170, 1307–1338.DOI
- [7]M. Blanco and F. Santos, Non-spanning lattice 3-polytopes, Journal of Combinatorial Theory, Series A 161 (2019), 112–133.DOI
- [8]W. Bruns and J. Gubeladze, Polytopes, rings, and K-theory, Springer, 2009.
- [9]D. Eisenbud, Commutative algebra, Graduate Texts in Mathematics, vol. 150, Springer-Verlag, 1995.
- [10]W. Fulton, Introduction to toric varieties. (AM-131), Princeton University Press, 1993.
- [11]M. Graffeo and A. T. Ricolfi, On the Behrend function and the blowup of some fat points, Advances in Mathematics 415 (2023).arxiv.org/abs/2202.06904
- [12]D. Grayson and M. Stillman, Macaulay2, a software system for research in algebraic geometry, http://www.math.uiuc.edu/Macaulay2/.
- [13]M. Hohenwarter, M. Borcherds, G. Ancsin, B. Bencze, M. Blossier, J. Élías, K. Frank, L. Gál, A. Hofstätter, F. Jordan, Z. Konečný, Z. Kovács, E. Lettner, S. Lizelfelner, B. Parisse, C. Solyom-Gecse, C. Stadlbauer, and M. Tomaschko, GeoGebra 5.0.507.0, October 2018, http://www.geogebra.org.
- [15]J. Jelsiejew, M. Kool, and R. F. Schiemann, Behrend’s function is not constant on Hilbⁿ(C³), Geometry & Topology 29 (2025), no. 8, 4469–4476.
- [16]Y. Jiang, Note on macpherson’s local euler obstruction, Mich. Math. J. 687 (2019), no. 2, 227–250.arxiv.org/abs/1412.3720
- [17]D. Joyce and Y. Song, A theory of generalized Donaldson-Thomas invariants, Mem. Amer. Math. Soc. 217 (2012), no. 1020, iv+199.arxiv.org/abs/0810.5645
- [18]V. Lyubashevsky, C. Peikert, and O. Regev, On Ideal Lattices and Learning with Errors over Rings, Advances in Cryptology – EUROCRYPT 2010. Lecture Notes in Computer Science 6110 (2010).
- [19]R. MacPherson, Chern class for singular algebraic varieties, Ann. Math. 100 (1974), no. 2, 423–432.DOI
- [20]A. Parusiński and P. Pragacz, Characteristic classes of hypersurfaces and characteristic cycles, J. Algebraic Geom. 10 (2001), no. 1, 63–79.DOI
- [21]C. Polini, A. Sammartano, and B. Ulrich, Behrend function and blowup algebras, arXiv:2608.04713 (2026).arxiv.org/abs/2608.04713
- [22]A. T. Ricolfi, A sign that used to annoy me, and still does, J. Geom. Phys. 125 (2023).arxiv.org/abs/2306.08457
- [23]L. Si, Pick’s Theorem in Two-Dimensional Subspace of ℝ³, The Scientific World Journal (2015).DOI
- [24]The Stacks project authors, The stacks project, https://stacks.math.columbia.edu, 2024.
- [25]R. P. Stanley, A zonotope associated with graphical degree sequences, Applied Geometry and Discrete Math. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4 (1991), 555–570.DOI
- [26]S. Telen, Introduction to toric geometry, arXiv:2203.01690 (2022).arxiv.org/abs/2203.01690




