A generalization of the Hasse-Witt matrix of a hypersurface
Alan Adolphson, Steven Sperber

TL;DR
This paper extends the classical Hasse-Witt matrix to provide meaningful mod p information about the zeta function of hypersurfaces of any degree, including cases where the traditional matrix is trivial.
Contribution
The authors generalize the classical Hasse-Witt matrix to yield nontrivial zeta function congruences for all degrees, and analyze its differential equations and invertibility.
Findings
The generalized matrix provides nontrivial mod p zeta function information for all degrees.
The matrix satisfies specific differential equations.
It is shown to be generically invertible.
Abstract
The Hasse-Witt matrix of a hypersurface in over a finite field of characteristic gives essentially complete mod information about the zeta function of the hypersurface. But if the degree of the hypersurface is , the zeta function is trivial mod and the Hasse-Witt matrix is zero-by-zero. We generalize a classical formula for the Hasse-Witt matrix to obtain a matrix that gives a nontrivial congruence for the zeta function for all . We also describe the differential equations satisfied by this matrix and prove that it is generically invertible.
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.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic Geometry and Number Theory · Advanced Combinatorial Mathematics
A generalization of the Hasse-Witt matrix
of a hypersurface
Alan Adolphson
Department of Mathematics
Oklahoma State University
Stillwater, Oklahoma 74078
and
Steven Sperber
School of Mathematics
University of Minnesota
Minneapolis, Minnesota 55455
Abstract.
The Hasse-Witt matrix of a hypersurface in over a finite field of characteristic gives essentially complete mod information about the zeta function of the hypersurface. But if the degree of the hypersurface is , the zeta function is trivial mod and the Hasse-Witt matrix is zero-by-zero. We generalize a classical formula for the Hasse-Witt matrix to obtain a matrix that gives a nontrivial congruence for the zeta function for all . We also describe the differential equations satisfied by this matrix and prove that it is generically invertible.
1. Introduction
Let be a prime number, let , and let be the field of elements. Let
[TABLE]
be a homogeneous polynomial of degree . We write with . Let be the hypersurface defined by the equation and let be its zeta function. We write
[TABLE]
for some rational function . If then , so we shall always assume that .
Define a nonnegative integer by the equation
[TABLE]
where denotes the least integer greater than or equal to the real number . By a result of Ax[4] (see also Katz[5, Proposition 2.4]) we have
[TABLE]
Our goal in this paper is to give a mod congruence for . We do this by defining a generalization of the classical Hasse-Witt matrix, which gives such a congruence for . Presumably our matrix is the matrix of a “higher Hasse-Witt” operation as defined by Katz[6, Section 2.3.4], but so far we have not been able to prove this.
It will be convenient to define an augmentation of the vectors . Set
[TABLE]
where denotes the nonnegative integers. Note that the vectors all lie on the hyperplane in . We shall be interested in the lattice points on this hyperplane that lie in : set
[TABLE]
Note that implies that . Let
[TABLE]
a nonempty set by the definition of . We define a matrix of polynomials with rows and columns indexed by : let , where
[TABLE]
Note that since the -st coordinate of each equals 1, the condition on the summation implies that
[TABLE]
When , it follows that for all , hence the matrix can be reduced modulo . We denote by its reduction modulo . Using the algorithm of Katz[6, Algorithm 2.3.7.14], one then checks that is the Hasse-Witt matrix of the hypersurface . It is somewhat surprising that even when we still have for all .
Lemma 1.3**.**
If , , and , then for all . In particular, , so can be reduced modulo .
The proof of Lemma 1.3 will be given in Section 2. By the results of [1, Theorem 2.7 or Theorem 3.1], which will be recalled in Section 2, Lemma 1.3 implies immediately that each is a mod solution of an -hypergeometric system of differential equations.
Write the rational function of (1.2) as
[TABLE]
where and are relatively prime polynomials with
[TABLE]
If is smooth, it is known that is a polynomial, i. e., . Our main result is the following, which does not require any smoothness assumption.
Theorem 1.4**.**
If is not divisible by , then and
[TABLE]
Note that even in the classical case of the Hasse-Witt matrix (), this result contains something new, as we do not assume that is a smooth hypersurface.
The proof of Theorem 1.4 will occupy Sections 3–5. To describe the zeta function, we apply the -adic cohomology theory of Dwork, as in Katz[7, Sections 4–6]. Indeed, Equation (3.5) below is a refined version of [7, Equation (4.5.33)]. We discuss the case in Section 6. If , the conclusion of Theorem 1.4 need not hold, and the rational function is instead described by Theorem 6.2. We prove the generic invertibility of the matrix in Section 7.
2. Proof of Lemma 1.3
It will be convenient for later applications to prove a more general version of Lemma 1.3. Put and let . Define an integer by the equation
[TABLE]
Note that if , , and, in the notation of the Introduction, . Set
[TABLE]
Note that implies that . Let
[TABLE]
a nonempty set by the definition of . Lemma 1.3 is the special case of the following result.
Lemma 2.1**.**
If , , and , then for all .
Proof.
The result is trivial when since , so assume . Let . Fix . We claim there exists an index such that
[TABLE]
For if (2.2) fails for all , then
[TABLE]
contradicting the definition of .
If , then
[TABLE]
hence in both cases we have
[TABLE]
But our hypothesis implies that
[TABLE]
This contradiction shows that . And since was arbitrary, the lemma is established. ∎
We recall the definition of the -hypergeometric system of differential equations associated to the set . Let be the lattice of relations on ,
[TABLE]
and let . The -hypergeometric system with parameter is the system of partial differential operators in variables consisting of the box operators
[TABLE]
and the Euler (or homogeneity) operators
[TABLE]
and
[TABLE]
Let , where
[TABLE]
Note that in the notation of the Introduction we have . By Lemma 2.1, the polynomials have -integral coefficients. Lemma 2.1 also says that is very good in the sense of [1, Section 2]. We may therefore apply [1, Theorem 2.7] (or [1, Theorem 3.1] since this system is nonconfluent) to conclude that is a mod solution of the -hypergeometric system with parameter (or, equivalently, since we have reduced modulo ).
3. The zeta function
To make a connection between the matrix and the zeta function (1.2), we apply a consequence of the Dwork trace formula developed in [3] (see Equation (3.5) below). Let be a zero of the series having , where is the -adic valuation normalized by . Let be the space of series
[TABLE]
For , let be the subset of defined by
[TABLE]
Let be the Artin-Hasse series, a power series in that has -integral coefficients, and set
[TABLE]
We then have
[TABLE]
We define the Frobenius operator on . Put
[TABLE]
where denotes the Teichmüller lifting of . We shall also need to consider the series defined by
[TABLE]
Define an operator on formal power series by
[TABLE]
Denote by the composition
[TABLE]
The map operates on and is stable on each . The proof of Theorem 1.4 will be based on the following formula for the rational function defined in (1.2). By [3, Equation 7.12] we have
[TABLE]
To exploit (3.5) we shall need -adic estimates for the action of on . Expand (3.3) as a series in , say,
[TABLE]
Note that from the definitions we have . A direct calculation shows that for ,
[TABLE]
thus we need -adic estimates for the with .
Expand (3.2) as a series in :
[TABLE]
where
[TABLE]
with
[TABLE]
From (3.1) we have the estimate
[TABLE]
In particular, this implies the estimate
[TABLE]
By (3.3) and (3.8) we have
[TABLE]
In particular, we get the formula
[TABLE]
Applying (3.12) to the products on the right-hand side of (3.14) gives
[TABLE]
This estimate is not directly helpful for estimating because we lack information about the . Instead we proceed as follows.
Fix with
[TABLE]
We construct inductively from a related sequence such that
[TABLE]
First of all, take . Eq. (3.16) shows that for some ; since and we conclude that . Suppose that for some we have defined satisfying (3.17) for . Substituting for for in (3.16) gives
[TABLE]
Since , we can divide this equation by to get for some . Since and (by induction) , we conclude that . This completes the inductive construction. Note that in the special case , this computation gives .
Summing Eq. (3.17) over and using , , gives
[TABLE]
hence
[TABLE]
For as in (3.16), we thus get from (3.15)
[TABLE]
Since , we have
[TABLE]
From (3.21) and (3.22) we get the following result.
Lemma 3.23**.**
For and as in , we have
[TABLE]
Furthermore, if any of the terms of the associated sequence satisfying is not contained in , then
[TABLE]
Our desired estimate for now follows from (3.14).
Corollary 3.26**.**
For we have
[TABLE]
4. The action of on
In this section, we use Corollary 3.26 to study the action of on . From (3.7) and the formula of Serre[8, Proposition 7] we have
[TABLE]
where
[TABLE]
the outer sum is over all subsets of cardinality , and is the group of permutations on objects.
Proposition 4.3**.**
The coefficient is divisible by and satisfies the congruence
[TABLE]
In particular, if .
Proof.
If is a subset of cardinality and is a permutation of , then by (3.27)
[TABLE]
since implies . It follows from (4.2) that is divisible by . Furthermore, if , so
[TABLE]
The congruence (4.4) now follows from (4.2). ∎
As an immediate corollary of Proposition 4.3, we have the following result.
Corollary 4.5**.**
The reciprocal roots of are all divisible by .
Corollary 4.5 allows us to analyze the terms on the right-hand side of (3.5).
Proposition 4.6**.**
The reciprocal roots of are divisible by unless either or and is divisible by , in which case they are divisible by .
Proof.
Corollary 4.5 and the definition of imply that the reciprocal roots of are divisible by to the power
[TABLE]
If , this reduces to . Suppose . From the definition of we have with . The expression (4.7) then reduces to , which equals if and equals if .
If , expression (4.7) reduces to , which equals if and equals if . Finally, note that expression (4.7) cannot decrease when decreases, so expression (4.7) will be for . ∎
From (3.5) and Proposition 4.6 we get the following result.
Proposition 4.8**.**
If is not divisible by , then
[TABLE]
If is divisible by , then
[TABLE]
5. Proof of Theorem 1.4
It follows from (4.9) that if is not divisible by . To establish Theorem 1.4, it remains to prove the congruence for .
Consider the matrix defined by
[TABLE]
We have
[TABLE]
where
[TABLE]
Proposition 4.3 implies and
[TABLE]
which establishes the following result.
Proposition 5.3**.**
We have
[TABLE]
Combined with Proposition 4.8, this gives the following congruences.
Corollary 5.4**.**
If is not divisible by , then
[TABLE]
If is divisible by , then
[TABLE]
To simplify (5.5) and (5.6) further, we restate Lemma 3.23 in the special case where , i.e., .
Lemma 5.7**.**
For and as in , we have
[TABLE]
Furthermore, if any of the terms of the associated sequence satisfying is not contained in , then
[TABLE]
Applying Lemma 5.7 to Equations (3.14) and (3.17) gives the following congruence: for ,
[TABLE]
where and .
Let be the matrix
[TABLE]
It is straightforward to check by induction on that the right-hand side of (5.10) is the -entry in the matrix product
[TABLE]
i.e., (5.10) implies the matrix congruence
[TABLE]
We make explicit the matrix . Let . From (3.9) and (3.10) we have
[TABLE]
Since , Lemma 2.1 implies that for all in the sum on the right-hand side of (5.12). It then follows from the definition of that . Examining the last coordinate of the equation gives , so (5.12) can be simplified to
[TABLE]
Using (2.3), we obtain the relation between the matrices and :
[TABLE]
From (5.11), we then obtain a relation between and :
[TABLE]
Recall that and that . In particular,
[TABLE]
and since the right-hand side of this expression is an increasing function of for we have
[TABLE]
Multiplying by then gives
[TABLE]
It follows from this that
[TABLE]
so (5.15) may be simplified to
[TABLE]
Corollary 5.4 now implies the following congruences.
Theorem 5.17**.**
If is not divisible by , then
[TABLE]
If is divisible by , then
[TABLE]
Since is the matrix denoted in the Introduction and since is the Teichmüller lifting of we have . Theorem 1.4 now follows from (5.18), and (5.19) is equivalent to
[TABLE]
6. The case
We first give an example to show that Theorem 1.4 fails when . Consider the variety in defined by the equation (so we have and ). A short calculation shows that its zeta function has the form (1.2) with
[TABLE]
In particular, we have , contradicting Theorem 1.4.
An elementary observation will allow us to simplify the denominator of (5.20). Assume that and . Then
[TABLE]
This implies that is a singleton: , where
[TABLE]
with zero in the -th entry. It follows that if we define a polynomial by the formula
[TABLE]
then by (2.3), is a one-by-one matrix with entry . From (5.20) we then have the following result.
Theorem 6.2**.**
If , then
[TABLE]
7. Generic invertibility of
The proof of generic invertibility follows the lines of our recent proof of generic invertibility for the Hasse-Witt matrix[2]. We fix and prove that the matrix is generically invertible, in a sense made precise below.
We consider the following condition on the set . Suppose that and that the elements and have the following property:
Hypothesis 7.1**.**
For each , there exists (a necessarily unique) , , such that .
We show that such subsets always exists when, for example, consists of all monomials of degree . To fix ideas and simplify notation, suppose that , and that . For we take and we take to consist of all monomials of degree that are divisible by the product . Then Hypothesis 7.1 is satisfied.
Theorem 7.2**.**
If satisfies Hypothesis , then the matrix is invertible.
We begin with a reduction step. Define a related matrix by setting
[TABLE]
where is given by (2.3). In other words, we obtain by multiplying row of by \big{(}\Lambda_{\mu_{I}+k_{u}}\prod_{j=1}^{\mu_{I}}\Lambda_{j}\big{)}^{-p} and multiplying column of by . It follows that
[TABLE]
hence to prove Theorem 7.2 it suffices to prove that
[TABLE]
For , put
[TABLE]
Lemma 7.5**.**
If the monomial appears in the Laurent polynomial , then .
Proof.
It follows from Hypothesis 7.1 that
[TABLE]
The formula for is given in (2.3), where each exponent satisfies by Lemma 2.1. The assertion of Lemma 7.5 now follows from the definition of . ∎
Lemma 7.6**.**
The Laurent polynomial has no constant term if and has constant term equal to \big{(}-(p-1)!\big{)}^{-(\mu_{I}+1)} if .
Proof.
If , the definition of shows that every monomial in contains a negative power of and a positive power of . If , then
[TABLE]
so (2.3) shows that the monomial
[TABLE]
appears in . The assertion of the lemma then follows from the definition of . ∎
We shall prove (7.4) by showing that has a nonzero constant term. In fact, we shall show that the constant term of is a -adic unit. By Lemma 7.5 and the following proposition, the constant term of is the determinant of the matrix whose -entry is the constant term of . And by Lemma 7.6, this matrix of constant terms is a diagonal matrix whose diagonal entries are -adic units. Thus the following proposition completes the proof of (7.4).
Proposition 7.7**.**
Let for . One has
[TABLE]
if and only if for all .
Proof.
The “if” part of the proposition is clear, so consider a set with satisfying (7.8). Since we have
[TABLE]
which implies (since the last coordinate of each equals 1)
[TABLE]
From the definition of , we have for all if and for all if , so (7.8) implies that
[TABLE]
and
[TABLE]
To establish the proposition, it remains to show that for all if .
Using (7.11) and (7.12), Equations (7.9) and (7.10) become
[TABLE]
and
[TABLE]
for all . Since , we have and if . If , then (7.14) implies that for as well, so .
If follows that if , then so we can solve (7.13) for :
[TABLE]
The coefficients on the right-hand side of (7.15) are nonnegative rational numbers that sum to 1, so (7.15) implies the following statement.
Lemma 7.16**.**
If , then is an interior point of the convex hull of the set .
Let Z=\{{\bf a}_{k}^{+}\mid\text{l^{(u)}{\mu{I}+k}\neq 0u\in U^{I}_{\min}}\}. If , then for all , so if then for all , , and all , which establishes the proposition. So suppose and choose , , such that is a vertex of the convex hull of . If , then Lemma 7.16 implies that . By the definition of , we therefore have for all . Furthermore, since , we must have for some . It follows that , contradicting (7.8). Thus we must have . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Adolphson and S. Sperber. Hasse invariants and mod p mod 𝑝 {\rm mod}\,p solutions of A 𝐴 A -hypergeometric systems. J. Number Theory 142 (2014), 183–210.
- 2[2] A. Adolphson and S. Sperber. A 𝐴 A -hypergeometric series and the Hasse-Witt matrix of a hypersurface. Finite Fields and Their Applications 41 (2016), 55–63.
- 3[3] A. Adolphson and S. Sperber. Distinguished-root formulas for generalized Calabi-Yau hypersurfaces. Preprint, available at ar Xiv:1602.03578 .
- 4[4] J. Ax. Zeroes of polynomials over finite fields. Amer. J. Math. 86 (1964), 255–261.
- 5[5] N. Katz. On a theorem of Ax. Amer. J. Math. 93 (1971), 485–499.
- 6[6] N. Katz. Algebraic solutions of differential equations ( p 𝑝 p -curvature and the Hodge filtration). Invent. Math. 18 (1972), 1–118.
- 7[7] N. Katz. Une formule de congruence pour la fonction ζ 𝜁 \zeta . Exposé XXII in S. G. A. 7 II, Lecture Notes in Mathematics 340, Springer, Berlin-Heidelberg-New York, 1973.
- 8[8] J.-P. Serre. Endomorphismes complètement continus des espaces de Banach p 𝑝 p -adiques. Inst. Hautes Études Sci. Publ. Math. No. 12 (1962), 69–85.
