This paper investigates the FFRT properties and F-signatures of specific hypersurfaces in prime characteristic, providing criteria and explicit calculations through matrix factorizations.
Contribution
It establishes necessary and sufficient conditions for FFRT in certain hypersurfaces and computes their F-signatures using explicit matrix factorizations.
Findings
01
Identifies conditions for FFRT in hypersurfaces
02
Calculates F-signatures explicitly
03
Provides new methods for analyzing hypersurface properties
Abstract
This paper studies properties of certain hypersurfaces in prime characteristic: we give a sufficient and necessary conditions for some classes of such hypersurfaces to have Finite F-representation Type (FFRT) and we compute the F-signatures of these hypersurfaces. The main method used in this paper is based on finding explicit matrix factorizations.
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 · Polynomial and algebraic computation
Full text
FFRT properties of hypersurfaces and their F-signatures
School of Mathematics,
University of Sheffield, Hicks Building, Sheffield S3 7RH, United Kingdom
Abstract.
This paper studies properties of certain hypersurfaces in prime characteristic:
we give a sufficient and necessary conditions for some classes of such hypersurfaces to
have Finite F-representation Type (FFRT) and we compute
the F-signatures of these hypersurfaces.
The main method used in this paper is based on finding explicit matrix factorizations.
1. Introduction
For any commutative ring R of prime characteristic p, R-module M, and e≥0 we can construct a new R-module
F∗eM with elements {F∗em∣m∈M}, abelian group structure (F∗em1)+(F∗em2)=F∗e(m1+m2) and R-module structure given by
rF∗em=F∗erpem. In this paper we study properties of the modules F∗eR for various hypersurfaces R.
Smith and Van den Bergh introduced in [SV97] the first property studied in this paper, namely Finite F-representation Type (henceforth abbreviated FFRT)
which we describe in some detail in Section 2.
We say that R has FFRT if there exists a finite set of indecomposable R-modules M={M1,…,Ms} such that for all e⩾0,
F∗eR is isomorphic to a direct sum of summands in M. Rings with FFRT have very good properties, e.g.,
with some additional hypothesis their rings of differential operators are simple [SV97, Theorem 4.2.1],
their Hilbert-Kunz multiplicities are rational (cf. [Sei97]),
tight closure commutes with localization in such rings (cf. [Yao05]),
local cohomology modules of R have finitely many associated primes ([DQ16]), and
F-jumping coefficients in R form discrete sets ([KSSZ13]).
The main tool in this paper, developed in sections 3 and 4,
is an explicit presentation of F∗eR as cokernel of a matrix factorization.
In section 5
we classify those F-finite hypersufaces
of the form
K[[x1,…,xn,u,v]]/(f(x1,…,xn)+uv)
which have FFRT in terms of the hypersurfaces defined by the powers of f. As a corollary we construct in section 6 examples of rings that have FFRT but not finite CM representation type.
The last two sections of this paper analyze the F-signatures of some hypersurfaces. We recall the following definition.
Definition 1.1**.**
Let (R,m,K) be a d-dimensional F-finite Noetherian local ring of prime characteristic
p. If [K:Kp]<∞ is the dimension of K as Kp-vector space and α(R)=logp[K:Kp], then the F-signature of R, denoted by S(R), is defined as
[TABLE]
where ♯(F∗e(R),R) denotes the maximal rank of a free direct summand of F∗e(R).
F-signatures were first defined by C. Huneke and G. Leuschke in [HL02] for
F-finite local rings of prime
characteristic with a perfect residue field.
In [Yao06] Y. Yao extended the definition of F-signature to arbitrary local rings without the assumptions that the residue field be perfect and
recently K. Tucker proved in [Tu12] that the limit in (1) always exists.
The F-signature seems to give subtle information on the singularities of R. For example, the F-signature of any of the two-dimensional
quotient singularities (An), (Dn), (E6), (E7), (E8) is the reciprocal of the order of the group
G defining the singularity [HL02, Example 18]. In [AL03] I. Aberbach and G. Leuschke proved that the F-signature is positive if
and only if R is strongly F-regular. Furthermore, we have S(R)≤1 with equality if and only if R is regular (cf. [Tu12, Theorem 4.16] and [HL02, Corollary 16]).
In sections 7 and 8
we apply the methods developed in sections 3 and 4
in order to find explicit
expressions for the F-signatures of the rings
K[[x1,…,xn,u,v]]/(f(x1,…,xn)+uv) and K[[x1,…,xn,z]]/(f(x1,…,xn)+z2) where f is a monomial.
Throughout this paper, we shall assume all rings are commutative with a unit, Noetherian, and have prime characteristic p>0 unless otherwise is stated.
We denote by N (and Z+) the set of the positive integers (and non-negative integers) respectively. We let q=pe for some e∈N.
2. Rings of finite F-representation type
Throughout this section R denotes a ring of prime characteristic p. In what follows we gather some properties of the modules F∗e(M) introduced in the previous section
and introduce several concepts related to FFRT.
Recall that a non-zero finitely generated module M over a local ring R is Cohen-Macaulay if depthRM=dimM and R is a Cohen-Macaulay ring if R itself is a Cohen-Macaulay module. However, if depthRM=dimR, M is called maximal Cohen-Macaulay module (or MCM module). When M is a finitely generated module over non-local ring R, M is Cohen-Macaualy if Mm is a Cohen-Macaulay module for all maximal ideals m∈SuppM.
Later in the paper we will look at the modules F∗e(R) when R is a Cohen-Macaulay ring. Note that a regular sequence on an R-module M is also a regular sequence
on F∗eM, and in particular, if R is Cohen-Macaulay, F∗e(R) are MCM modules for all e≥0.
Definition 2.1**.**
A finitely generated R-module M is said to have finite F-representation type (henceforth abbreviated FFRT) by finitely generated
R-modules M1,…,Ms if for every positive integer e, the R-module F∗e(M) can be written as a
finite direct sum in which each direct summand is isomorphic to some module in {M1,…,Ms} , that is, there exist
non-negative integers t(e,1),…,t(e,s) such that
[TABLE]
We say that M has FFRT if M has FFRT by some finite set of R-modules M1,…,Ms
If W⊂R is a multiplicatively closed set and I⊆R is an ideal, then for a finitely generated R-module M one can check that F∗e(W−1M) is isomorphic to
W−1F∗e(M) as W−1R-module and
F∗e(MI) is isomorphic to F∗e(M)I as R^I-modules, where I denotes completion at I.
Examples of rings with FFRT can be found in [SV97], [TT08] and [Shi11]. One such class of examples are rings of finite CM representation type.
These are Cohen-Macaulay rings R with the property that the set of all isomorphism classes of finitely generated, indecomposible, MCM R-modules is finite.
When R is Cohen-Macaulay any direct summand of F∗e(R) is a MCM module, hence
finite Cohen-Macaulay representation type implies FFRT.
The converse is not true: we explore some examples of these in section 6.
3. Matrix Factorization
In this section, we discuss the concept of a matrix factorization and many basic properties that we need later in the rest of this paper.
We start by fixing some notations and stating some observations about the matrices and a cokernel of a matrix.
If m,n∈N, then Mm×n(R) (and Mn(R)) denotes the set of all m×n (and n×n) matrices over a ring R. If A∈Mm×n(R) is the matrix representing the R-linear map ϕ:Rn⟶Rm that is given by ϕ(X)=AX for all X∈Rn , then we write A:Rn⟶Rm to denote the R-linear map ϕ and CokR(A) denotes the cokernel of ϕ while ImR(A) denotes the image of ϕ. We omit the subscript R if it is known from the context. If A,B∈Mn(R), we say that A is equivalent to B if there exist invertible matrices U,V∈Mn(R) such that A=UBV. If A,B∈Mn(R) are equivalent matrices, then CokR(A) is isomorphic to CokR(B) as R-modules. Furthermore, if A∈Mn(R) and B∈Mm(R), then we define A⊕B to be the matrix in Mm+n(R) that is given by A\oplus B=\left[\begin{array}[]{cc}A&0\\
0&B\\
\end{array}\right]. In this case, CokR(A⊕B)=CokR(A)⊕CokR(B).
Let P denote a ring with identity that is not necessarily commutative.
Let m and n be positive integers. If λ∈P, 1≤i≤m and 1≤j≤n, then Li,jm×n(λ) (and Li,jn(λ)) denotes the m×n (and n×n) matrix whose (i,j) entry is λ and the rest are all zeros. When i=j, we write Ei,jn(λ):=In+Li,jn(λ) where In is the identity matrix in Mn(R). If there is no ambiguity, we write Ei,j(λ) (and Li,j(λ)) instead of Ei,jn(λ) (and Li,jn(λ)).
The following lemmas describe an equivalence between specific matrices that are basic for our work in the rest of this paper.
Lemma 3.1**.**
Let m be an integer with m≥2 and n=2m. If A is a matrix in Mn(P) that is given by
[TABLE]
then there exist two invertible matrices M,N∈Mn(P) satisfying that
[TABLE]
Proof.
Use row and column operations and the induction on m.
□
Corollary 3.2**.**
Let n=2m+1 where m is an integer with m≥2 and let A be a matrix in Mn(P) given by
[TABLE]
Then there exist invertible matrices M and N in Mn(P) such that
[TABLE]
Proof.
Let A~ be the 2m×2m matrix given by
[TABLE]
It follows that
[TABLE]
Now use Lemma 3.1 ,and appropriate row and column operations to get the result.
□
Lemma 3.3**.**
Let n be an integer with n≥2. If A∈Mn(P) is given by
[TABLE]
there exist upper triangular matrices B,C∈Mn(P) such that the (i,i) entry of B and C is the identity element of P for all i=1,…,n and
[TABLE]
Proof.
Use row and column operations and the induction on n≥2 to prove this lemma.
□
Corollary 3.4**.**
Let n be a positive integer such that n≥3 , 1≤k≤n−1 and let m=n−k. Suppose that u and v are two variables on P and let A1(k)∈Mk(P) and A2(k)∈Mm(P) be given by
A1(k)=b1b1b⋱⋱1b* and A2(k)=b1b1b⋱⋱1b .*
If B_{k}=\left[\begin{array}[]{c|c}A_{1}^{(k)}&L_{1,m}^{k\times m}(v)\\
\hline\cr L_{1,k}^{m\times k}(u)&A_{2}^{(k)}\end{array}\right]=\left[\begin{array}[]{cccc|cccc}b&&&&&&&v\\
1&b&&&&&&\\
&\ddots&\ddots&&&&&\\
&&1&b&&&&\\
\hline\cr&&&u&b&&&\\
&&&&1&b&&\\
&&&&&\ddots&\ddots&\\
&&&&&&1&b\end{array}\right], then Bk is equivalent to the matrix C_{k}=I_{n-2}\oplus\left[\begin{array}[]{cc}(-1)^{k+1}b^{k}&v\\
u&(-1)^{m+1}b^{m}\\
\end{array}\right]\in M_{n}(\mathfrak{P}) where In−2 is the identity matrix in Mn−2(P).
Moreover, if D∈Mn(P) is given by D=b1b1b⋱⋱1uvb , then D is equivalent to the matrix \tilde{D}=I_{n-2}\oplus\left[\begin{array}[]{cc}(-1)^{n}b^{n-1}&uv\\
1&b\\
\end{array}\right]\in M_{n}(\mathfrak{P}) where In−2 is the identity matrix in Mn−2(P).
Proof.
By Lemma 3.3, there exist upper triangular matrices B1,C1∈Mk(P) and B2,C2∈Mn−k(P) with 1 along their diagonal such that
[TABLE]
where m=n−k.
Define B,C∈Mn(P) to be
B=[B100B2] and C=[C100C2].
Using appropriate row and column operations on the matrix BBkC yields the required result. Applying a similar argument on the matrix D proves the corresponding result.
□
If A and B are matrices in Mn(R) such that CokR(A) is isomorphic to CokR(B), this does not imply in general that A is equivalent to B [LR74]. However, if R is a semiperfect ring (in particular, if R is a commutative noetherian local ring) and CokR(A) is isomorphic to CokR(B) as R-modules, then A is equivalent to B [LR74, Theorem 4.3].
Matrix factorizations were introduced by David Eisenbud in [Eis80] as a means of compactly describing
the minimal free resolutions of maximal Cohen-Macaulay modules that have no free direct summands over a local hypersurface
ring.
Definition 3.5**.**
[EP15, Definition 1.2.1]**
Let f be a non-zero element of a commutative ring S.
A matrix factorization of f is a pair (ϕ,ψ) of homomorphisms
between finitely generated free S-modules ϕ:G→F and ψ:F→G, such
that
ψϕ=fIG and ϕψ=fIF .
Proposition 3.6**.**
Let f be a non-zero element of a commutative ring S. If (ϕ:G→F,ψ:F→G) is a matrix factorization of f, then:
(a)
fCok(ϕ)=fCok(ψ)=0* .*
2. (b)
If f is a non-zerodivisor, then ϕ and ψ are injective.
3. (c)
If S is a domain, then G and F are finitely generated free modules having the same rank.
Proof.
It is easy to show (a) and (b) but (c)can be proved using the same argument as in [LW12, Page 127].
□
As a result, we can define the matrix factorization of a non-zero element f in a domain as the following.
Definition 3.7**.**
Let S be a domain and let f∈S be a non-zero element. A matrix factorization is a pair (ϕ,ψ) of n×n matrices with
entries in S such that ψϕ=ϕψ=fIn where In is the identity matrix in Mn(S). By CokS(ϕ,ψ) and CokS(ψ,ϕ), we mean CokS(ϕ) and CokS(ψ) respectively. There are two distinguished trivial matrix factorizations of any element
f, namely (f,1) and (1,f). Note that CokS(1,f)=0, while CokS(f,1)=S/fS. Two matrix factorizations (ϕ,ψ) and (α,β) of f are said to be equivalent and we write (ϕ,ψ)∼(α,β) if ϕ,ψ,α,β∈Mn(S) for some positive integer n and there exist invertible matrices V,W∈Mn(S) such that Vϕ=αW and Wψ=βV. Furthermore, we define (ϕ,ψ)⊕(α,β) to be the matrix (ϕ⊕α,ψ⊕β) which is a matrix factorization of f. If (S,m) is a local domain, a matrix factorization (ϕ,ψ) of an element f∈m∖{0} is reduced if all entries of ϕ and ψ are in m.
A matrix factorization can be decomposed as follows.
Proposition 3.8**.**
[Yosh90, Page58]**
Let (S,m) be a regular local ring and f∈m∖{0}.
Any matrix factorization (ϕ,ψ) of f can be written uniquely up to equivalence as
[TABLE]
with (α,β) reduced, i.e, all entries of α,β are in m, and with t,r non-negative integers.
A non-zero R-module M is decomposable provided there exist non-zero R-modules M1,M2 such that M=M1⊕M2; otherwise M is indecomposable. If M is an R-module that does not have
a direct summand isomorphic to R, we say that M is stable R-module.
D. Eisenbud has established a relationship between reduced matrix factorizations and stable MCM modules as follows.
Proposition 3.9**.**
[Yosh90, Corollary 7.6]** [LW12, Theorem 8.7]
Let (S,m) be a regular local ring and let f be a non-zero
element of m and R=S/fS . Then
the association (ϕ,ψ)↦Cok(ϕ,ψ) yields a bijective correspondence between the
set of equivalence classes of reduced matrix factorizations of f and the set of isomorphism
classes of stable MCM modules over R .
Based on Proposition 3.9 and [BW13, Corollary 3.7], one can deduce the following remark.
Remark 3.10**.**
Let (S,m) be a regular local ring, f∈m∖{0}, and R=S/fS. If (ϕ,ψ) is a reduced matrix factorization of f, then
[TABLE]
where (ϕi,ψi) is a reduced matrix factorization of f and CokS(ϕi,ψi) is non-free indecomposable MCM R-module for all 1≤i≤n. Furthermore, the above representation of (ϕ,ψ) is unique up to equivalence when S is complete.
If (S,m) is a regular local ring, f∈m∖{0} and u,v,z are variables, a matrix factorization of f+uv in S[[u,v]] and a matrix factorization of f+z2 in S[[z]] can be obtained from a matrix factorization of f as follows:
Remark 3.11**.**
Let (S,m) be a regular local ring, f∈m∖{0}, R=S/fS and let u and v be two variables.
Suppose that (ϕ,ψ) and (α,β) are two n×n matrix factorizations of f. Then
(1)
We define (ϕ,ψ)✠ to be ([ϕuI−vIψ],[ψ−uIvIϕ]) which is a matrix factorization of f+uv in S[[u,v]] and we can see the following observations:
(a)
If (ϕ,ψ)∼(α,β), then (ϕ,ψ)✠∼(α,β)✠.
2. (b)
[(ϕ,ψ)⊕(α,β)]✠* is equivalent to (ϕ,ψ)✠⊕(α,β)✠.*
3. (c)
If M is a stable MCM R-module, then M=CokS(ϕ,ψ) where (ϕ,ψ) is a reduced matrix factorization of f and hence we can define M✠=CokS[[u,v]](ϕ,ψ)✠.
As a result, if Mi=CokS(ϕi,ψi) where
(ϕi,ψi) is a reduced matrix factorization of f for all 1≤i≤n, it follows that (j=1⨁nMj)✠=j=1⨁nMj✠.
4. (d)
If R★=S[[u,v]]/(f+uv), then CokS[[u,v]](f,1)✠=R★=CokS[[u,v]](1,f)✠ and hence we can write (R)✠=R★ as R=CokS(f,1).
(2)
We define (ϕ,ψ)♯ to be ([ϕzI−zIψ],[ψ−zIzIϕ]) which is a matrix factorization of f+z2 in S[[z]] and we can see the following observations:
(e)
If (ϕ,ψ)∼(α,β), then (ϕ,ψ)♯∼(α,β)♯.
2. (f)
[(ϕ,ψ)⊕(α,β)]♯* is equivalent to (ϕ,ψ)♯⊕(α,β)♯.*
3. (g)
If R♯=S[[z]]/(f+z2), then R♯=S[[z]]/(f+z2)=CokS[[z]](f,1)♯=CokS[[z]](1,f)♯.
If R is as in the above Remark, the indecomposable non-free MCM modules over R and R★ can be related in the following situation.
Proposition 3.12**.**
[LW12, Theorem 8.30]**
Let (S,m,K) be a complete regular local ring such that K is algebraically closed of characteristic not 2 and f∈m2∖{0}. If R=S/fS and R★:=S[[u,v]]/(f+uv), then the association M→M✠ defines a bijection between the isomorphisms classes of indecomposable non-free MCM modules over R and R★.
The following proposition is a direct consequence of Proposition 3.12, Remark 3.11, and Remark 3.10.
Proposition 3.13**.**
Let (S,m,K) be a complete regular local ring such that K is algebraically closed of characteristic not 2, and f∈m2∖{0}. let R=S/fS and R★:=S[[u,v]]/(f+uv). If (ϕ,ψ) and (α,β) are reduced matrix factorizations of f, then CokS(ϕ,ψ) is isomorphic to CokS(α,β) over R if and only if CokS[[u,v]](ϕ,ψ)✠ is isomorphic to CokS[[u,v]](α,β)✠ over R★.
If M is an R-module, ♯(M,R) denotes the maximal rank of a free direct summands of M.
One can use Proposition 3.9 and Remark 3.11 to show the following corollary.
Corollary 3.14**.**
Let (S,m) be a regular local ring , f∈m∖{0}, R=S/fS, R★=S[[u,v]]/(f+uv) , and R♯=S[[z]]/(f+z2) where u,v and z are variables over S .
If (ϕ,ψ) is a matrix factorization of f having the decomposition
[TABLE]
such that (α,β) is reduced and t,r are non-negative integers, then :
4. The presentation of F∗e(S/fS) as a cokernel of a Matrix Factorization of f
Throughout the rest of this paper, unless otherwise mentioned, we will adopt the following notation:
Notation 4.1**.**
K* will denote a field of prime characteristic p with [K:Kp]<∞, and we set q=pe for some e≥1. S will denote the ring K[x1,…,xn] or (K[[x1,…,xn]]). Let Λe be a basis of K as Kpe-vector space. We set*
[TABLE]
and set re:=∣Δe∣=[K:Kp]eqn.
Discussion 4.2**.**
It is straightforward to see that {F∗e(j)∣j∈Δe} is a basis of F∗e(S) as free S-module. Let f∈S. If SfS is the S-linear map given by s⟼fs, let F∗e(S)F∗e(f)F∗e(S) be the S-linear map that is given by F∗e(s)⟼F∗e(fs) for all s∈S. We write MS(f,e) (or M(f,e) if S is known) to denote the re×re matrix representing the S-linear map F∗e(S)F∗e(f)F∗e(S) with respect to the basis {F∗e(j)∣j∈Δe}. Indeed, if j∈Δe, there exists a unique set {f(i,j)∈S∣i∈Δe} such that F∗e(jf)=⨁i∈Δef(i,j)Fe(i) and consequently MS(f,e)=[f(i,j)](i,j)∈Δe2. The matrix MS(f,e) is called the matrix of relations of f over S with respect to e.
Example 4.3**.**
*Let K be a perfect field of prime characteristic 3 , S=K[x,y] or S=k[[x,y]] and let f=x2+xy. We aim to construct MS(f,1). Let {F∗1(1),F∗1(x),F∗1(x2),F∗1(y),F∗1(yx),F∗1(yx2),F∗1(y2),F∗1(y2x),F∗1(y2x2)} be the ordered basis of F∗1(S) as S-module. Therefore, MS(f,1) is the 9×9 matrix whose j-th column consists of the coordinates of F∗e(jf) with respect to the given basis where F∗e(j) is the j-th element of the above basis. For example, the 8-th column of MS(f,1) is obtained from F∗1(y2xf)=F∗1(y2x3+x2y3)=xF∗1(y2)+yF∗1(x2).
As a result, it follows that*
[TABLE]
Remark 4.4**.**
If m∈N, then F∗e(fmqj)=fmF∗e(j) for all j∈Δe. This makes MS(fmq,e)=fmI where I is the identity matrix of size re×re.
Proposition 4.5**.**
If f,g∈S, then
(a)
MS(f+g,e)=MS(f,e)+MS(g,e),
2. (b)
MS(fg,e)=MS(g,e)MS(f,e)* and consequently MS(f,e)MS(g,e)=MS(g,e)MS(f,e), and*
3. (c)
MS(fm,e)=[MS(f,e)]m* for all m≥1.*
Proof.
The proof follows immediately from Discussion 4.2.
□
According to Remark 4.4 and Proposition 4.5, we get that
[TABLE]
for all 0≤k≤q. This shows the following result.
Proposition 4.6**.**
For every f∈S and 0≤k≤q, the pair (MS(fk,e),MS(fq−k,e)) is a matrix factorization of f.
Discussion 4.7**.**
Let xn+1 be a new variable and let L=S[xn+1] if S=K[x1,…,xn] or (L=S[[xn+1]] if S=K[[x1,…,xn]]). We aim to describe ML(g,e) for some g∈L by describing the columns of ML(g,e). First we will construct a basis of the free L-module F∗e(L) using the basis {F∗e(j)∣j∈Δe} of the free S-module F∗e(S). For each 0≤v≤q−1, let Bv={F∗e(jxn+1v)∣j∈Δe} and set B=B0∪B1∪B2∪⋯∪Bq−1.
Therefore B is a basis for F∗e(L) as free L-module and if g∈L, we write
[TABLE]
where {gi(s)∈L∣0≤s≤q−1 and i∈Δe}.
For each 0≤s≤q−1 let [F∗e(g)]Bs denote the column whose entries are the coordinates {gi(s)∣i∈Δe} of F∗e(g) with respect to Bs. Let [F∗e(g)]B be the req×1 column that is composed of the columns [F∗e(g)]B0,…,[F∗e(g)]Bq−1 respectively.
Therefore ML(g,e) is the req×req matrix over L whose columns are all the columns [F∗e(jxn+1sg)]B where 0≤s≤q−1 and j∈Δe. This means that
M_{L}(g,e)=\left[\begin{array}[]{ccc}C_{0}&\ldots&C_{q-1}\\
\end{array}\right] where Cm is the req×re matrix over L whose columns are the columns [F∗e(jxn+1mg)]B for all j∈Δe. If we define C(k,m) to be the re×re matrix over L whose columns are [F∗e(jxn+1mg)]Bk for all j∈Δe, then Cm consists of C(0,m),…,C(q−1,m) respectively
and hence the matrix
ML(g,e) is given by :
[TABLE]
Using the above discussion we can prove the following lemma
Lemma 4.8**.**
Let f∈S with A=MS(f,e) and let L=S[xn+1] if S=K[x1,…,xn] or (L=S[[xn+1]] if S=K[[x1,…xn]]). If 0≤d≤q−1, then
[TABLE]
where
[TABLE]
Proof.
If A=MS(f,e)=[f(i,j)], for each j∈Δe we can write F∗e(jf)=⨁i∈Δef(i,j)Fe(i). If g=fxn+1d, for every 1≤m≤q−1 and j∈Δe, it follows that F∗e(jxn+1mg)=⨁i∈Δef(i,j)Fe(ixn+1d+m). Therefore,
[TABLE]
Accordingly, if m≤q−1−d, then
[TABLE]
However, if m>q−1−d, it follows that
[TABLE]
This shows the required result.
□
Proposition 4.9**.**
Let L=S[xn+1] (if S=K[x1,…,xn])or L=S[[xn+1]] (if S=K[[x1,…,xn]]) . Suppose that g∈L is given by
[TABLE]
where d<q and gk∈S for all 0≤k≤d . If Ak=MS(gk,e) for each 0≤k≤d then
Applying Lemma 4.8 for ML(gjxn+1j,e) for all 0≤j≤n yields the result.
□
Example 4.10**.**
Let K be a perfect field of prime characteristic 3 and let S=K[x] or S=K[[x]] . Assume L=S[y] (if S=K[x]) or L=S[[y]] (if S=K[[x]] ). Let f=x2+xy, f0=x2, and f1=x.
*Let f∈S be a non-zero non-unit element. If R=S/fS, then
F∗e(R) is a maximal Cohen-Macaulay R-module isomorphic to CokS(MS(f,e)) as S-modules (and as R-modules).
*
Proof.
The first assertion follows from the fact that R is Cohen Macaulay.
Write I=fS. Since {F∗e(j)∣j∈Δe} is a basis of F∗e(S) as free S-module,
the module F∗e(R) is generated as S-module by the set {F∗e(j+I)∣j∈Δe}. For every g∈S, define
ϕ(F∗e(g))=F∗e(g+I). It is clear that ϕ:F∗e(S)⟶F∗e(R) is a surjective homomorphism of S-modules whose kernel is the S-module
F∗e(I) that is generated by the set {F∗e(jf)∣j∈Δe}.
Now, define the S-linear map ψ:F∗e(S)→F∗e(S) by ψ(F∗e(h))=F∗e(hf) for all h∈S.
We have an exact sequence F∗e(S)ψF∗e(S)ϕF∗e(R)0. Notice for each j∈Δe that ψ(F∗e(j))=F∗e(jf)=⨁i∈Δef(i,j)Fe(i)
and hence MS(f,e)
represents the map ψ on the given free-bases.
By Proposition 4.6 and Proposition 3.6(a), it follows that F∗e(R) is isomorphic to CokS(MS(f,e)) as R -modules.
□
Corollary 4.12**.**
Let f∈S be a non-zero non-unit element. If 1≤k≤q−1 and R=S/fS, then
(a)
F∗e(S/fkS)* is a maximal Cohen-Macaulay R-module isomorphic to CokS(MS(fk,e)) as S-modules (and as R-modules), and
*
2. (b)
F∗e(S/fkS)* is a maximal Cohen-Macaulay S/fkS -modules isomorphic to CokS(MS(fk,e)) as S-modules (and as S/fkS-modules).
*
Proof.
(a) Since the pair (MS(fk,e),MS(fq−k,e)) is a matrix factorization of f (Proposition 4.6), it follows that fCokS(MS(fk,e))=0. It is clear that fF∗e(S/fkS)=0 .
This makes F∗e(S/fkS) and CokS(MS(fk,e))R-modules and consequently F∗e(S/fkS) is isomorphic to CokS(MS(fk,e)) as R -modules.
The result (b) can be proved by observing that (MS(fk,e),MS(fkq−k,e)) is a matrix factorization of fk and applying the same argument as above.
□
Lemma 4.13**.**
Let K be a field of prime characteristic p>2 with [K:Kp]<∞ and let T=S[z] if S=K[x1,…,xn] ( or T=S[[z]] if S=K[[x1,…,xn]] ). If A=MS(f,e) for some f∈S, then
[TABLE]
Proof.
Let I be the identity matrix in Mre(S) where re=[K:Kp]epen. It follows by Proposition 4.9 that MT(f+z2,e) is a q×q matrix over the ring Mre(S) that is given by
[TABLE]
By Corollary 3.2, we get F_{*}^{e}(T/(f+z^{2}))=\operatorname{Cok}_{T}\left[\begin{array}[]{cc}A^{\frac{q-1}{2}}&-zI\\
zI&A^{\frac{q+1}{2}}\\
\end{array}\right]□
Proposition 4.14**.**
Let u and v be new variables on S and let L=S[u,v] if S=K[x1,…,xn] ( or L=S[[u,v]] if S=K[[x1,…,xn]] ). Let R★=L/(f+uv). If A is the matrix MS(f,e) for some f∈S and I is the identity matrix in the ring Mre(S), where re=[K:Kp]epen, then
[TABLE]
where Bk=[AkuI−vIAq−k] for all 1≤k≤q−1.
Proof.
Recall that D={F∗e(jusvt)∣j∈Δe,0≤s,t≤q−1} is a free basis of F∗e(L) as L-module.
We introduce a Z/qZ-grading on both L and F∗e(L) as follows:
L is concentrated in degree 0, while deg(F∗e(xi))=0 for each 1≤i≤n, deg(F∗e(u))=1 and deg(F∗e(v))=−1.
We can now write
F∗e(L)=⨁k=0q−1Mk where Mk is the free L-submodule of F∗e(L)
of elements of homogeneous degree k, and which is generated by
[TABLE]
Note that
D0={F∗e(jusvs)∣j∈Δe,0≤s≤q−1}, and that for all 1≤k≤q−1
[TABLE]
Let J be the ideal (f+uv)L. Since deg(F∗e(f+uv))=0, it follows that F∗e(J)=⨁k=0q−1MkF∗e(f+uv) and consequently
[TABLE]
We now show that
Mk/MkF∗e(f+uv)≅CokLCk where C0=[(−1)qAq−1IuvIA] and Ck=[(−1)q−k+1Aq−kuIvI(−1)k+1Ak] for all 1≤k≤q−1.
Recall that if Ms(f,e)=[f(i,j)], then F∗e(j)=⨁i∈Δef(i,j)F∗e(i) for all j∈Δe.
So now
[TABLE]
Since deg(F∗e(iusvt))=deg(F∗e(jus+1vt+1)) for all i,j∈Δe and all 0≤s,t≤q−1, it follows that F∗e(jusvt(f+uv))∈Mk for all F∗e(jusvt)∈Dk. This enables us to define the homomorphism ψk:Mk→Mk that is given by ψk(F∗e(jusvt))=F∗e(jusvt(f+uv)) for all F∗e(jusvt)∈Dk and consequently we have the following short exact sequence
[TABLE]
where ϕk:Mk→Mk/MkF∗e(f+uv) is the canonical surjection.
Notice that if 0≤s<q−1, equation (5) implies that
[TABLE]
and
[TABLE]
therefore ψ0 is represented by the matrix AIA⋱⋱IuvIA which is a q×q matrix over the ring Mre(L).
Now Corollary 3.4 implies that
[TABLE]
Now let 1≤k≤q−1. If 0≤r<q−k−1, then it follows from equation (5) that
As a result, ψk is represented by the matrix \left[\begin{array}[]{cccc|cccc}A&&&&&&&vI\\
I&A&&&&&&\\
&\ddots&\ddots&&&&&\\
&&I&A&&&&\\
\hline\cr&&&uI&A&&&\\
&&&&I&A&&\\
&&&&&\ddots&\ddots&\\
&&&&&&I&A\end{array}\right] which is a q×q matrix over the ring Mre(L) where uI is in the
Therefore, by Corollary 3.14 and the convention that CokS(Ak,Aq−k)=CokS(Ak) it follows that
[TABLE]
□
5. When does S[[u,v]]/(f+uv) have finite F-representation type?
We keep the same notation as in section 4 unless otherwise stated. The purpose of this section is to provide a characterization of when the ring S[[u,v]]/(f+uv) has finite F-representation type. This characterization enables us of exhibiting a class of rings in section 6 that have FFRT but not finite CM type.
Proposition 5.1**.**
Let K be an algebraically closed field of prime characteristic p>2 and q=pe. Let S:=K[[x1,…,xn]] and let m be the maximal ideal of S and f∈m2∖{0}. Let R=S/(f) and R★=S[[u,v]]/(f+uv). Then R★=S[[u,v]]/(f+uv) has FFRT over R★ if and only if there exist indecomposable R-modules N1,…,Nt such that F∗e(S/(fk)) is a direct sum with direct summands taken from N1,…,Nt for every e∈N and 1≤k<pe .
Proof.
First, suppose that R★=S[[u,v]]/(f+uv) has FFRT over R★ by {R★,M1,…,Mt,} where Mj is an indecomposable non-free MCM R★-module
By Proposition 3.12 and 3.9, it follows that Mj=CokS[[u,v]](αj,βj)✠ where (αj,βj) is a reduced matrix factorization of f such that CokS(αj,βj) is non-free indecomposable MCM R-module. Now apply Proposition 4.14 to get that
[TABLE]
where A=MS(f,e) and Ak=(MS(f,e))k=MS(fk,e) (by Proposition 4.5).
By Proposition 3.8 there exist a reduced matrix factorization (ϕk,ψk) of f and non-negative integers tk and rk such that (Ak,Aq−k)∼(ϕk,ψk)⊕(f,1)tk⊕(1,f)rk. This gives by Remark 3.11 (b), (c), and (d) that CokS[[u,v]](Ak,Aq−k)✠=CokS[[u,v]](ϕk,ψk)✠⊕[R★]tk+rk.
By Krull-Remak-Schmidt theorem (KRS)[LW12, Corollary 1.10], there exist non-negative integers n(e,k,1),….,n(e,k,t) such that CokS[[u,v]](ϕk,ψk)✠≅j=1⨁tMjn(e,k,j)≅j=1⨁t[CokS[[u,v]](αj,βj)✠]⊕n(e,k,j)
≅CokS[[u,v]][⨁j=1t(αj,βj)⊕n(e,k,j)]✠. Now, from Proposition 3.13 and Proposition 3.9 it follows that CokS(ϕk,ψk)≅CokS[⨁j=1t(αj,βj)⊕n(e,k,j)]≅⨁j=1tNj⊕n(e,k,j) where Nj=CokS(αj,βj) for all j∈{1,…,t} . Therefore, F∗e(S/fkS)≅CokS(Ak,Aq−k)=CokS[(ϕk,ψk)⊕(f,1)rk⊕(1,f)tk]=Rrk⊕⨁j=1tNj⊕n(e,k,j). This shows that F∗e(S/(fk)), for every e∈N and 1≤k<pe, is a direct sum with direct summands taken from {R,N1,…,Nt}.
Now suppose F∗e(S/(fk)) is a direct sum with direct summands taken from indecomposable R-modules N1,…,Nt for every e∈N and 1≤k<pe. Therefore, for each 1≤k≤q−1, there exist non-negative integers n(e,k),n(e,k,1),….,n(e,k,t) such that
[TABLE]
Since F∗e(S/fkS) is a MCM R-module (by Corollary 4.12), it follows that Nj is an indecomposable non-free MCM R-module for each j∈{1,…,t} and hence
by Proposition 3.9Nj=CokS(αj,βj) for some reduced matrix factorization (αj,βj) for all j. If Mj=CokS[[u,v]](αj,βj)✠, it follows that
CokS[[u,v]](Ak,Aq−k)✠=(R★)n(e,k)⊕j=1⨁tMjn(e,k,j) and hence by (18) R★=S[[u,v]]/(f+uv) has FFRT by {R★,M1,…,Mt}.
□
The following result is a direct application of the above proposition
Corollary 5.2**.**
Let K be an algebraically closed field of prime characteristic p>2 and q=pe. Let S:=K[[x1,…,xn]] and let m be the maximal ideal of S and f∈m2∖{0}. Let R=S/(f) and R★=S[[u,v]]/(f+uv). If R★=S[[u,v]]/(f+uv) has FFRT over R★, then S/fkS has FFRT over S/fkS for every positive integer k.
The above corollary implies evidently the following.
Corollary 5.3**.**
Let K be an algebraically closed field of prime characteristic p>2 and q=pe. Let S:=K[[x1,…,xn]] and let m be the maximal ideal of S and f∈m2∖{0}. Let R=S/(f) and R★=S[[u,v]]/(f+uv). If S/fkS does not have FFRT over S/fkS for some positive integer k, then R★ does not have FFRT. In particular, if R does not have FFRT , then R★ does not have FFRT.
An easy induction gives the following result.
Corollary 5.4**.**
Let K be an algebraically closed field of prime characteristic p>2 and q=pe. Let S:=K[[x1,…,xn]] and let m be the maximal ideal of S, f∈m2∖{0} and let R=S/(f). If R does not have FFRT, then the ring
[TABLE]
does not have FFRT for all t∈N.
6. A Class of rings that have FFRT but not finite CM type
We keep the same notation as in section 4 unless otherwise stated. Recall that, a local ring (R,m) is said to have finite CM representation type if there are only finitely many isomorphism classes
of indecomposable MCM R-modules. It is clear that every F-finite local ring (R,m) of prime characteristic that has finite CM representation type has also FFRT. Smith and Van Den Bergh introduced in [SV97] a class of rings that have FFRT but not finite CM representation type. However, the main result of this section is to provide a new class of rings that have FFRT but not finite CM representation type Proposition 6.3.
If α=(α1,…,αn)∈Z+n, we write xα=x1α1…xnαn where x1,…,xn are different variables.
Lemma 6.1**.**
Let f=x1d1x2d2…xndn be a monomial in S where dj∈Z+ for each j. Let Γ={(α1,…,αn)∈Z+n∣0≤αj≤dj for all 1≤j≤n} , d=(d1,…,dn), and let e be a positive integer such that q=pe>max{d1,…,dn}+1. If A=MS(f,e), then for each 1≤k≤q−1 the matrix Ak=MS(fk,e) is equivalent to diagonal matrix, D, of size re×re in which the diagonal entries are of the form xc where c∈Γ. Furthermore, if c=(c1,…,cn)∈Γ and
[TABLE]
then
[TABLE]
where ηk(c)=[K:Kq]∏j=1nηk(cj) with the convention that M⊕0={0} for any module M and (xc,xd−c) is the 1×1 matrix factorization of f.
Proof.
Choose e∈N such that q=pe>max{d1,…,dn}+1 and let 1≤k≤q−1. If j=λx1β1…xnβn∈Δe, we get F∗e(jfk)=F∗e(λx1kd1+β1…xnkdn+βn). Since dj,k∈{0,…,q−1}, there exist 0≤ci≤di and 0≤ui≤q−1 for each 1≤i≤n such that dik+βi=ciq+ui and hence F∗e(jfk)=x1c1…xncnF∗e(λx1u1…xnun).
Therefore each column and each row of MS(fk,e) contains only one non-zero element of the form x1c1…xncn where 0≤ci≤d for all 1≤i≤n. Accordingly, using the row and column operations, the matrix MS(fk,e) is equivalent to a diagonal matrix, D, of size re×re in which the diagonal entries are of the form x1c1…xncn where 0≤ci≤d for all 1≤i≤n. Now fix c=(c1,…,cn)∈Γ and let η(c) stand for how many times xc appears as an element in the diagonal of D. It is obvious that η(c) is exactly the same as the number of the n-tuples (α1,…,αn) with 0≤αj≤q−1 satisfying that
[TABLE]
where s1,..,sn∈{0,…,q−1} for all λ∈Λe. However, an n-tuple (α1,…,αn) with 0≤αj≤q−1 will satisfy (20) if and only if αj=cjq−kdj+sj for some 0≤sj≤q−1 whenever 1≤j≤n. As a result, the n-tuples (α1,…,αn)∈Zn will satisfy (20) if and only if ∣cjq−kdj∣<q for all 1≤j≤n. Indeed, for 1≤j≤n, set uj=cjq−kdj. If 0≤uj<q, we can choose αj∈{uj,uj+1,…,q−1}. On the other hand, if −q<uj<0, then αj can be taken from {q−1+uj,q−2+uj,…,−uj+uj}. Therefore, if 0≤∣cjq−kdj∣<q, then αj can be chosen by q−∣cjq−kdj∣ ways.
Set
[TABLE]
Thus we get that ηk(c)=[K:Kq]∏j=1nηk(cj). Now if Γ~={c∈Γ∣ηk(c)>0}, it follows that
[TABLE]
□
Corollary 6.2**.**
Let K be an algebraically closed field of prime characteristic p>2 and q=pe. Let S:=K[[x1,…,xn]] and f=x1d1x2d2…xndn where dj∈N for each j . Then R★=S[[u,v]]/(f+uv) has FFRT over R★. Furthermore, for every e∈N with q=pe>max{d1,…,dn}+1, F∗e(R★) has the following decomposition:
[TABLE]
where ηk(c) and Γ as in the above lemma.
Proof.
Let e∈N with q=pe>max{d1,…,dn}+1 and let 1≤k≤q−1. Let Γ and ηk(c) be as in the above lemma. If A=MS(f,e), it follows that
[TABLE]
If M={CokS(xc,xd−c)∣c∈Γ}∪{Fj(S/fi)∣pj≤max{d1,…,dn} and 0≤i≤pj},
then F∗e(S/(fk)) is a direct sum with direct summands taken from the finite set M for every e∈N and 1≤k<pe. By Proposition 5.1R★ has FFRT.
Furthermore, we can describe explicitly the direct summands of F∗e(R★). Indeed, if Γ^:={c∈Γ∣ηk(c)>0 and c∈/{d,0}}, it follows that
[TABLE]
Recall by Remark 3.11 that (Ak,Aq−k)✠ is a matrix factorization of f+uv and
[TABLE]
Therefore
[TABLE]
By Proposition 4.14, the above equation, and the convention that M⊕0={0}, we can write
[TABLE]
□
We will take benefit from the proof of Corollary 6.2 above when we compute the F-signature in section 9.
The fact that the hypersurface in Corollary 6.2 has FFRT can be also proved differently in the following proof.
Proof.
If f=x1d1x2d2…xndn where dj∈N for each j, notice that f+uv is an irreducible polynomial in the ring K[x1,⋯,xn,u,v] and consequently the ideal (f+uv) is a toric ideal and hence K[x1,⋯,xn,u,v]/(f+uv) is a affine toric ring (For more details on affine toric ideals and affine toric rings see [ES96, Section 2], [CLS11, Section 1.2], and [GHP08, Section 2]). Since an affine toric ring is a direct summand of a polynomial ring [Hoc72], it follows from [SV97, Proposition 3.1.6] that the ring K[x1,⋯,xn,u,v]/(f+uv) has FFRT and consequently we obtain that K[[x1,⋯,xn,u,v]]/(f+uv) has FFRT.
□
If (S,n) is a regular local ring, and R=S/(g), where
0=g∈n2, then R is a simple singularity (relative to the presentation R=S/(g)) provided there are only finitely
many ideals L of S such that g∈L2 [LW12, Definition 9.1].
Proposition 6.3**.**
Let K be an algebraically closed field with char(k)>2,
and let S=K[[x1,…,xk]] where k>2.
If f∈S is a monomial of degree greater than 3 and R★=S[[u,v]]/(f+uv), then R★ has FFRT but it does not have finite CM representation type.
Proof.
Let t be the degree of the monomial f and let m be the maximal ideal of S. Clearly, t is the largest natural number satisfying f∈mt−mt+1 and consequently the multiplicity e(R) of the ring R is e(R)=t (by [LW12, Corollary A.24 page 435] ). Since e(R)=t>3 , R is not a simple singularity [LW12, Lemma 9.3] . Therefore, by [LW12, Theorem 9.2] R does not have finite CM type. Consequently, by Proposition 3.12, R★ does not have finite CM type as well. However, Corollary 6.2 implies that R★ has FFRT.
□
7. The F-signature of f+uvS[[u,v]] when f is a monomial
We will keep the same notation as in notation 4.1 unless otherwise stated.
Notation 7.1**.**
Let Δ={1,…,n} and let d,d1,…,dn be real numbers. For every 1≤s≤n−1, define
[TABLE]
[TABLE]
According to the above notation, we can observe the following remark
Remark 7.2**.**
If n≥2, then Wj(n)=(d−dn)Wj−1(n−1)+dnWj(n−1) for every 1≤j≤n−1.
The following lemma is needed to prove Proposition 7.4
Lemma 7.3**.**
If r , q, dj and uj are real numbers for all 1≤j≤n, then
[TABLE]
where gc(n)(q) is a polynomial in q of degree n−1−c for all 0≤c≤n−1.
Proof.
By induction on n, we will prove this lemma. It is clear when n=1. The induction hypothesis implies that
[TABLE]
where
[TABLE]
[TABLE]
If D=∑j=0ndn+1djqjWj(n)rn−j+1 and E=∑j=0n(d−dn+1)dj+1qj+1Wj(n)rn−j, it follows that
Notice that gj(n+1)(q) is a polynomial in q of degree n−j for all 0≤j≤n because gc(n)(q) is a polynomial in q of degree n−1−c for all 0≤c≤n−1.
It is easy to verify that
[TABLE]
and hence
[TABLE]
□
Proposition 7.4**.**
*Let f=x1d1…xndn be a monomial in S=K[[x1,…,xn]] where dj is a positive integer for each 1≤j≤n. If d=max{d1,…,dn} and R★=S[[u,v]]/(f+uv), then the F-signature of R★ is given by
[TABLE]
where W1(n),…,Wn−1(n) are defined as in the notation 7.1. Therefore, S(R★) is positive.
Proof.
Let R=S/fS and R★=S[[u,v]]/(f+uv). Set [K:Kp]=b and recall from the notation 4.1 that Λe is the basis of K as Kq-vector space where q=pe. We know from Corollary 4.15 that
[TABLE]
where re=beqn , A=MS(f,e) and Ak=MS(fk,e). Since fk is a monomial, it follows from Lemma 6.1 that the matrix Ak=MS(fk,e) is equivalent to a diagonal matrix D whose diagonal entries are taken from the set {x1u1…xnun∣0≤uj≤dj for all 1≤j≤n}.
This makes CokS(Ak)=CokS(D) and consequently the number ♯(CokS(Ak),R) is exactly the same as the number of the n-tuples (α1,…,αn) with 0≤αj≤q−1 satisfying that
[TABLE]
where s1,..,sn∈{0,…,q−1} for all λ∈Λe. However, an n-tuple (α1,…,αn) with 0≤αj≤q−1 will satisfy (24) if and only if αj=dj(q−k)+sj for some 0≤sj≤q−1 for each 1≤j≤n. As a result, the n-tuples (α1,…,αn)∈Zn will satisfy (24) if and only if dj(q−k)≤αj<q for all 1≤j≤n.
Set Nj(k):={αj∈Z∣dj(q−k)≤αj<q} for all 1≤j≤n. Therefore,
[TABLE]
Since ∣Nj(k)∣=q−djq+djk for all 1≤j≤n, it follows that
[TABLE]
Let d=max{d1,…,dn}, then ♯(CokS(Ak),R)=0 if and only if Nj(k)=0 for all 1≤j≤n if and only if dq(d−1)<k.
Let q=du+t where t∈{0,..,d−1}. If t=0, then one can easily verify that
[TABLE]
Therefore,
♯(CokS(Ak),R)=0 if and only if k∈{q−dq−t+r∣r∈{0,…,dq−t−1}}.
However, if t=0, it follows that dq(d−1)=q−dq∈Z and consequently ♯(CokS(Ak),R)=0 if and only if k∈{q−dq+r∣r∈{1,…,dq−1}}.
where gc(n)(q) is a polynomial in q of degree n−1−c for all 0≤c≤n−1.
Set δ=dq−t−1. By Faulhaber’s formula [CG96], if s is a positive integer, we get the following polynomial in δ of degree s+1
[TABLE]
where Bj are Bernoulli numbers, B0=1 and B1=2−1. This makes
[TABLE]
where Vs(q) is a polynomial of degree s in q.
From Faulhaber’s formula and the equations (28), and (30), we get that
[TABLE]
Since ∑j=0ndjqjWj(n)Vn−j(q) and ∑c=0n−1gc(n)(q)(c+1)dc+1qc+1+∑c=0n−1gc(n)(q)Vc(q) are polynomials in q=pe of degree n and n−1 respectively, it follows that
[TABLE]
Therefore
[TABLE]
By equation (23) and the above equation we conclude that the F-signature of the ring R★ in the case that t=0 is given by
[TABLE]
Second, assume that t=0 and hence q=du. Therefore, dq(d−1)=q−dq∈Z and consequently
[TABLE]
Therefore
[TABLE]
By an argument similar to the above argument, we conclude the same result that
[TABLE]
□
8. The F-signature of (f+z2)S[[z]] when f is a monomial
We will keep the same notation as in notation 4.1 unless otherwise stated.
Proposition 8.1**.**
*Let f=x1d1…xndn be a monomial in S=K[[x1,…,xn]] where dj is a positive integer for each 1≤j≤n and K is a field of prime characteristic p>2 with [K:Kp]<∞. Let R=S/fS and R♯=S[[z]]/(f+z2). It follows that:
If dj=1 for each 1≤j≤n, then S(S[[z]]/(f+z2))=2n−11.
If d=max{d1,…,dn}≥2, then S(S[[z]]/(f+z2))=0.*
Proof.
Set [K:Kp]=b and recall from the notation 4.1 that Λe is the basis of K as Kq-vector space. We know by lemma 4.13 that
Let k∈{2q−1,2q+1} and
set Nj(k):={αj∈Z∣dj(q−k)≤αj<q} for all 1≤j≤n. Using the same argument that was previously used in the proof of Proposition 7.4, it follows that
[TABLE]
Now if d1=d2=⋯=dn=1, it follows from equation (34) that ♯(CokS(Ak),R)=bekn for k∈{2q−1,2q+1}. Therefore, the equation (33) implies that
[TABLE]
and consequently
[TABLE]
Now let di=max{d1,…,dn} for some 1≤i≤n.
First assume that di=2. If k=2q−1 , it follows that di(q−k)>q and consequently ∣Ni(k)∣=0. The equation (34) implies ♯(CokS(Ak),R)=0. When k=2q+1 , we get that di(q−k)=q−1 and consequently Ni(k)={q−1} which makes ∣Ni(k)∣=1. Notice that when k=2q+1 and dj=1 , it follows that ∣Nj(k)∣=2q+1. As a result, if k=2q+1, we conclude that
[TABLE]
Therefore,
[TABLE]
As a result,
[TABLE]
Second assume that di>2. In this case, for every k∈{2q−1,2q+1}, it follows that di(q−k)>q and consequently ∣Ni(k)∣=0. Therefore
[TABLE]
and consequently
[TABLE]
Notice that when d=max{d1,…,dn}>2, we can prove that S(R♯)=0 using Fedder’s Criterion [Fed83, Proposition 1.7]. Indeed, let m be the maximal ideal of S[[z]] and let R♯=S[[z]]/(f+z2). If d=max{d1,…,dn}>2, then (f+z2)q−1∈m[q] which makes, by Fedder’s Criterion, ♯(F∗e(R♯),R♯)=0 for all e∈Z+. This means clearly that
[TABLE]
□
**Acknowledgment **
We would like to thank the referee for carefully reading our manuscript and giving thoughtful comments and efforts towards improving our manuscript. We wish to thank also Holger Brenner and Tom Bridgeland for their useful comments on the results in this paper.
Bibliography29
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1]
2[AL 03] I. M. Aberbach and G. J. Leuschke : The F-signature and strong F-regularity , Math. Res. Lett. 10 (2003), 51–56.
3[BW 13] N.R. Baeth and R. Wiegand : Factorization theory and decomposition of modules , Amer. Math. Monthly 120 (2013), no. 1, 3-–34.
4[Bru 07] W. Bruns : Commutative Algebra Arising from the Anand–-Dumir–-Gupta Conjectures , Proc. Int. Conf. -– Commutative Algebra and Combinatorics No. 4, 2007, pp. 1-–38.
5[BG 09] W. Bruns and J. Gubeladze : Polytopes, rings, and K-theory , Springer 2009.
6[BH 93] W. Bruns and J. Herzog : Cohen-Macaulay Rings , vol. 39, Cambridge studies in advanced mathematics, 1993.
7[CG 96] J.H. Conway and R.K. Guy : The Book of Numbers. New York , NY: Copernicus, 1996. pp. 106-110.
8[CLS 11] D.A. Cox, J.B. Little and H.K. Schenck : Toric varieties , American Mathematical Society, U.S.A. (2011).