Computing Dixmier Invariants and Some Geometric Configurations of Quartic Curves with 2 Involutions
Dun Liang
Abstract
In this paper we consider plane quartics with to involutions. We compute the Dixmier invariants, the bitangents and the Matrix representation problem of these curves, showing that they have symbolic solutions for the last two questions.
1 Introduction
We consider algebraic varieties over the field K=Q, the algebraic closure of the rational numbers Q in the field of complex numbers C. Let C be a general quartic curve in the projective plane PK2 (or P2 in short) defined by the general equation
[TABLE]
where aijk are the corresponding coefficients for i,j,k∈{0,1,2,3,4}. According to the theory of algebraic curves, a generic plane quartic is smooth, and the genus g(C)=3. The study of such curves is an important topic in clasical algebraic geometry (see [2]), and in modern times, people study the moduli space M3 of such curves.
In this paper we study smooth plane quartics with Z/2×Z/2-automorphisms. Since smooth plane quartics are non-hyperelliptic genus 3 curves, the equation (1) is the canonical model of teh curve C if C is smooth. If C has an automorphism ϕ, then ϕ is a projective linear transformation on P2 with respect to the equation (1).
The classification of automorphisms of smooth plane quartics is given by [10] and [19], people can find a full list in many references nowadays, such as [2], [5]. Explicity, smooth quartics with Z/2×Z/2-automorphisms should be isomorphic to one of the following curves:
We consider three geometric informations about these curves, the Dixmier invariants, the bitangents, and the matrix representation probelm.
Like the j-invariant of elliptic curves, the quartics have their own invariants, the Dixmier-Ohno invariants [1, 3, 13]. In fact Ohno [13] gives covariants. We only compute the Dixmier invariants [1]. There are 7 of them
I3,I6,I9,I12,I15,I18 and the discriminant I27. We will not compute the discriminant I27. In fact all the curves in Table 1 are smooth and the discriminant is the invariant to judge the smoothness. We use Maxima [11] to compute the invariants of the curves in Table 1 in Section 2. The invariants of the general family X4 is symmetric with respect to the parameters, so we write the invariants as polymomials of the elementary symmetric functions (see Proposition 2.1).
The bitangents of the plane quartics is an important topic in classical algebraic geometry (see [7, 8, 10, 9]). As divisors on the curve, they are related to the theta characteristics of the curve (see [12, 16]). We use the idea in [14] to compute the bitangents. The main result is Theorem 3.1, showing that all the curves in Table 1 have symbolic solutions of all 28 bitangents. In the proof, we use Macaulay2 [6] to make the elimination, and use Maxima to compute the solutions.
The matrix representation problem (see [17, 4, 18]) asks if a quartic homogeneous polynomial could be written as
[TABLE]
for some symmetric matrices A,B,C. We use the idea in [15] to compute this problem. We first use Maxima to compute the determinant, and then argue the conditions on the entries. At the end we reach Theorem 4.1, showing that this problem has a symbolic solution for X4.
2 Dixmier Invariants of X4, X16, X24 and X96
2.1 Dixmier Invariants of Plane Quartics
Our notations follows from [5]. First we introduce some notations. In general, let f∈K[x1,…,xn] be a polynomial, we use Df to denote the differential operator determined by f. Explicitly, let
[TABLE]
where ai1,…,in∈K be the coefficient of the monomial x1i1⋯xnin for (i1,…,in)∈Z+n and (2) be a finite sum. For the rest of this paper, we will not emphasize that the powers i1,…,in are non-negative integers again.
The map Df means
[TABLE]
If we use D(f,g) to denote Df(g), ∀f,g∈K[x1,…,xn], then the map
[TABLE]
has some obvious properties as the following:
D is bilinear.
Let deg(f) be the degree of f for all f∈K[x1,…,xn].
Let f,g∈K[x1,…,xn]. If deg(f)>deg(g), then Df(g)=0. If
deg(f)>deg(g), then Df(g)≤deg(g)−deg(f). Let f=x1i1⋯xnin and g=x1j1⋯xnjn be two monomials such that deg(f)=deg(g), then Df(g)=i1!⋯in!δfg where δfg is the Kronecker delta of f and g.
For any f∈K[x1,…,xn], let H(f) be the half Hessian matrix of f. For example, if f∈K[x,y,z], then
[TABLE]
Let H∗(f) be the adjoint of H(f).
Another notation is the dot product of two matrices. Let A=(aij)n×n and B=(bij)n×n be two n×n matrices.
Then the dot product “⟨,⟩” is defined by
[TABLE]
With these notations, we describe the Dixmier invariants of plane quartics.
Let f,g∈K[x,y,z]2 be two quadratic homogeneous polynomials.
Define
[TABLE]
Let F∈K[x,y]r, G∈K[x,y]s be two homogeneous polynomials of degree r and s, respectively. For k≤min{r,s}, define
[TABLE]
Let P=P(x,y)∈K[x,y]4 be a quartic binary form. Let Q=(P,P)4 defined as (3). Also we let
[TABLE]
Then Δ(P) is the discriminant of P.
Let u,v be two K-variables. For quartic f∈K[x,y,z]4, let
[TABLE]
Then g(x,y) is a homogeneous polynomial of degree 4 with respect to the variables x and y, and the coefficients of g are expressions of u and v.
Thus we can define Σ(g) and Ψ(g) as in (4).
Since Σ and Ψ are expressions of the coefficients,
we have Σ(g) and Ψ(g) are expressions of u and v.
An explicit computation shows that Σ(g) and Ψ(g) are polynomials of degree 2 and 3 in the polynomial ring K[u,v] respectively.
Let σ(u,v,w) and ψ(u,v,w) be the homogenization of Σ(g) for w, and ψ(u,v,w) be the homogenization of Ψ(g) for w.
Then σ(u,v,w)∈K[u,v,w]2 and ψ(u,v,w)∈K[u,v,w]3.
Finally, we substitute u=x,v=y,w=z into σ(u,v,w) and ψ(u,v,w).
For f∈K[x,y,z]4, we define
[TABLE]
Definition 2.1**.**
Let f∈K[x,y,z]4, let σ, ψ defined as in (5). Let ρ=Df(ψ) and τ=Dρ(f), and let H=det(H(f)).
The Dixmier invariants are defined as
[TABLE]
2.2 The Dixmier Invariants of X4,X16,X24 and X96
First, we use Maxima to compute the Dixmier invariants of X4. Since the equation of X4 is symmetric to the parameters r,s,u, so are the invariants. Thus it is better to write the invariants as elementary symmetric polynomials of r,s,u. In the polynomial ring K[r,s,u], any elementary homogeneous symmetric polynomial of r,s,u of degree d is uniquely determined by its leading term ri1si2ui3 where i1≥i2≥i3, i1+i2+i3=d is an integer partition of d. We use S[i1,i2,i3] to denote the symmetric polynomial whose leading term is ri1si2ui3. For example,
[TABLE]
Proposition 2.1**.**
The Dixmier invariants of
[TABLE]
are
I3=2(3S[2]+S[1,1,1]+36)**
I6=62199S[4]−622086S[3,1,1]+228095S[2,2,2]+124398S[2,2]+1492776S[2]+24385464S[1,1,1]+8956656**
I9=81S[6]−33S[5,1,1]+15S[4,2,2]+99S[4,2]−5832S[4]+S[3,3,3]+270S[3,3,1]+9936S[3,1,1]+4590S[2,2,2]+40176S[2,2]+104976S[2]+244944S[1,1,1]**
I12=−72964(2025S[7,1,1]+45S[6,2,2]+9720S[6,2]−21S[5,3,3]−2997S[5,3,1]+61236S[5,1,1]−S[4,4,4]−558S[4,4,2]−22032S[4,4]−47952S[4,2,2]−139968S[4,2]−7398S[3,3,3]−359640S[3,3,1]−3884112S[3,1,1]−2787696S[2,2,2]−7558272S[2,2]−34012224S[1,1,1])**
I15=−7294096(243S[9,1,1]+6561S[8,2]−90S[7,3,3]−1215S[7,3,1]+255879S[7,1,1]−24S[6,4,4]−2781S[6,4,2]−15309S[6,4]−105462S[6,2,2]+1023516S[6,2]−S[5,5,5]−621S[5,5,3]−14580S[5,5,1]−106110S[5,3,3]−1454355S[5,3,1]+2598156S[5,1,1]−18198S[4,4,4]−817938S[4,4,2]−4251528S[4,4]−21983724S[4,2,2]−31177872S[4,2]−8341218S[3,3,3]−85817880S[3,3,1]−410981040S[3,1,1]−463574016S[2,2,2]−510183360S[2,2]−918330048S[1,1,1])**
I18=21874096(7290S[11,1,1]−2079S[10,2,2]+115911S[10,2]−1296S[9,3,3]−63342S[9,3,1]+1889568S[9,1,1]+150S[8,4,4]−12150S[8,4,2]−527796S[8,4]−1471365S[8,2,2]−1889568S[8,2]+30S[7,5,5]+7704S[7,5,3]+128628S[7,5,1]+233604S[7,3,3]−8386416S[7,3,1]−124711488S[7,1,1]+S[6,6,6]+999S[6,6,4]+90882S[6,6,2]+952074S[6,6]+286686S[6,4,4]+7813422S[6,4,2]+11967264S[6,4]+32087664S[6,2,2]−289103904S[6,2]+32508S[5,5,5]+3163860S[5,5,3]+38327904S[5,5,1]+140796144S[5,3,3]+799077312S[5,3,1]+272097792S[5,1,1]+38750724S[4,4,4]+742250304S[4,4,2]+1522991808S[4,4]+8600683680S[4,2,2]+6530347008S[4,2]+4828476096S[3,3,3]+22810864896S[3,3,1]+51426482688S[3,1,1]+85710804480S[2,2,2]+33059881728S[2,2])**
Proposition 2.2**.**
The Dixmier invariants of
[TABLE]
are
I3=2(rs2+6s2+3r2+36),
I6=6481(228095r2s4−1244172rs4+248796s4−622086r3s2+248796r2s2+24385464rs2+2985552s2+62199r4+1492776r2+8956656),
I9=2764(r3s6+30r2s6+204rs6+360s6+15r4s4+540r3s4+4788r2s4+19872rs4+28512s4−33r5s2+198r4s2+9936r3s2+80352r2s2+244944rs2+209952s2+81r6−5832r4+104976r2),**
I12=72964s2(rs2+6s2+15r2+72r+324)2(r2s2+30rs2+72s2−9r3+324r),**
I15=7294096(r+3)2(r+18)2s2(s2+3r+18)2(rs4+6s4+18r2s2+162rs2+540s2−27r3+972r),**
I18=21874096(r+3)(r+18)s2(s2+3r+18)(rs2+6s2+15r2+72r+324)(r3s6+33r2s6+228rs6+396s6+12r4s4+594r3s4+5904r2s4+24840rs4+33696s4−111r5s2−1035r4s2+4968r3s2+81000r2s2+244944rs2+104976s2+162r6−11664r4+209952r2).**
Proposition 2.3**.**
The Dixmier invariants of
[TABLE]
are
I3=2(r3+9r2+36),**
I6=6481(228095r6−1866258r5+559791r4+24385464r3+4478328r2+8956656)**
I9=2764r2(r+3)(r+18)2(r2+3r+18)2,**
I12=72964r3(r+18)3(r2+3r+18)3,**
I15=7294096r3(r+3)3(r+18)3(r2+3r+18)3,**
I18=21874096r4(r+3)2(r+18)4(r2+3r+18)4.**
Proposition 2.4**.**
The Dixmier invariants of
[TABLE]
are
[TABLE]
3 The Bitangents of X4,X16,X24 and X96
Explicitly, let f=f(x,y,z)∈K[x,y,z]4 be the equation of a plane quartic C.
Let L:ax+by+cz=0, a,b,c∈K be a line in P(x,y,z)2. Thus the point (a,b,c)∈P(a,b,c)2 determines the line L.
So without lost of generality, we can assume that c=0, and say c=1.
This time L:ax+by+z=0 gives the condition z=−ax−by.
Substitute this relation into f(x,y,z) we have a quadratic form f(x,y,−ax−by)∈R[x,y,z]2 where R=K[a,b].
If L is a bitangent for some a,b∈K, then there exist λ0,λ1,λ2∈K such that
[TABLE]
Definition 3.1**.**
For any quartic f∈K[x,y,z]4, let I(f) be the ideal of K[a,b,λ0,λ1,λ2] generated by comparing the coefficients of both sides of the monomials of x,y in the expansion of (7).
Let J(f) be elimination ideal of I with respect to λ0,λ1,λ2 in K[a,b].
The ideal J(f) gives the conditions of L being a bitangent of C. In general one cannot solve a,b over Q, and even there exists L such that a,b∈Q, the tangency points p1,p2 are not Q-rational points of C.
Theorem 3.1**.**
The curve X4 has symbolic solutions for all the 28 bitangents.
Proof Let f be the equation defined by
[TABLE]
Let J(f) be the ideal defined by Definition 3.1. Using Macaulay2, we can compute the primary decomposition of J(f). We can input
R = QQ[r,s,u,a,b,k_0,k_1,k_2][x,y,z]
f = x^4+y^4+z^4+rx^2y^2+sy^2z^2+uz^2x^2
g = (k_0x^2+k_1xy+k_2y^2)^2
h = substitute(f,{z => -ax-by})
H= h-g
Coe = coefficients H
L = flatten entries Coe#1
S = QQ[r,s,u,a,b,k_0,k_1,k_2]
I = ideal L
psi=map(S,R)
phi=map(R,S)
J = psi I
E=eliminate(J,{k_0,k_1,k_2})
T = QQ[r,s,u,a,b]
xi=map(T,S)
U = xi E
D = primaryDecomposition U
The output says J(f) has 3 irreducible components. They are
J1=⟨s2a4−u2b4+s2ua2−su2b2−4a4+4b4−4ua2+4sb2+s2−u2,ru2a2b2−r2a4+u2a4+u2b4−r2ua2−4ra2b2−4b4+4ua2−r2+4,rs2a2b2−r2b4+s2b4+u2b4−s2ua2−r2sb2+su2b2−4ra2b2−4b4+4ua2−r2−s2+u2+4,sua2b4+u2b6+su2b4−2ra2b4−2rsa2b2−rub4−4b6−rsub2+4ua2b2−2sb4+sua2+u2b2−2ra2−ru+4b2+2s,s2a2b4+sub6+s2ub4−2rb6−3rsb4−4a2b4−rs2b2+2ub4−s2a2+3sub2−2rb2−rs+4a2+2u,rsa2b4−rub6−rsub4−2ua2b4+2sb6−2sua2b2+r2b4+r2sb2+4ra2b2+rsa2−rub2+4b4−2ua2−2sb2+r2−4,sua4b2+u2a2b4+su2a2b2−2ra4b2−rsa4−2rua2b2−4a2b4−rsua2+2ua4+u2a2+sub2−2rb2−rs+4a2+2u,rsa4b2−rua2b4−2ua4b2+2sa2b4−sua4+sub4+2ra4−2rb4+rua2−rsb2−2sa2+2ub2,sua6+u2a4b2+su2a4−2ra6−3rua4−4a4b2−ru2a2+2sa4+3sua2−u2b2−2ra2−ru+4b2+2s,rsa6−rua4b2+rsua4−2ua6+2sa4b2−r2a4+2sua2b2−r2ua2−4ra2b2+rsa2−4a4−rub2+2ua2+2sb2−r2+4⟩
J2=⟨a,u2b4+2rub2−4b4−4sb2+r2−4⟩
J3=⟨b,s2a4+2rsa2−4a4−4ua2+r2−4⟩
For J2, for example, we have a=0, and b satisfies an equation of degree 4, which is solvable. Similarly to J3, we have another 4 bitangents. Thus we have 8 bitangents. Remember that f is symmetric with respect to r,s and u, and we are considering the affine xy-plane of the projective plane P2. Thus if we consider yz-plane and the zx-plane, we have another such ideals J2′, J2′′, J3′, J3′′, each ideal gives 4 solutions of bitangents.
For J2, the condition a=0 implies that the equation of the bitangent looks like by+z=0. This line does not lie on the yz-plane. On the other hand, if we consider the yz-plane, let the line has equation x+by+cz=0, and run the same algorithm, then we have another ideal
[TABLE]
the condition c=0 implies that the 4 bitangents given by J2′′ do not lie on the xy-plane. The algorithm will output all the bitangents on the corresponding affine plane, so J1,J2 and J3 will solve 24 bitangents because there are 28 inall. Thus the ideal J1 gives 28−8−4=16 bitangents.
Last we consider J1. Eiminate J1 with respect to a, we have that b satsifies the degree 8 equation
−b4s2u2−2b6su2−2b2su2−b8u2−2b4u2−u2+b6rs2u+b2rs2u+b8rsu+6b4rsu+rsu+4b6ru+4b2ru−b4r2s2−b8s2+2b4s2−s2−2b6r2s−2b2r2s−b8r2−2b4r2−r2+4b8−8b4+4=0.
This equation contains only even power terms of b, so let B=b2, then we have a degree 4 equation
B2(−s2u2−2u2+6rsu−r2s2+2s2−2r2−8)+B3(−2su2+rs2u+4ru−2r2s)+B(−2su2+rs2u+4ru−2r2s)−u2+B4(−u2+rsu−s2−r2+4)+rsu−s2−r2+4=0
of B, which is solvable. Observe that the lowest degree of the generators in J1 for a is 2 (for example the third generator), so for each fixed b one can solve a pair of a’s, and 8 b’s give 16 bitangents. ■
For
[TABLE]
the primary decomposition of J(f) is
J1=⟨a,s2b4+2rsb2−4b4−4sb2+r2−4⟩,
J2=⟨b,s2a4+2rsa2−4a4−4sa2+r2−4⟩,
J3=⟨s+2,r−2⟩,
J4=⟨s−2,r−2⟩,
J5=⟨a+b,s2b4−rb4−rsb2−2b4+2sb2−r+2⟩,
J6=⟨a−b,s2b4−rb4−rsb2−2b4+2sb2−r+2⟩,
J7=⟨a2+b2+s,rb4+rsb2−2b4−2sb2−s2+r+2⟩
The component J4 gives r=s=2, which is the case X=X24. For J3, we have r=−s=2. Let ζ4 be the primitive 4th root of 1, then x↦ζ4x,y↦ζ4y,z↦z is a projective isomorphism making r↦−r, so this also gives the situation when X=X24. Otherwise, the second generator for each of the components are quartic polynomials with one variable such that only even degree terms occure. Thus they are essentially quadratic equations. For example, the first component J1 gives four bitangents, they are
by+z where
[TABLE]
For
[TABLE]
the primary decomposition of J(f) is
J1=⟨r−2⟩,
J2=⟨a,rb4+2b4+2rb2+r+2⟩,
J3=⟨b,ra4+2a4+2ra2+r+2⟩,
J4=⟨b+1,a−1⟩,
J5=⟨b−1,a+1⟩,
J6=⟨a+b,rb2+b2+1⟩,
J7=⟨b+1,a+1⟩,
J8=⟨b−1,a−1⟩,
J9=⟨a−b,rb2+b2+1⟩,
J10=⟨a+1,b2+r+1⟩,
J11=⟨a−1,b2+r+1⟩,
J12=⟨b+1,a2+r+1⟩,
J13=⟨b−1,a2+r+1⟩.
Thus, it is easy to write down the 28 bitangents of X24 for r=2.
Remark 3.1**.**
The case r=2, and furthermore, ∣r∣=∣s∣=∣u∣=2 correspond to the situation when X degenerates to a total square of a quadric polynomial, or say, a double conic.
In the end, for
[TABLE]
there are 16 bitangents ax+by+cz=0
where
[TABLE]
and 12 bitangents given by one of a,b,c is 0, another is 1, and the one left is a 4th root of −1.
4 The Matrix Representation Problem
Let f(x,y,z)∈κ[x,y,z]4 be a homogeneous polynomial of degree 4 over the algebraic closed field κ, and let
[TABLE]
be the plane quartic curve defined by f.
The matrix representation problem for X asks whether the polynomial f(x,y,z) could be written of the form
[TABLE]
where A,B,C are symmetric matrices whose entried defined over κ. According to Section 2 in [15], if
[TABLE]
for some β1,β2,β3,β4∈κ, then one can assume that
[TABLE]
Furthermore, we have
[TABLE]
Let X=X4 defined by
[TABLE]
We check the condtions in (9). Obviously f(x,0,0)=x4. We also have
[TABLE]
where
[TABLE]
Hence
[TABLE]
Next, the partial derivative
[TABLE]
implies that if z=0, so cii=0 for i=1,2,3,4 by (10).
For convinience we denote
[TABLE]
then C=D+tD where tD is the matrix transpose of D since cii=0 for i=1,2,3,4.
Using Maxima, we directly compute the coefficients of
[TABLE]
and compare the coefficients with f(x,y,z) in (11), the output is a system of equations
[TABLE]
The last two equations (19) and (20) are identities. According to (12),
pq=1.
We rewrite the equation system as
[TABLE]
of the 6 variables a,b,c,d,e,f.
Theorem 4.1**.**
The equation system (21)-(26) has a symbolic solution.
Proof
Generically, it does not matter which parameters we wish to eliminate first. However, if we wish to eiliminate a,f using (24) and (25), then these are linear equations and a=f=0. Then the equation system becomes
[TABLE]
We only seek for one solution to the equation system , thus if there is an ”either-or” argument in any step, we can choose one of them as our solution. For example, we can choose
[TABLE]
in (30). From (28) and (29) we have
[TABLE]
Write (27)2 as
[TABLE]
then substitude (31),(34) and (33) into (34), we have
[TABLE]
Last, from (19) and (20) we have
[TABLE]
so (35) becomes
[TABLE]
which is a quadrtic equation of cd. Together with (33) we have c and d, respectively, and thus (32) and (31) gives b and e. ■