Minimal log discrepancies of determinantal varieties via jet schemes
Devlin Mallory

TL;DR
This paper calculates the minimal log discrepancies of determinantal varieties and related pairs, confirming a conjecture and providing explicit formulas using jet schemes, which advances understanding in algebraic geometry.
Contribution
It introduces explicit computations of minimal log discrepancies for determinantal varieties and pairs, confirming the semicontinuity conjecture using jet scheme techniques.
Findings
Confirmed semicontinuity conjecture for these pairs
Provided explicit generators for canonical forms and Nash ideals
Enhanced understanding of jet scheme computations in determinantal varieties
Abstract
We compute the minimal log discrepancies of determinantal varieties of square matrices, and more generally of pairs consisting of a determinantal variety (of square matrices) and an -linear sum of determinantal subvarieties. Our result implies the semicontinuity conjecture for minimal log discrepancies of such pairs. For these computations, we use the description of minimal log discrepancies via codimensions of cylinders in the space of jets; this necessitates the computations of an explicit generator for the canonical differential forms and the Nash ideal of determinantal varieties, which may be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Minimal log discrepancies of determinantal varieties
via jet schemes
Devlin Mallory The author was supported by NSF Graduate Research Fellowship grant DGE-1256260, as well as partially supported by NSF grant DMS-1701622.
Abstract
We compute the minimal log discrepancies of determinantal varieties of square matrices, and more generally of pairs \bigl{(}D^{k},\sum\alpha_{i}D^{k_{i}}\bigr{)} consisting of a determinantal variety (of square matrices) and an -linear sum of determinantal subvarieties. Our result implies the semicontinuity conjecture for minimal log discrepancies of such pairs. For these computations, we use the description of minimal log discrepancies via codimensions of cylinders in the space of jets; this necessitates the computations of an explicit generator for the canonical differential forms and the Nash ideal of determinantal varieties, which may be of independent interest.
1 Introduction
Let be a normal -Gorenstein complex algebraic variety and a formal -linear sum of subvarieties . The minimal log discrepancy is a measure of the singularities of the pair along a subvariety , and its behavior, although subtle, is quite important for the minimal model program. In particular, minimal log discrepancies were used by Shokurov [Sho04] to study termination of flips; he showed that semicontinuity of as varies over the closed points of , together with the ascending chain conditions on minimal log discrepancies, would imply termination of flips.
Semicontinuity is not known in general, but has been shown in the following situations:
- •
For varieties of dimension at most 3 and toric varieties of arbitrary dimension [Amb99].
- •
If the ambient variety is smooth or lci [EM04, EMY03].
- •
If has only quotient singularities [Nak16].
The latter two results were both proved using jet schemes, and as far as we know no proofs are known which avoid the use of jet schemes.
In this paper, we use jet schemes to compute minimal log discrepancies on determinantal varieties of square matrices, which fall outside the aforementioned cases (see the beginning of Section 3). Let be the locus of -matrices of rank . We obtain the following description of the minimal log discrepancies of :
Theorem 1.1**.**
If is a matrix of rank exactly , then
[TABLE]
Moreover, we have
[TABLE]
Note that this recovers the fact that has terminal singularities for any .
Remark 1.2**.**
We restrict our attention to the case of square matrices because it is the only setting in which is -Gorenstein (see Section 3).
More generally, we consider pairs of the form \bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\bigr{)} for (possibly zero). We compute when these pairs are log canonical, and moreover compute their minimal log discrepancies:
Theorem 1.3**.**
Consider the pair \Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)} (where the may be zero).
- (1)
\Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)}* is log canonical at a matrix of rank exactly when*
[TABLE]
for all . 2. (2)
In this case,
[TABLE] 3. (3)
\Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)}* is log canonical along (for ) exactly when*
[TABLE]
for all . 4. (4)
In this case,
[TABLE]
This immediately implies semicontinuity of the minimal log discrepancy for such pairs (when the coefficients are nonnegative):
Corollary 1.4** (semicontinuity).**
If are nonnegative real numbers, the function w\mapsto\mathop{\operator@font mld}\nolimits\bigl{(}w;D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\bigr{)} is lower-semicontinuous on closed points.
Our work is by no means the first application of jet schemes to the calculation of invariants of determinantal varieties: Docampo [Doc13] uses jet schemes to compute the log canonical threshold of pairs , the irreducible components of the truncated jet schemes , and the topological zeta function of the . Our application of jet schemes to the minimal log discrepancies of the determinantal varieties draws heavily from his methods there.
To calculate these minimal log discrepancies, we use the characterization of [EM09] of minimal log discrepancies in terms of codimensions of various “multicontact” loci in the space of jets. To apply this characterization we need two main ingredients:
- •
Our computation of the Nash ideal of (up to integral closure).
- •
Our calculation of the codimension of the -orbits in the jet scheme .
The decomposition of the jet scheme into orbits of the natural group action of is due to [Doc13], and our calculation of the codimension of these orbits in is inspired by the methods of his paper.
The paper is organized as follows: In Section 2 we briefly recall the definitions of jet schemes, as well as the notion of cylinders in the space of jets and their codimensions; we also recall the definition of minimal log discrepancies and their interpretation as codimensions of cylinders in the jet space. We then review some basic properties of determinantal rings in Section 3, as well as the straightening law on a determinantal ring. In Section 4 we describe the Nash ideal of a determinantal ring, and in Section 5 we actually compute minimal log discrepancies and prove the consequences noted above.
Acknowledgements
I would like thank Karen Smith and Mel Hochster for useful conversations on canonical differential forms and determinantal rings, respectively. I am especially grateful to my advisor Mircea Mustaţă for many crucial conversations and suggestions on this project. I would also like to thank Robert Walker for very helpful comments on an earlier draft of this paper.
2 Jet schemes and discrepancies
We recall some basic definitions and results on jet schemes; for a general treatment of the basic theory see [Voj13], and for an overview of their application to birational geometry and the study of singularities see [EM09]. Let be a field and let be a finite-type -scheme. For each consider the functor
[TABLE]
from -schemes to sets. As is well-known, this functor is representable by a -scheme , the jet scheme of . Moreover, each is a finite-type -scheme. A -point is called an -jet on .
The truncation maps for induce morphisms , which are easily checked to be affine, so we obtain an inverse system of affine morphisms. We can thus form the inverse limit, which we denote by and call the jet scheme of ( is also called the arc scheme of ). In contrast to the -jet schemes , is never of finite type over (unless is 0-dimensional).
2.1 Cylinders in the space of jets and their codimension
Fix an arbitrary finite-type -scheme .
Definition 2.1**.**
A cylinder in is a set of the form for a constructible subset.
Remark 2.2**.**
Note that cylinders are closed under finite unions, finite intersections, and complements.
Let be an ideal sheaf. For a -point , we write for the value obtained by pulling back the ideal along and applying the -adic valuation.
Definition 2.3**.**
We define the contact loci along as
[TABLE]
Note that these are cylinders in : we can write
[TABLE]
where is the -st jet scheme of the subscheme , which is naturally a closed subscheme of . Since
[TABLE]
it is a cylinder as well.
Given some subvarieties and some -tuple , we write ; we refer to such intersections of contact loci as multicontact loci.
We will need the following lemma on invariance of contact loci under integral closure:
Lemma 2.4**.**
If is a finite-type -scheme, an ideal sheaf, and its integral closure, then and .
Proof.
Clearly the first claim implies the second, since for any ideal . The first claim is local on , so let and be the ideal in question.
First, note that given any inclusion of ideals we have an inclusion
[TABLE]
if then , so that ; thus implies that .
We thus have the inclusion . For the reverse inclusion, say that , and write for the semivaluation associated to . Suppose that there is such that . Since is integral over , we can write
[TABLE]
with . We then have that
[TABLE]
Note that , and since . Thus, each . We then have
[TABLE]
for some , and thus , a contradiction. ∎
We now turn to the notion of codimension of a cylinder; for this, we specialize to the case where is a field of characteristic 0, although much of this section can be adapted to any characteristic. Assume moreover that is of pure dimension over .
Definition 2.5**.**
The Jacobian ideal of , denoted is the -th Fitting ideal of the Kähler differentials .
This can be described locally as follows: if , then is generated by the image of the -minors of in .
The contact loci along the Jacobian ideal are of particular importance in what follows. Given any cylinder we will write .
Definition 2.6**.**
Let be a cylinder. If , then we define
[TABLE]
for any .
If is an arbitrary cylinder in , we define
[TABLE]
Remark 2.7**.**
Some comments on this definition are in order:
- •
By definition, we may write any cylinder as for some and .
- •
The codimension is a nonnegative integer. This is not trivial; for details, see [EM09, Section 5].
- •
The fact that for the quantity
[TABLE]
is independent of the choice of follows from the study of the truncation morphisms on the space of jets (see [EM09, Theorem 4.1]).
- •
It is clear that .
- •
When is smooth, the codimension in the above sense of a cylinder coincides with its topological codimension.
We introduce the following lemma to facilitate computation of codimensions of spaces of jets without having to calculate or the contact loci along it explicitly:
Lemma 2.8**.**
Given any cylinder , not necessarily contained in some , we have
[TABLE]
for .
Note that this does not give an explicit bound on how large we must take ; in our applications here, the quantity
[TABLE]
will be seen to be independent of for directly.
The key ingredient in the proof of the lemma is the fact that ; for a proof, see [EM09, Proposition 5.11].
Proof.
Say . Since , there is such that for all . Write
[TABLE]
It is then immediate that and .
Since by the usual properties of dimension
[TABLE]
it is immediate that
[TABLE]
for . Thus, all we need to show is that for ,
[TABLE]
or equivalently that
[TABLE]
Fix . We can write
[TABLE]
Since the quantity is finite and bounded (e.g., by ) we must have
[TABLE]
for some .
Now, if , we would have
[TABLE]
and thus we would have some such that
[TABLE]
contradicting our earlier choice of . ∎
2.2 The Nash ideal
There is another ideal sheaf defined on a normal Gorenstein variety , similar to but distinct from the Jacobian ideal, which plays an important role in the relation between jet spaces and discrepancies: the Nash ideal.
Recall that on a normal variety of dimension the canonical sheaf can be defined equivalently as either , the pushforward of the canonical bundle on the smooth locus, or as , the reflexification of the -th exterior power of the Kähler differentials. A section of will be called a canonical differential form on . For more details on these definitions and their equivalence see [Rei87] or [Sch]. There is then in particular a natural map .
Definition 2.9**.**
Let be a normal Gorenstein variety of dimension . Because is Gorenstein, the image of the natural morphism
[TABLE]
is a coherent subsheaf of the invertible sheaf . This image then defines an ideal sheaf of (obtained by tensoring the image by ); this ideal sheaf is called the Nash ideal sheaf of , which we will denote by .
Note that the support of the Nash ideal is contained inside . If is lci, then , but in general they differ (see [EM09, Section 9.2] for details on their relation).
Remark 2.10**.**
By [SSU02, Section 2] and the references cited there, if for a graded ring, then the morphism
[TABLE]
is homogeneous. If is Gorenstein as well, then we have for some uniquely determined , and thus the Nash ideal will be homogeneous. For more on the canonical modules of graded rings, see [GW78, Chapter 2.1]
2.3 Discrepancies and the jet space
Here we recall briefly the notion of log discrepancy and the minimal log discrepancy. Our approach follows that of [EM09], to which we refer for a comprehensive treatment of this material. For this section, we will take to be a normal -Gorenstein variety over an algebraically closed field of characteristic 0; we let be a formal -linear combination of proper closed subschemes . We refer to as a pair.
Definition 2.11**.**
Let be a divisorial valuation of with (nonempty) center on . The log discrepancy of with respect to the pair is the real number
[TABLE]
where is a birational morphism from a normal variety such that the center of on is a divisor. One can check that this is independent of the choice of normal model .
Definition 2.12**.**
The minimal log discrepancy of the pair along a closed subset , denoted , is defined to be
[TABLE]
If we consider a pair , we will just write for . (If one must make the convention that if then it is ; this is automatic in higher dimension. We will not treat the 1-dimensional case at all in the following, so this issue will not arise.)
Definition 2.13**.**
If (and thus ) we say the pair is log canonical along . We say is terminal if for every exceptional divisor over ; since smooth varieties have terminal singularities, this is equivalent to the condition , where is the singular locus of .
The semicontinuity conjecture for minimal log discrepancies is the following:
Conjecture** ([Amb99]).**
Let be a pair with the coefficients of positive. Then the function
[TABLE]
is lower-semicontinuous on the closed points of .
Recall that lower-semicontinuity is equivalent to the set of points where being open for any . The relation between minimal log discrepancies and jet spaces is expressed through the following formula of Ein and Mustaţă:
Theorem 2.14** ([EM09, Theorem 7.4]).**
Let be a pair, with normal Gorenstein, , and a proper closed subset. Then
[TABLE]
3 Determinantal rings
In this section we work over a field of arbitrary characteristic. Let be an matrix of indeterminates, and let be the polynomial ring on these indeterminates. For we define the -th determinantal ideal to be the ideal generated by all minors of . We write for the corresponding quotient ring (note the difference in index here), so that is the coordinate ring of the matrices of rank ; we write for . In what follows we will assume , since is just a point.
We record here some of the known properties of :
- •
is a prime ideal, so is a domain.
- •
has dimension , and thus has codimension .
- •
[HE71] is normal and Cohen–Macaulay.
- •
[BV88, Section 8] is Gorenstein if and only if either or ; is -Gorenstein if and only if it is Gorenstein.
- •
is lci only when or : this follows easily by comparing the codimension of and the number of minors (which are homogeneous and thus by linear independence form a minimal generating set for ).
- •
The singular locus of is .
Since the (usual) notions of log discrepancies are specific to the -Gorenstein case, after this section we will assume that , i.e., we work with square matrices only.
3.1 The straightening law and an elementary consequence
We recall the straightening law on and from [dCEP80], and then use it to prove an elementary proposition we will make use of later. This material will be used only for the calculation of the Nash ideal in Section 4.
Definition 3.1**.**
A Young diagram corresponds to a nonincreasing sequence of integers , and should be visualized as a set of left-justified rows of boxes of lengths . We consider only Young diagrams with . A Young tableaux is a filling of a Young diagram with the integers . We write to indicate the underlying diagram has shape . The filling is standard if the filling is nondecreasing column-wise and strictly increasing row-wise. The content of a tableaux is the function taking a number to the number of times appears in . A double tableaux is a pair of Young tableaux with ; we say is standard if and only if and are both standard.
We partially order Young diagrams via the dominance order: if and only if
[TABLE]
for all .
We partially order Young tableaux as follows: given tableaux we say when for any the first rows of contain fewer integers than the first rows of . By [dCEP80, Lemma 1.5], this refines the ordering on Young diagrams. We partially order the double tableaux by saying that when and .
To a double tableaux with the rows of and having no repeated entries, we can associate a monomial in the minors of as follows: for each row of and , say of length , we view the entries in that row as the row and column indices specifying an minor of . We then multiply the resulting minor from each row to obtain a monomial in the minors, which we will write (this notation is nonstandard). When we write , we will implicitly assume that and have no repeated entries in any row. We will refer to as a double tableaux, but note that the same monomial can arise from different double tableaux (i.e., any permutation of the rows gives the same monomial).
Example 3.2**.**
Say . The double tableaux
[TABLE]
corresponds to the monomial
[TABLE]
We will make use of the following straightening law; for context and a proof see [dCEP80, Section 2]:
Theorem 3.3** (straightening law).**
If is a double tableaux we can write
[TABLE]
with each standard, , , , and with the content of each equal to that of . Moreover, the double standard tableaux form a free -basis for .
It is then a standard corollary (see, e.g., [Bae06, Proposition 1.0.2]) that also has a straightening law, induced by the one on . We will abuse notation and write for the image in of the monomial ; note that given a nonzero monomial , we have in exactly when no row of is of length . We say the image of in is standard if is.
Corollary 3.4**.**
If is a nonzero double tableaux in (so no row of has length ) we can write
[TABLE]
with each standard, , , , and with the content of each equal to that of , and with no row of any of length . Moreover, the double standard tableaux with no row of length form a free -basis for .
We now establish an elementary consequence of the straightening law on , which we will need for our calculation of the Nash ideal in Section 4. We write for the -subalgebra generated by images of the minors, and give the grading induced by (so is generated in degree ). Let be the image of the minor arising as the determinant of the first rows and first columns.
Proposition 3.5**.**
If is a homogeneous element of with , then .
We’ll set . Since , we have that . Say for some ; note that then.
We prove the following lemma first:
Lemma 3.6**.**
Let be of degree . If we expand in the standard basis on , say , then each has shape (with entries).
Proof.
By assumption, is a -linear sum of monomials of shape
[TABLE]
that is, corresponding to (double) Young diagrams of shape
[TABLE]
It thus suffices to show the result for such monomials. The only issue is that they may not be standard monomials. If some monomial is not standard, we apply the straightening law (in ) to write
[TABLE]
with having the same content (and thus the same degree). Let , . Note that for to dominate , it would have to have at least entries in each row; however, if it had entries in any row it would be zero in , and thus we must instead have . ∎
Proof of Proposition 3.5.
Expand in the basis of standard monomials, say with , standard of degree with no row of any of length . The key observation is that each product of monomials
[TABLE]
occurring in will again be standard. We take the standard-basis expansion of , say , as well, obtaining
[TABLE]
Since by our preceding lemma the right side has all monomial terms of shape , the same must be true for the left side as well, i.e., each is of shape (with entries). But this implies immediately that is of shape (with entries) as well, and thus is a degree- monomial in the minors. ∎
3.2 -orbits action on the jet spaces
We briefly recall here from [Doc13] the induced action of on the jet spaces of determinantal varieties. For now, we specialize to the case where . One can think of jets on as -matrices of power series, and jets on as -matrices of power series whose minors are zero.
For each , acts on , so there is an induced action of on and on for all . We need one notion before we continue:
Definition 3.7**.**
An extended partition of length is a nonincreasing -tuple of elements of .
The following gives an explicit description of the -orbits of , and of those which lie in :
Theorem 3.8** ([Doc13, Proposition 3.2]).**
-orbits in are in bijective correspondence with extended partitions of length , under the correspondence sending to the -orbit of the jet corresponding to the diagonal matrix
[TABLE]
An orbit is contained in if and only if , and has finite codimension in if and only if . More generally, .
Remark 3.9**.**
For any and any extended partition we write for the partition defined by . We write for the -jet corresponding to the matrix
[TABLE]
and for its orbit under the natural -action. Note that compatibility of the truncation maps with the group action implies that .
4 The Nash ideal of a determinantal ring
For this section, there is no restriction on . To apply Theorem 2.14 to the determinantal variety we need to know , its Nash ideal; actually, by Lemma 2.4 it suffices to know only up to integral closure. In this section, we show the following:
Theorem 4.1**.**
* has the same integral closure in as .*
In fact, we suspect that the equality holds: we show below that , and the need to pass to integral closures would be avoided if one can show that this is an equality. It might be possible to prove this combinatorially by extending our approach below.
We begin by analyzing the relations on :
Proposition 4.2**.**
If is a minor, corresponding to a set of rows and a set of columns, then the image of under the map
[TABLE]
is
[TABLE]
where is 1 if the entry lies on the first, third, etc. antidiagonal of the submatrix formed by the entries in the rows and columns , and is if it lies on the second, fourth, etc. antidiagonal.
Proof.
Without loss of generality we may assume , so
[TABLE]
If we take the cofactor expansion along the top row, we get
[TABLE]
where we write for the minor corresponding to rows and columns . Now, applying , we see that we get
[TABLE]
Note that none of the minors appearing on the right side of the above formula involve , so the only term where can appear is in the term
[TABLE]
The same reasoning applies to the other , which then have coefficients
[TABLE]
Moreover, our choice of the top row to expand upon was arbitrary; repeating the same analysis for another row, we find the desired expression for the coefficients of the . ∎
The smooth locus of is covered by the open sets for a minor. In fact, if we invert , we can use the cofactor expansion of a minor involving to eliminate the variables not occurring in the same row or column of , obtaining that ; thus certainly each is contained in the smooth locus. Conversely, it is well-known that (see e.g., [BV88, Theorem 6.10]). We write for the set of the variables occurring in the same row or column as . The variables occurring in the gray region in the following diagram are exactly those contained in (where the darker region denotes the minor itself):
[TABLE]
Thus, the variables in give coordinates on , and thus on each we have that
[TABLE]
(When we write the exterior product over some set of variables, if we do not specify we will implicitly mean that we consider the variables in lexicographic ordering on , i.e., from left to right over those appearing in the first row, then in the second, and so on.)
Thus, to give a -form on the smooth locus of (that is, a global canonical differential form), it suffices to define it on each and demonstrate the compatibility of these definitions:
Proposition 4.3**.**
The rational -form defined on by
[TABLE]
extends to a global canonical differential form , whose restriction to each is
[TABLE]
Moreover, generates .
The sign of the above expression for depends on the position of the columns and rows appearing in and relative to the entire matrix, but will be unimportant for our purposes.
Proof.
It is clear that if is indeed compatibly defined then it is a global generator of ; this can be verified locally, and on each it is immediate that is a unit times a generator of .
We thus just need to verify that the definitions on each agree. Because is irreducible, we may ignore the question of the sign: the rational -form we defined on will be defined on a dense open subset of each , and thus we just need to show that it extends to a regular -form on (which we will see will be of the form ). If it does, then this rational -form defined on extends to the entirety of each and thus gives a regular -form on .
It suffices to show that the definitions on and agree, i.e., that we can change one row; by symmetry we can then change one column as well, and by making one change at a time go from to any . So, fix and .
So, consider the rational -forms
[TABLE]
The first involves the variables occurring in the shaded region on the left below, the second involves those occurring in the shaded region on the right (where the darker region in each denotes the minor being localized at):
[TABLE]
To go from to then, we need only replace the variables by . For each , then, consider the minor
[TABLE]
By Proposition 4.2, this yields the relation
[TABLE]
on . Now, we take the exterior product of this relation with the -form
[TABLE]
i.e., the product over all the indices appearing in the minor except and . We have highlighted in darker gray below the variables in , in relation to each of the shaded regions in question:
[TABLE]
The only terms surviving on the left side of relation (1) then are then the wedge product with these missing indices, so we have that
[TABLE]
or equivalently
[TABLE]
Note that the minors and appearing on each side are independent of the column under consideration. We have switched one for .
Now, since any appears as a wedge factor of each of and , we can use the above relation for each to obtain
[TABLE]
(where the sign is determined by the -fold product of and the repeated use of skew-commutativity), giving the result. ∎
We now prove Theorem 4.1 above, which states that the Nash ideal and have the same integral closure. The proof will occupy the rest of this section.
Proof.
We have just seen that , with the -form we defined in Proposition 4.3. Since is generated by the restriction of -forms from , it suffices to consider how these forms restrict to .
Lemma 4.4**.**
.
Proof.
For any minor , consider the -form . By definition, on we have . Thus, we deduce that
[TABLE]
giving the lemma. ∎
Recalling that for arbitrary elements of any ring , and have the same integral closure, we obtain:
Corollary 4.5**.**
The integral closure of is contained in the integral closure of .
Now, we need the reverse inclusion, for which it suffices to show that is contained in .
Proposition 4.6**.**
Let . Then the image of in is for some ; in fact, is a degree- polynomial in the minors.
Proof.
We think of the given set as corresponding to a filling of the -matrix by entries. We want to use the relations of Corollary 4.2 to move the filled entries to those corresponding to some . For convenience’s sake, we choose ; we write . Let be a “filled” entry with both . That is, lies in the “bad” region.
Consider the minor formed by the first rows and columns and the -th row and -th column; in the following diagram this minor is marked in gray:
[TABLE]
All entries of this minor except the -th entry lie in the “good” region corresponding to . The relation from Proposition 4.2 corresponding to this minor can be written as
[TABLE]
The entries appearing on the right side are all “good”, so we can localize at and use this equation to eliminate the “bad” entry in the -form in favor of good entries (and this creates no new “bad” entries). Note that the coefficients we pick up are all of the form .
The goal now is to show that lies in ; in fact, we will show the stronger claim that it is a degree- polynomial in the minors. i We induce on the number of “bad” entries as follows: Note that when we eliminate from the -form , we express as a linear combination (with coefficients of the form ) of -forms with fewer “bad” entries. When we rewrite each of these -forms as an element times , by induction we get
[TABLE]
for a degree- polynomial in the minors (and thus in ). Thus, we have
[TABLE]
or, collecting the terms on the right-hand side,
[TABLE]
where is a degree- polynomial in the -minors (and thus in ).
This equality implies that is homogeneous of degree ; since is a degree- polynomial in the , we can simply apply Proposition 3.5 to conclude that (i.e., is a degree- polynomial in the ), and thus . ∎
Having just shown that , we have that and have the same integral closure, concluding the proof of Theorem 4.1. ∎
5 Computing minimal log discrepancies
For the remainder of the paper we work over a field of characteristic 0. Our aim is to compute minimal log discrepancies on determinantal varieties via the formula of Theorem 2.14. Specifically, we consider the case of a pair \bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\bigr{)}, with (possibly 0); our goal is to compute
[TABLE]
for a closed point of ; by the same process, we also will compute
[TABLE]
for any .
Via the -action on we may assume that is the point
[TABLE]
for some .
Note that the multicontact loci
[TABLE]
are -invariant, so they decompose as disjoint unions of -orbits, say . Thus, we have that the multicontact loci
[TABLE]
appearing in the calculation of the minimal log discrepancy via Theorem 2.14 will decompose as
[TABLE]
(Note that is not -invariant, since is not -invariant.)
We now need to do the following:
- •
Analyze which of the appear in a given multicontact locus.
- •
Calculate the codimension of in .
To answer the former, we have the following:
Proposition 5.1**.**
Fix and let .
- (1)
* if and only if .* 2. (2)
The codimension of in is finite if and only if . 3. (3)
* if and only if and .* 4. (4)
* if and only if .* 5. (5)
* if and only if .*
Note that (5) implies in particular that is empty if does not divide .
Proof.
(1), (2), and (4) are just Propositions 3.2, 3.4, and 3.3 of [Doc13], respectively.
(3) follows by noting that the matrix
[TABLE]
(which generates the -orbit ) is mapped to under the map induced by the truncation if and only if the first entries are positive powers of and the rest are .
Finally, to see (5), note that by Lemma 2.4 and Theorem 4.1 we have
[TABLE]
since , we have immediately that is empty if does not divide , and is when it does; we can then apply part (4) to obtain the desired conclusion. ∎
Proposition 5.2**.**
- (1)
If the conditions in statements (1)–(2) of Proposition 5.1 hold (so that is in and has finite codimension), then the codimension of in is
[TABLE] 2. (2)
If the conditions in statements (1)–(3) of Proposition 5.1 hold (so that is in , nonempty, and has finite codimension), then the codimension of in is
[TABLE]
Remark 5.3**.**
Note that since in part (2) of the theorem, we can just as well write the codimension of in as
[TABLE]
In what follows, we will write for to lighten notation. Our proof of the proposition is exactly parallel to the proof of Proposition 5.3 of [Doc13].
Proof of Proposition 5.2.
First, note that it suffices to prove (1), at which point (2) follows immediately: the -action on and the -action on are compatible with the truncation morphisms and , so we have a commutative diagram
[TABLE]
Thus, we have that lies over if and only if lies over , and the fibers are constant for . But note that is the matrices of rank exactly , and thus . Thus, if the codimension of is , say, then we must have that , so that the formula in (1) implies (2).
By Proposition 2.8, it suffices to calculate for . As noted in Remark 3.9, the image of under is exactly , where . We thus are led to calculating the dimensions of for . Choose (by assumption ). To know it suffices to know the codimension of the stabilizer of in .
Consider the condition of an element
[TABLE]
of stabilizing , which is the equality of matrices
[TABLE]
For , equality of the -th entries is trivial, since both entries are just 0. If but , equality of the -th entries gives the equation
[TABLE]
i.e., that
[TABLE]
This gives equations for . Likewise, if but we get equations for .
For , equality of the -th entries gives the equation
[TABLE]
Say , so . Writing out the condition above, we have
[TABLE]
This gives equations
- (1)
for . 2. (2)
for .
For each of the indices with , we thus obtain
[TABLE]
independent linear conditions. To see how many entries contribute a given linear conditions, consider the filling of the matrix where the -th entry with is filled with :
[TABLE]
We see that there are entries with , entries with , and so on, up to entries with . This implies that the codimension of the stabilizer in is
[TABLE]
which is thus the dimension of .
Finally, this says that the codimension of in is
[TABLE]
or
[TABLE]
giving the theorem. ∎
Theorem 5.4**.**
Consider the pair \Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)} (where the may be zero).
- (1)
\Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)}* is log canonical at a matrix of rank exactly when*
[TABLE]
for all . 2. (2)
In this case,
[TABLE] 3. (3)
\Bigl{(}D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\Bigr{)}* is log canonical along (for ) exactly when*
[TABLE]
for all . 4. (4)
In this case,
[TABLE]
Before proving the theorem, we mention a few corollaries:
Corollary 5.5** (semicontinuity).**
If are nonnegative real numbers, the function w\mapsto\mathop{\operator@font mld}\nolimits\bigl{(}w;D^{k},\sum_{i=1}^{k}\alpha_{i}D^{k-i}\bigr{)} is lower-semicontinuous on closed points.
Proof.
The quantity
[TABLE]
is constant on each locus of rank- matrices, so we only need to check that it decreases when we go from to . Note that part (1) of the theorem guarantees that if \mathop{\operator@font mld}\nolimits\bigl{(}x_{q};D^{k},\sum\alpha_{i}D^{k-i}\bigr{)} is then the same is true of \mathop{\operator@font mld}\nolimits\bigl{(}x_{q-1};D^{k},\sum\alpha_{i}D^{k-i}\bigr{)}, so we may assume that both \mathop{\operator@font mld}\nolimits\bigl{(}x_{q};D^{k},\sum\alpha_{i}D^{k-i}\bigr{)} and \mathop{\operator@font mld}\nolimits\bigl{(}x_{q-1};D^{k},\sum\alpha_{i}D^{k-i}\bigr{)} are nonnegative, and thus we may apply the formula in part (2) of the theorem.
This formula implies that
[TABLE]
yielding the result. ∎
Corollary 5.6**.**
Determinantal varieties (of square matrices) have terminal singularities.
This follows easily from the fact determinantal varieties have a small resolution (see, e.g., [Har92, Example 16.18]), but this gives a proof avoiding the use of an explicit resolution. It also gives explicitly the log discrepancy along the singular locus.
Proof.
We consider just the singularities of , i.e., all are 0. Since , we may assume . Recall from Definition 2.13 it suffices to show that
[TABLE]
By part (3) of Theorem 5.4, this is
[TABLE]
and this is except in the excluded case . In particular, determinantal varieties of square matrices have terminal singularities. ∎
Now, we prove the theorem itself:
Proof of Theorem 5.4.
We begin by proving parts (1) and (2): By Proposition 5.1, we can decompose the multicontact loci
[TABLE]
as the disjoint union of
[TABLE]
with ranging over all -tuples satisfying:
- •
.
- •
.
- •
(and thus are all ) and .
Again by Proposition 5.1, it’s immediate that a cylinder will lie in
[TABLE]
and in
[TABLE]
for each .
Equivalently, a given cylinder is contained in for
[TABLE]
and
[TABLE]
Finally, by part (2) of Proposition 5.2, we know that
[TABLE]
The infimum in Theorem 2.14 can then be rewritten as
[TABLE]
over .
Grouping terms by the , we can rewrite this quantity as
[TABLE]
Now, set
[TABLE]
so is the coefficient of in the above quantity. It is clear that if any is negative then simply by taking we can make the quantity in question arbitrarily negative, and thus will not be log canonical, proving part (1) of the theorem.
If all are nonnegative, then it is clear that the quantity
[TABLE]
is minimized by taking . Taking these values and simplifying, we see that the minimum value is
[TABLE]
giving the claim in (2).
The proof of (3) and (4) follows in exactly the same fashion, except that one imposes the condition that instead of the conditions that and , and uses the formula from part (1) of Proposition 5.2 instead of part (2). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Amb 99] Florin Ambro. On minimal log discrepancies. Math. Res. Lett. , 6(5-6):573–580, 1999.
- 2[Bae 06] Cornel Baetica. Combinatorics of determinantal ideals . Nova Science Publishers, Inc., Hauppauge, NY, 2006.
- 3[BV 88] Winfried Bruns and Udo Vetter. Determinantal rings , volume 1327 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 1988.
- 4[d CEP 80] Corrado de Concini, David Eisenbud, and Claudio Procesi. Young diagrams and determinantal varieties. Invent. Math. , 56(2):129–165, 1980.
- 5[Doc 13] Roi Docampo. Arcs on determinantal varieties. Trans. Amer. Math. Soc. , 365(5):2241–2269, 2013.
- 6[EM 04] Lawrence Ein and Mircea Mustaţă. Inversion of adjunction for local complete intersection varieties. Amer. J. Math. , 126(6):1355–1365, 2004.
- 7[EM 09] Lawrence Ein and Mircea Mustaţă. Jet schemes and singularities. In Algebraic geometry—Seattle 2005. Part 2 , volume 80 of Proc. Sympos. Pure Math. , pages 505–546. Amer. Math. Soc., Providence, RI, 2009.
- 8[EMY 03] Lawrence Ein, Mircea Mustaţă, and Takehiko Yasuda. Jet schemes, log discrepancies and inversion of adjunction. Invent. Math. , 153(3):519–535, 2003.
