For a projective variety X in Pm of dimension n, an additive action on X is an effective action of Gna on Pm such that X is Gna-invariant and the induced action on X has an open orbit. Arzhantsev and Popovskiy have classified additive actions on hyperquadrics of corank 0 or 1. In this paper, we give the classification of additive actions on hyperquadrics of corank 2 whose singularities are not fixed by the Gna-action.
Citation: Yingqi Liu. Additive actions on hyperquadrics of corank two[J]. Electronic Research Archive, 2022, 30(1): 1-34. doi: 10.3934/era.2022001
[1] | Anna Gołȩbiewska, Marta Kowalczyk, Sławomir Rybicki, Piotr Stefaniak . Periodic solutions to symmetric Newtonian systems in neighborhoods of orbits of equilibria. Electronic Research Archive, 2022, 30(5): 1691-1707. doi: 10.3934/era.2022085 |
[2] | Sidney A. Morris . Bohr compactification of separable locally convex spaces. Electronic Research Archive, 2025, 33(3): 1333-1336. doi: 10.3934/era.2025060 |
[3] | Yongsheng Lei, Meng Ding, Tianliang Lu, Juhao Li, Dongyue Zhao, Fushi Chen . A novel approach for enhanced abnormal action recognition via coarse and precise detection stage. Electronic Research Archive, 2024, 32(2): 874-896. doi: 10.3934/era.2024042 |
[4] | Hui Xu, Jun Kong, Mengyao Liang, Hui Sun, Miao Qi . Video behavior recognition based on actional-structural graph convolution and temporal extension module. Electronic Research Archive, 2022, 30(11): 4157-4177. doi: 10.3934/era.2022210 |
[5] | Mohammad Mohammadi, Saad Varsaie . On the construction of $ \mathbb Z^n_2- $grassmannians as homogeneous $ \mathbb Z^n_2- $spaces. Electronic Research Archive, 2022, 30(1): 221-241. doi: 10.3934/era.2022012 |
[6] | Sik Lee, Sang-Eon Han . Semi-separation axioms associated with the Alexandroff compactification of the $ MW $-topological plane. Electronic Research Archive, 2023, 31(8): 4592-4610. doi: 10.3934/era.2023235 |
[7] | Ming Ding, Zhiqi Chen, Jifu Li . The properties on F-manifold color algebras and pre-F-manifold color algebras. Electronic Research Archive, 2025, 33(1): 87-101. doi: 10.3934/era.2025005 |
[8] | Yuriĭ G. Nikonorov, Irina A. Zubareva . On the behavior of geodesics of left-invariant sub-Riemannian metrics on the group $ \operatorname{Aff}_{0}(\mathbb{R}) \times \operatorname{Aff}_{0}(\mathbb{R}) $. Electronic Research Archive, 2025, 33(1): 181-209. doi: 10.3934/era.2025010 |
[9] | Lie Fu, Victoria Hoskins, Simon Pepin Lehalleur . Motives of moduli spaces of rank $ 3 $ vector bundles and Higgs bundles on a curve. Electronic Research Archive, 2022, 30(1): 66-89. doi: 10.3934/era.2022004 |
[10] | Xing Zhang, Xiaoyu Jiang, Zhaolin Jiang, Heejung Byun . Algorithms for solving a class of real quasi-symmetric Toeplitz linear systems and its applications. Electronic Research Archive, 2023, 31(4): 1966-1981. doi: 10.3934/era.2023101 |
For a projective variety X in Pm of dimension n, an additive action on X is an effective action of Gna on Pm such that X is Gna-invariant and the induced action on X has an open orbit. Arzhantsev and Popovskiy have classified additive actions on hyperquadrics of corank 0 or 1. In this paper, we give the classification of additive actions on hyperquadrics of corank 2 whose singularities are not fixed by the Gna-action.
Throughout the paper, we work over an algebraically closed field K of characteristic zero. Let Ga=(K,+) be the additive group of the field and Gna=Ga×Ga×...×Ga(n times) be the vector group. In this article we study additive actions on projective varieties defined as follows.
Definition 1.1. Let X be a closed subvariety of dimension n in Pm. An additive action on X is an effective algebraic group action Gna×Pm→Pm such that X is Gna-invariant and the induced action Gna×X→X has an open orbit O. Two additive actions on X are said to be equivalent if one is obtained from another via an automorphism of Pm preserving X.
In the following we represent an additive action on X by a pair (Gna,X) or a triple (Gna,X,L), where L is the underlying projective space. We define X∖O to be the boundary of the action and define l(Gna,X) to be the maximal dimension of orbits in the boundary. For a group action of G on a set S, we define the set of fixed points under the action to be Fix(S)={x∈S|g⋅x=x,for any g∈G}. We say a subset in the projective space is non-degenerate if it is not contained in any hyperplane.
Recall that a Gna-action on Pm is induced by a linear representation of Gna, namely write Pm=PV for an (m+1)-dimensional vector space V, then the action is given by:
Gna×PV↦PV(g,[v])↦[ρ(g)(v)] |
where ρ:Gna↦GL(V) is a rational representation of the vector group Gna. In [1] Hassett and Tschinkel showed that if the action is faithful and has a non-degenerate orbit O in Pm, then the vector space V can be realized as a finite dimensional local algebra. They identified additive actions on projective spaces with certain finite dimensional local algebras. The simplest additive action on a projective space is the one with fixed boundary, it is unique and can be given explicitly as follows.
Gma×Pm↦Pm(g1,...,gm)×[x0:x1:...:xm]↦[x0:x1+g1x0:...:xm+gmx0] |
In [2] Arzhantsev and Popovskiy identified additive actions on hypersurfaces in Pn+1 with invariant d-linear symmetric forms on (n+2)-dimensional local algebras. As an application they obtained classifications of additive actions on hyperquadrics of corank 0 and 1, where the corank of a hyperquadric Q is the corank of the quadratic form defining Q. Given an additive action on a hyperquadric Q, if corank(Q)=0 (i.e., Q is smooth), then the action is unique up to equivalences (also cf. [6]) and l(Gna,Q)=1. If corank(Q)=1, then the action is determined by a symmetric matrix up to an orthogonal transformation, adding a scalar matrix and a scalar multiplication (cf. [2,Proof of Proposition 7]), namely for two symmetric matrices Λ and Λ′, they determine the same action if and only if there exist a nonzero a∈K, h∈K and an orthogonal matrix A (i.e., A⊺A=I) such that Λ′=A⊺(aΛ+hI)A. In this case, the action has fixed singular locus and l(Gna,Q)=2.
In this paper, we study additive actions on hyperquadrics of corank 2. In this case the action is determined by two symmetric bilinear forms on a certain finite dimesnional local algebra. The singular locus, which is a projective line, is either fixed by the action or is the union of a orbit and a fixed point.
When the singular locus is fixed by the Gna-action, it is a natural generalization of the case when corank(Q)=1. In this case, using a similar method as in [2,Proposition 7] one can see that the action is determined by a pair of symmetric matrices up to a simultaneous orthogonal similarity and an affine transformation of pais of matrices, namely for two pairs of symmetric matrices (Λ1,Λ2) and (Λ′1,Λ′2), they determine the same action if and only if there exist a11,a12,a21,a22,h1,h2∈K with a11a22−a12a21≠0 and an orthogonal matrix A such that:
Λ′1=A⊺(a11Λ1+a12Λ2+h1I)AΛ′2=A⊺(a21Λ1+a22Λ2+h2I)A |
Remark 1.2. For K=C, the problem of classifying pairs of matrices under simultaneous similarity is solved explicitly by Friedland [4]. As an application, for almost all pairs of symmetric matrices (A,B), the characteristic polynomial |λI−(A+xB)| determines a finite number of similtaneous orthogonal similarities classes.
In this paper we focus on the case when the action has unfixed singularities, our main observation is that under the identification, one of the bilinear forms vanishes on a certain hyperplane of the maximal ideal. As a result, the action can be recovered from two kinds of simpler actions which has been classified before. One is an action on a projective space with fixed boundary, the other one is an action on a hyperquadric of corank r⩾2, which can be simply recovered from an action on a hyperquadric of corank one as follows.
Definition 1.3. Let Q be a hyperquadric of corank one in P=PV with an additive action induced by ρ:Gna↦GL(V). Choose an element α in the open orbit O. For any r⩾1, viewing P as a subspace of P′=Pn+r of codimension r and write the coordinate of P and P′ to be [v]=[x0,x1:...:xn] and [v,z]=[v:z1:...:zr] respectively, where α=[1:0:...:0]. Let L={v=0}⊆P′ and ˜Q be the projective cone over Q with vertex being L. Then we extend the action on Q to ˜Q as follows.
Write Gn+ra=Gna×Gra={(g,h):g∈Gna,h∈Gra}, then the action (Gn+ra,˜Q) is defined to be:
Gn+raטQ↦˜Q(g,h)×[v:z]↦[ρ(g)(v):z+x0⋅h] |
If we extend the action using another element α′∈O, then the induced action on ˜Q is equivalent to the previous action through an linear isomorphism ϕ of P′ such that ϕ(P)=P,ϕ(α)=α′ and ϕ|L=idL. Hence the definition of the extended action on ˜Q is unique up to equivalences. We call the extended action is simply recovered from the given action (Gna,Q).
Remark 1.4. Geometrically the action on ˜Q is extended by the action on Q through an action on a projective space with fixed boundary. Note that ˜Q is contained in the linear span <Lα,D>, where Lα is the cone over L with the vertex being α, D is the boundary Q∖O. Hence the action of Gn+ra=Gna×Gra on ˜Q is determined by its action on Lα and D, which is rather simple: the action of Gna on Lα and the action of Gra on D are both trival while the action of Gra on Lα is an additive action on the projective space with fixed boundary.
Now to recover a given action by a simpler action, we introduce an operation for any given additive action on a hyperquadric with unfixed singularities or an action on a projective space with unfixed boundary. We start with the following definition.
Definition 1.5. Let X in Pm be a hyperquadric or a projective space with an additive action, O being the open orbit.
K(X)={Sing(X)ifXisahyperquadricX∖OifXisaprojectivespace |
Theorem 1.6. For an additive action on X in Pm, where X is either a hyperquadric or a projective space with open orbit O such that K(X)⊈Fix(X). Choose x0∈O. Let G(1)=∩x∈K(X)Gx and let L(1) be the linear span of G(1)⋅x0, then:
(i) L(1)⊊Pm.
(ii) L(1) is G(1)-invariant and the action of G(1) on L(1) induces an additive action on Q(1)=¯G(1)⋅x0⊆L(1) with the open orbit O(1)=G(1)⋅x0, where Q(1) is either a non-degenerate hyperquadric or the whole projective space L(1).
We furtherly define when such an operation is effective for our classification.
Definition 1.7. Let Q be a hyperquadric with an additive action such that Sing(X)⊈Fix(X), we say the operation obtained in Theorem 1.6: (Gna,Q,Pn+1)↦(G(1),Q(1),L(1)) is effective if K(Q)⫋K(Q(1)).
Starting from a given additive action on the hyperquadric Q with unfixed singularities, the operation defined in Theorem 1.6 and the effective condition in Definition 1.7 give a procedure of reducing the present action to a lower dimensional one, which has to terminate as the dimension of the underlying projective space decreases strictly by Theorem 1.6 (i). The procedure ends in three different ways, which we call Type A, Type B and Type C. We use the following flow chart to represent the procedure.
![]() |
where for each k, if K(Q(k))⊈Fix(Q(k)), let (G(k),Q(k))↦(G(k+1),Q(k+1)) be the operation obtained in Theorem 1.6.
We use (x,t,G(t),Q(t)) to represent the final output of the flow chart, where (x,t) is the output of the flow chart and (G(t),Q(t)) is the corresponding action.
In the case of corank two, the following theorem shows that the flow chart conversely gives the explicit process of recovering and together with l(Gna,Q) the final output determines the action up to equivalences.
Theorem 1.8. Let Q be an hyperquadric of corank two with an additive action, assume the action has unfixed singularities and dim(Q)⩾5, let (x,t,G(t),Q(t)) be the final output of the flow chart above. Then:
(i) (G(t),Q(t)) is either an action on a projective space with fixed boundary or an action on a hyperquadric given in Definition 1.3.
(ii) l(Gna,X)⩽3 and codim(Q(k+1),Q(k))=1, for any k⩽t−1.
(iii) if (Gna,˜Q) is another additive action on the hyperquadric of corank two ˜Q with unfixed singularities and dim(˜Q)⩾5, let (x′,t′,˜G(t′),˜Q(t′)) be the final output of the flow chart, then (Gna,Q) is equivalent to (Gna,˜Q) if and only if l(Gna,Q)=l(Gna,Q′),x=x′,t=t′ and (G(t),Q(t)) is equivalent to (˜G(t′),˜Q(t′)).
Combining Remark 1.4 with classification of actions on hyperquadrics of corank one, we can determine the output action (G(t),Q(t)) explicitly. Then by Theorem 1.8, we can give classification of additive actions on hyperquadrics of corank two with unfixed singularities in terms of the final output of the flow chart.
Theorem 1.9. Let Q be a hyperquadric of corank two, then additive action on Q with unfixed singularities has equivalence type as follows:
(a) dim(Q)⩾5. Let the final output in the flow chart be (x,t,G(t),Q(t)) then we separate it into 8 different types with respect to the value of x,t and whether Q(t) is a projective space or a hyperquadric:
(a.1) Type x0: if x∈{B,C} and t=1.
(a.2) Type x1: if x∈{A,B,C}, t⩾2 when x∈{B,C} and Q(t) is a projective space.
(a.3) Type x2: if x∈{A,B,C}, t⩾2 when x∈{B,C} and Q(t) is a hyperquadric.
(b) dim(Q)⩽4: there are 14 different types.
Remark 1.10. Explicit classification result of each type will be given in Proposition 4.3, 4.5, 4.7 and Section 4.2 in terms of the algebraic structure of finite dimensional local algebras.
The simplest types are Type B0 and Type C0, i.e., Type x0 for x∈{B,C}. They can be directly recovered from an additive action on a hyperquadric of corank one. Here we describe actions of Type B0 as an example.
Example 1.11. Let Q be a hyperquadric of corank two in Pn+1=PV with an additive action, assume dim(Q)⩾5 and Sing(Q)⊈Fix(Q), consider (G(1),Q(1),L(1)) obtained in Theorem 1.6. If it is of Type B0 then:
(i) Q(1) is a hyperquadric of corank one in L(1).
(ii) choose any α in the open orbit O and any α′∈Sing(Q)∖Fix(Q) there exist suitable coordinate {x0,x1,x2,...,xn−1,y0,y1} of Pn+1 w.r.t the basis of V, α0,α1,..,αn−1,β0,β1, such that α=[β1], α′=[α1], L(1)={x1=0}, Q(1)=L(1)∩Q and
Q={x22+...+x2n−1+y0⋅y1=0}. |
Moreover for V′=⟨α0,α2,..,αn−1,β0,β1⟩ such that L(1)=PV′, let the action (G(1),Q(1)) be given by:
G(1)×L(1)↦L(1)(a,[v′])↦[ρ(a)(v′)] |
where ρ:G(1)→GL(V′) is a rational representation of G(1).
Then there is a decomposition of Gna=G(1)⊕Ga such that if we write
a=(a0,a2,..,an−1)∈G(1), s∈Ga, v=(x0,x1,..,xn−1,y0,y1)∈V and v′=(x0,0,..,xn−1,y0,y1)∈V′ then the action (Gna,Q) is given by:
Gna×Pn+1↦Pn+1((a,s)×[v])↦[v″] |
where v″=ρ(a)(v′)+(s2y12+sx1)⋅α0+(sy1+x1)⋅α1.
Throughout the article, in a given finite dimensional local algebra R, we use α⋅β to represent multiplication between two elements in R, where α can also be taken as a scalar in K. Furthermore we define the following:
(a) if α∈R, V⊆R, then α⋅V≐{α⋅β:β∈V}
(b) if V,V′⊆R, then V⋅V′≐{∑ni=1αi⋅α′i:n∈N,αi∈V,α′i∈V′}.
Given an additive action on a hyperquadric Q in Pn+1, there is an (n+2)-dimensional local algebra R with a hyperplane W of the maximal ideal m and a bilinear form F on R such that
Pn+1=P(R),Q=P({r∈R:F(r,r)=0}), |
and if we choose a basis of W, w1,...,wn, then the action is given by (up to equivalences):
Gna×R↦R((a1,a2,...,an),r)↦r⋅exp(a1w1+...+anwn). |
Hence to classify additive actions is equivalent to classify algebraic structures of the triple (R,W,F). Note that Sing(Q)=P(Ker(F)), furthermore we show that Ker(F)⊆W and if we choose a basis of Ker(F), μ1,..,μl, and choose any b0∈m2∖W then we can represent the multiplications of elements in m as follows:
a⋅a′=F(a,a′)b0+V1(a,a′)μ1+V2(a,a′)μ2+...+Vl(a,a′)μl, | (1.1) |
for any a,a′∈m, where {Vi:1⩽i⩽l} is a set of symmetric bilinear forms on R. When the corank equals one we have l=1 and μ1⋅m=0, also one can choose b0 s.t. b0⋅m=0. Hence if we extend μ1 to a basis of W namely μ1,e1,..,en−1, s.t. F(ei,ej)=δi,j then the multiplication in m depends on the matrix Λ=(V1(ei,ej)). Also note that an orthogonal tranformation of the basis ei's with respect to F leads to an orthogonal transformation of the matrix Λ, hence the classification of the action of corank one is reduced to normalize a symmetric bilinear forms under orthogonal transforamtions (cf. [2,Proposition 7] and [5,Chapter XI,§ 3]).
When the corank equals two, we can still choose b0 s.t. b0⋅m=0. We note that in this case the condition Sing(Q)⊈Fix(Q) enables us to use the idea of the case of corank one.
Firstly we show that Sing(Q)⊈Fix(Q) is equivalent to Ker(F)⋅W≠0. And if Ker(F)⋅W≠0, then we can furtherly define a hyperplane V(1) in W:
V(1)={α∈W:α⋅Ker(F)=0}V(1)=Ker(F|V(1)) |
By using the correspondence between additive actions and finite dimensional local algebras we show that if V(1)=V(1) then the action (G(1),Q(1),L(1)) obtained in Theorem 1.6 is an action on a projective space and it corresponds to (R(1),V(1)), where R(1)=V(1)⊕⟨1R⟩. If V(1)≠V(1) we show that the action (G(1),Q(1),L(1)) corresponds to the triple (R(1),V(1),F(1)) where R(1)=V(1)⊕⟨b0,1R⟩, F(1)=F|V(1) and Q(1) is a hyperquadric.
Then our first key step is to show that after choosing suitable μ1∈Ker(F), we have
V(1)⋅W⊆⟨μ1,b0⟩, |
which shows that the bilinear form V2 defined in (1.1) vanishes on V(1). For the obtained subspaces V(1)⊆V(1)⊆W, our second key step is that if Ker(F)⊈V(1) (resp. V(1)=Ker(F)), which geometrically means K(Q)⊈K(Q(1)) (resp. K(Q)=K(Q(1))), then we can directly normalize the multiplications in m. As a result, we recover action (Gna,Q) from the action (G(1),Q(1)), which is an action given in Definition 1.3. This corresponds to an output of Type B0 or C0 in the flow chart.
Otherwise we show that codim(Ker(F),V(1))=1 and we furtherly consider the new action (G(1),Q(1),L(1)), for which we separate into two more subcases.
(1) If V(1)⋅V(1)=0 then we are in a situation similar to the case of corank one: V2=...=Vl=0, V(1)⋅V(1)=0, b0⋅V(1)=0. Hence we can normalize the multiplications in m(1)=V(1)⊕⟨b0⟩. As a result, we recover action (Gna,Q) from the action (G(1),Q(1)), which is an action given in Definition 1.3. This corresponds to an output (A,1) in the flow chart.
(2) If V(1)⋅V(1)≠0 then we are in a situation similar to Ker(F)⋅W≠0, except that in this case the action is on a hyperquadric of corank three. On the other hand, we have Ker(F)⋅V(1)=b0⋅V(1)=0 and V2=V3=0, hence the uncertainity of multiplications in m(1) is still one dimensional. For this reason we furtherly define
V(2)={α∈V(1):α⋅V(1)=0}V(2)=Ker(F|V(1)) |
This corresponds to a new action (G(2),Q(2),L(2)) in the flow chart, with L(2)⫋L(1). Similarly we show that if V(1)⊈V(2) or V(1)=V(2) or V(1)⊊V(2) with V(2)⋅V(2)=0, then we can already normalize the multiplications in m(1). Otherwise we find V(2)⋅V(2)≠0 then as before we can furtherly define (V(3),V(3)) with V(3)⫋V(2), and check whether it satisfies the conditions to be normalized. The discussion will be continued as above until we find that the present action satisfies the condition to be normalized i.e., to obtain an output in the flow chart, the procedure has to terminate as the dimension of V(i) decreases strictly. As a result we show that the output action is either an action on a projective space with fixed boundary or an action given in Definition 1.3. Moreover we obtain a chain of subspaces in W corresponding to the flow chart:
Ker(F)⊆V(1)⊆...V(s)⊆V(s)⊆...⊆V(1)⊆W, |
where s=t if x=A, s=t−1 if x=B or x=C.
Then it remains to normalize the multiplications between elements outside V(s). This is completed through more technical operations shown in Lemmas 4.2, 4.4 and 4.6. After the normalization of the structure of R, we show the uniqueness of the normalized structure up to equivalences, which proves Theorem 1.8 (iii). And the normalized structure of (R,W,F) gives the explicit result of our classification of actions when dim(Q)⩾5. Finally when dim(Q)⩽4 we give the classification case by case.
The article is organized as follows: in Section 2, we recall the correspondence between additive actions and finite dimensional local algebras; in Section 3 we first prove Theorem 1.6 to obtain the action (G(1),Q(1)). Then we show that the existence of unfixed singularities will lead to V(1)⋅W⊆⟨μ1,b0⟩ and we normalize the algebraic structure of (R,W,F) when the type is B0 or C0; in Section 4, we first normalize the structure of R, then we show the uniqueness of the normalized structure, which gives proof of Theorem 1.8 and also gives explicit result of our classification result shown in Theorem 1.9.
As mentioned before an additive action (Gna,X,Pm) is induced by a faithful rational linear representation ρ:Gna→GLm+1(K). Furtherly if X is non-degenerate in Pm then ρ becomes a cyclic representation i.e., ⟨ρ(g)⋅v:g∈Gna⟩=Km+1 for some nonzero v∈Km+1. Hassett and Tschinkel in [1] gave a complete characterization of such representations.
Theorem 2.1 ([1], Theorem 2.14). There is 1-1 correspondence between the following two classes:
(1) equivalence classes of faithful rational cyclic representation ρ:Gna↦GLm+1(K); (2) isomorphism classes of (R,W), where R is a local (m+1)-dimensional algebra with maximal ideal m and W is an n-dimensional subspace of m that generates R as an alegbra with unit.
Remark 2.2. Under this correspondence a representation of Gna on Km+1 can always be viewed as an action on a local algebra R≅Km+1. Moreover if we choose a K-basis of W: W=⟨w1,...,wn⟩ then we can write down the action explicitly:
Gna×R↦R(g1,g2,...,gn)×r↦r⋅exp(g1w1+...+gnwn). |
And the induced action of the Lie algebra g(Gna)=Gna on R is:
g×R↦R(g1,g2,...,gn)×r↦r⋅(g1w1+...+gnwn), |
we identify g≅W as vector spaces.
Moreover Hassett and Tschinkel proved in [1] and later Arzhantsev and Popovskiy proved in [2] the following 1-1 correspondences.
Theorem 2.3 ([1], Proposition 2.15). There's a bijection between the following two classes:
(1) equivalence classes of additive actions on Pn;
(2) equivalence classes of (n+1)-dimensional local commutative algebras.
Under the correspondence the action is given as in Remark 2.2, where the subspace W is the maximal ideal of the local algebra.
Theorem 2.4 ([2], Proposition 3). There's a bijection between the following two classes:
(1) equivalence classes of additive actions on hypersurfaces H in Pn+1 of degree at least two;
(2) equivalence classes of (R,W), where R is a local (n+2)-dimensional algebra with maximal ideal m and W is a hyperplane of m that generates the algebra R with unit.
Then in [2] they furtherly introduced the notion of invariant multilinear form for a pair (R,W).
Definition 2.5 [[2], Definition 3] Let R be a local algebra with maximal ideal m. An invariant d-linear form on R is a d-linear symmetric map
F:R×R×...×R↦K |
such that F(1,1,...,1)=0, the restriction of F to m×...×m is nonzero, and there exist a hyperplane W in m which generates the algebra R and such that:
F(ab1,b2,...,bd)+F(b1,ab2,...,bd)+...+F(b1,b2,...,abd)=0∀a∈W,b1,...,bd∈R. |
We say F is irreducible if it can not be represented as product of two lower dimensional forms.
Now given an additive action on a hypersurface H={f(x0,..,xn+1)=0}⊆Pn+1, then under the correspondence in Theorem 2.4 the polarization F of f is an invariant multilinear form on (R,W), which induces the following more explicit correspondence.
Theorem 2.6 ([2], Theorem 2). There is a bijection between the following two classes:
(1) equivalence classes of additive actions on hypersurface H⊆Pn+1 of degree at least two;
(2) equivalence classes of (R, F), where R is a local algebra of dimension n+2 and F is an irreducible invariant d-linear form on R up to a scalar.
Under the correspondence Pn+1=P(R), H=P({r∈R:F(r,r,...,r)=0}), and the action on Pn+1 corresponds to the action on R as shown in Remark 2.2, with the open orbit O=P(Gna⋅1R). Moreover F is determined by (R,W) as follows.
Lemma 2.7 ([2], Lemma 1). Fix a K-linear automorphism m/W≅K with the projection π:m→m/W≅K then the corresponding invariant linear form is (up to a scalar):
FW(b1,...,bd)=(−1)kk!(d−k−1)!π(b1...bd), |
where k is the number of units among b1,...,bd and for k=d let FW(1,1,...,1)=0.
In the following we focus on additive actions on hyperquadrics, i.e., d=2 and we use a triple (R,W,F) to represent an additive action on a hyperquadric Q where F is the bilinear form given in Theorem 2.6. By Lemma 2.7 we have the following.
Lemma 2.8. Fix b0∈m∖W and the projection y0:R→K s.t. y0(1R)=y0(W)=0 and y0(b0)=1. Then for a,a′∈m and for r∈W we have:
F(a,a′)=y0(aa′).F(1,1)=F(1,r)=0,F(1,b0)=−1. |
As F is the polarization of the homogenous polynomial defining Q we have Sing(Q)=P(Ker(F)). Moreover we have the following.
Lemma 2.9. Ker(F)⊆W and Ker(F|W)=Ker(F).
Proof. By [3,Theorem 5.1], the degree of the hypersurface is the maximal exponent d such that md⊈W, for d=2 we have m2⊈W and m3⊆W. Hence we can take a b0∈m2∖W and the projection y0 defined in Lemma 2.8.
For any l∈Ker(F), write l=a+tb0+lW for some a,t∈K and lW∈W, then t=−F(1,l)=0 by Lemma 2.8. And
0=F(b0,l)=−a+F(b0,lW)=−a+y0(b0lW)=−a |
as b0lW∈m3⊆W, concluding that l=lW∈W.
For any l∈Ker(F|W), then F(1,l)=0 as l∈W and F(l,b0)=y0(lb0)=0 as b0l∈m3⊆W and y0(W)=0, concluding that l∈Ker(F).
Lemma 2.10. For any b0∈m2∖W, m2⊆Ker(F)⊕⟨b0⟩.
Proof. Firstly choose a b0∈m2∖W. Given any a,a′∈m we have
aa′=y0(aa′)⋅b0+(aa′)W, |
where y0 is the projection defined in Lemma 2.8. Now for any r∈m then
r⋅(aa′)W=r⋅(aa′−y0(aa′)⋅b0)∈m3⊆W, |
as b0∈m2. Hence by Lemma 2.8
F((aa′)W,r)=y0((aa′)W⋅r)=0, |
as r⋅(aa′)W∈W. Note that F(1,(aa′)W)=0 since F(1,W)=0. It follows that (aa′)W∈Ker(F), concluding the proof.
From above lemmas we can thus choose a b0∈m2∖W such that F(1,b0)=−1 and m2⊆Ker(F)⊕⟨b0⟩. Moreover if we fix a basis of Ker(F)=⟨μ1,...,μl⟩ then we can represent the multiplications of elements in m as follows.
aa′=F(a,a′)b0+V1(a,a′)μ1+V2(a,a′)μ2+...+Vl(a,a′)μl. | (2.1) |
In this section, we first prove Theorem 1.6. Then we show that in the case of corank two the existence of unfixed singularities leads to V(1)⋅W⊆⟨b0,μ1⟩. Finally we show that if K(Q)⊈K(Q(1)) or K(Q)=K(Q(1)) then we can already normalize the algebraic structure of (R,W,F).
We first give an algebraic characterization of related concepts. Given an additive action on hyperquadric Q represented by (R,W,F), recall that Sing(Q)=P(Ker(F)), G(1)=∩x∈K(X)Gx, V(1)={r′∈W|r′⋅Ker(F)=0} and V(1)=Ker(F|V(1)). We furtherly define S′={r∈R|r⋅W=0}. Then we have the following.
Proposition 3.1. (i) Fix(Q)=P(S′).
(ii) G(1)=exp(g(1)), where g(1)⊆g(Gna) is a Lie subalgebra and g(1)≅V(1) under the identification g(Gna)≅W given in Remark 2.2.
(iii) Ker(F)⋅m≠0 if and only if V(1)≠W if and only if Sing(Q)⊈Fix(Q).
Proof. (i) By Remark 2.2, the action of g=g(Gna) on R is given by multiplying elements of W to R. Hence we have:
S′={r∈R:r⋅W=0}={r∈R:g⋅r=0} |
Also by Remark 2.2, the action of Gna on Pn+1 is identified with the action on R. Hence we have:
Fix(Q)=P({r∈R:g⋅r=r,∀g∈Gna})=P({r∈R:x⋅r=0,∀x∈g})=P(S′). |
(ii) Similarly for the isotropy group G(1) of Sing(Q) we have:
G(1)={g∈Gna:g⋅x=x,∀x∈Sing(Q)}={g∈Gna:g⋅r=r,∀r∈Ker(F)}=exp({x∈g:x⋅r=0,∀r∈Ker(F)}). |
Then by Remark 2.2, under the identification of g≅W, we have {x∈g:x⋅r=0,∀r∈Ker(F)}≅{r′∈W:r′⋅r=0,∀r∈Ker(F)}=V(1).
(iii) The first equivalence follows from the definition of V(1) and the fact that m can be generated by W. For the second equivalence, we have Sing(Q)⊆Fix(Q) if and only if Gna=G(1) if and only if g=g(1) if and only if V(1)=W, where the last equivalence follows from (ii).
Next we introduce a lemma to describe multiplications between elements in m and elements in Ker(F).
Lemma 3.2. (i) Ker(F)⋅m⊆Ker(F) and there exist a K-basis of Ker(F), μ1,μ2,...,μl, such that μi⋅m⊆⟨μ1,...,μi−1⟩. (ii) V(1)≠0.
Proof. (i) First note that Sing(Q) is Gna-stable. Then by Theorem 2.6 and P(Ker(F))=Sing(Q), Ker(F) is a Gna-invariant subspace, hence by Remark 2.2 and the fact that m is generated by W we conclude that Ker(F)⋅m⊆Ker(F)
Now we choose a K-basis of m to be S0, then for any c∈S0 we can define a linear map induced by multiplications:
ϕc:Ker(F)↦Ker(F)r↦c⋅r |
Note that R is a commutative Artinian local ring, hence {ϕc:c∈S0} is a set of commutative nilpotent linear maps on Ker(F). Therefore we can choose a basis of Ker(F)=⟨μ1,...,μl⟩ s.t. ϕc(μi)⊆⟨μ1,...,μi−1⟩, for any c∈S0. As S0 is a basis of m, (i) is proved.
(ii) If Ker(F)=0 then V(1)=W≠0 from the definition of V(1). If Ker(F)≠0 then by (i) there exist a μ1≠0 s.t. μ1⋅m=0 and hence μ1∈V(1), concluding that V(1)≠0.
Now we use the correspondences given in Theorem 2.3 and Theorem 2.4 to obtain the operation described in Theorem 1.6.
Proof of Theorem 1.6. Firstly note that Q(1) is a non-degenerate variety in L(1), hence it suffices to prove that there exist a linear space L(1) satisfying Theorem 1.6 (i) and (ii). In the following we assume dim(V(1))=m for some m⩽n−1.
(a) If X is a hyperquadric, then we represent the action by (R,W,F) with x0∈O s.t. x0=[1R] and define (V(1),V(1)) as in Proposition 3.1. Also by Lemma 3.2 we have 0≠V(1)⊊W.
Case 1. V(1)⋅V(1)⊆V(1), then the induced action is an additive action on a projective space. From Lemma 2.8 we conclude that V(1)=V(1).
In this case R(1)=V(1)⊕⟨1R⟩ is a well-defined subring of R. Furthermore it can be easily seen that R(1) is a finite dimensional K-local algebra with maximal ideal m(1)=V(1). Then by HT-correspondence (Theorem 2.3), the pair (R(1),V(1)) gives an additive action of Gma on the projective space P(R(1)) with open orbit Gma⋅[1R]. On the other hand, by Remark 2.2, the action is given through identifying g(Gma) with V(1), hence from Proposition 3.1.(ii) we conclude that up to equivalences the corresponding action is exactly induced by the action of G(1) on R(1). Thus the action of G(1) on P(R(1)) is an additive action on the projective space with open orbit G(1)⋅[1R], and P(R(1))⊊P(R) as V(1)⊊W. Above all we have found the subspace L(1)=P(R(1))=Q(1) of Pn+1 satisfying Theorem 1.6 (i) and (ii):
![]() |
Case 2. V(1)⋅V(1)⊈V(1), then the induced action is an additive action on a hyperquadric. From Lemma 2.8 we conclude that V(1)≠V(1).
First we can choose a suitable b0∈m2∖W s.t. V(1)⋅V(1)⊆V(1)⊕⟨b0⟩ and b0⋅Ker(F)=0. In fact, from V(1)≠V(1), there exist a,a′∈V(1) with F(a,a′)=1. Now we define b0=a⋅a′ then b0∈m2∖W and b0⋅Ker(F)=0 as a∈V(1). Moreover for any c,c′∈V(1):
c⋅c′=y0(cc′)⋅b0+(c⋅c′)|W, |
hence from c⋅c′⋅Ker(F)=b0⋅Ker(F)=0 we have (c⋅c′)|W∈V(1), concluding that V(1)⋅V(1)⊆V(1)⊕⟨b0⟩.
Now we set R(1)=V(1)⊕⟨b0⟩⊕⟨1R⟩, m(1)=V(1)⊕⟨b0⟩. Then
b0∈(m(1))2⊈V(1),b0⋅m(1)⊆(m(1))3⊆V(1), |
as (m(1))3⊆m3⊆W and (m(1))3⋅Ker(F)=0, where m3⊆W follows from [3,Theorem 5.1] and the fact that (R,W,F) reprensents an action on a hyperquadric.
Now it follows that R(1) is a finite dimensional local K-algebra with maximal ideal m(1)=V(1)⊕⟨b0⟩, V(1) is a hyperplane of m(1) generating the algebra R(1) such that (m(1))2⊈V(1) and (m(1))3⊆V(1). Hence by Theorem 2.4 and [3,Theorem 5.1], (R(1),m(1),V(1)) corresponds to an additive action of Gma on a hyperquadric Q(1) in P(R(1)) with open orbit Gma⋅[1R]. Then similar to Case 1, by Remark 2.2 and Proposition 3.1.(ii) we conclude that the corresponding action (up to equivalences) is exactly induced by the action of G(1) on R(1). Thus the action of G(1) on P(R(1)) induces an additive action on a hyperquadric Q(1) with the open orbit O(1)=G(1)⋅[1R], and P(R(1))⊊P(R) as V(1)⊊W. Moreover in the more explicit correspondence Theorem 2.6 we can easily see the corresponding bilinear form F(1) is just F|R(1).
Now P(R(1)) is already a subspace satisfying Theorem 1.6 (i) and (ii):
![]() |
(b) If X is a projective space, following Theorem 2.3, we represent the action (Gna,Pn) by a pair (R,m), where x0=[1R]. We first show that K(X)=P(m). In fact, for any [α] in the open orbit we have α is invertible by Remark 2.2. Conversely, for any invertible element r∈R we have dim(Gna⋅[r])=dim(g⋅r)=dim(m⋅r)=dim(m)=n, concluding that [r] lies in the open orbit. Now we define V(1)={α∈m:α⋅m=0}, then Fix(X)=P(V(1)). Since K(X)⊈Fix(X) by assumption of Theorem 1.6, we have V(1)⊊m. Moreover as elements in m are nilpotent, we conclude that V(1)≠0 by a similar discussion as that in Lemma 3.2.
Now we consider R(1)=V(1)⊕⟨1R⟩ then similar to Case 1 of (a), P(R(1)) is G(1)-stable and the induced action is an additive action on a projective space with open orbit G(1)⋅[1R], and P(R(1))⊊P(R) as V(1)⊊m. Thus P(R(1)) is already a subspace satisfying Theorem 1.6 (i) and (ii).
Combining the above proof with Proposition 3.1, we have the following.
Proposition 3.3. Given an additive action on a hyperquadric Q with unfixed singularities, we represent the operation obtained in Theorem 1.6 by (R,W,F)↦(R(1),V(1),F(1)), then:
(i) Q(1) is a projective space if and only if V(1)⋅V(1)⊆V(1) if and only if V(1)=V(1).
(ii) Sing(Q)⊈K(Q(1)) if and only if Ker(F)⊈V(1), Sing(Q)=K(Q(1)) if and only if Ker(F)=V(1).
(iii) the operation is effective if and only if Ker(F)⫋V(1).
Proof. (i) By part (a) in the proof of Theorem 1.6, it suffices to show V(1)⋅V(1)⊆V(1) if V(1)=V(1). In this case, for any a,a′∈V(1) we have F(a,a′)=0, hence aa′∈W by Lemma 2.8 and aa′⋅Ker(F)=0 by the definition of V(1), concluding that V(1)⋅V(1)⊆V(1).
(ii) and (iii). By our definition of effective operation 1.7 and Sing(Q)=P(Ker(F)), it suffices to show K(Q(1))=P(V(1)). If Q(1) is a projective space then from part (b) in the proof of Theorem 1.6, for the action on Q(1) represented by (R(1),m(1)) we have K(Q(1))=P(m(1))=P(V(1))=P(V(1)) since in this case m(1)=P(V(1))=V(1) by Case 1 of part (a) in the proof of Theorem 1.6. If Q(1) is a hyperquadric, then K(Q(1))=Sing(Q(1))=P(Ker(F(1))) and Ker(F(1))=Ker(F(1)|V(1))) by Lemma 2.9. Finally as F(1)=F|R(1), we have Ker(F(1))=Ker(F|V(1))=V(1) by the definition of V(1), concluding the proof.
Our main result of this section is the following.
Proposition 3.4. For an additive action on a hyperquadric Q of corank 2 represented by (R,W,F). If Sing(Q)⊈Fix(Q) and dim(Q)⩾5, then for the operation obtained in Theorem 1.6 we have:
(i) codim(Q(1),Q)=codim(V(1),W)=1.
(ii) there exist b0∈m2∖W with F(1,b0)=1 and a K-basis of Ker(F), μ1,μ2, such that:
b0⋅m=μ1⋅m=0μ2⋅m⊆⟨μ1⟩V(1)⋅m⊆⟨μ1,b0⟩ |
(iii) if the operation is not effective, i.e., Ker(F)=V(1) or Ker(F)⊈V(1), then we can normalize the algebraic structrue of (R,W,F). (see Lemma 3.6 and Lemma 3.9 for details).
First applying Lemma 3.2 we have the following:
Lemma 3.5. (i) there exist suitable basis of Ker(F), μ1,μ2, s.t. μ1⋅m=0 and μ2⋅m⊆⟨μ1⟩.(ii) codim(V(1),W)=1.
Proof. (i) Applying Lemma 3.2 when l=2.
(ii) For any r∈W we have r⋅μ2=λr⋅μ1 for some λr∈K, this induces a linear form on W:
Φ:W↦Kα↦λα |
Hence we have V(1)=Ker(Φ) and codim(V(1),W)=1.
From now on we always choose a basis of Ker(F) satisying Lemma 3.5.(i).
We prove Proposition 3.4 through a case-by-case argument on analyzing the relation between Ker(F) and V(1). More precisely, we separate it into the following cases.
1. Sing(Q)⊆K(Q(1)), i.e., Ker(F)⊆V(1). In this case we have nice inclusions between subspaces: Ker(F)⊆V(1)⊆V(1)⊆W, for which we furtherly consider two subcases:
(1.a). Sing(Q)=K(Q(1)), i.e., Ker(F)=V(1). In this subcase, we can normalize the algebraic structure of (R,W,F).
(1.b). The operation on (Gna,Q) is effective, i.e., Ker(F)⊊V(1). In this subcase, it remains to determine the multiplication between elements in V(1) and V(1), which leads to our definition of (V(2),V(2)) and further discussions in Section 4.
2. Sing(Q)⊈K(Q(1)), i.e, Ker(F)⊈V(1). In this case, we can normalize the algebraic structure of (R,W,F).
Recall V(1)=Ker(F|V(1)) and Ker(F|W)=Ker(F) by Lemma 2.9, hence we can have a decomposition of W as follows:
W=Ker(F)⊕⟨e1,...,et⟩⊕⟨et+1⟩, | (3.1) |
where t⩾2, ei∈V(1) for 1⩽i⩽t, et+1∈W∖V(1) and F(ei,ej)=δi,j. Then we can furtherly choose a suitable b0 and ei,et+1 to give a normalization of this case:
Lemma 3.6. If Ker(F)=V(1), then let b0=e21 we have:
(i) b0∈m2∖W and b0⋅W=b0⋅m=0, V(1)⋅m⊆⟨μ1,b0⟩.
(ii) one can choose suitable ei,et+1 such that
et+1⋅ei=0,et+1⋅μ2=μ1,e2t+1=b0+δ⋅μ2, |
where 1⩽i⩽t, δ=1 if dim(m2)=3 and δ=0 if dim(m2)=2.
Proof. (i) As F(e1,e1)=1≠0 we have b0=e21∈m2∖W from Lemma 2.8. By formula (2.1) we can describe the multiplications in m as follows:
aa′=F(a,a′)⋅b0+V1(a,a′)⋅μ1+V2(a,a′)⋅μ2. | (3.2) |
Note that from e1∈V(1) we have b0⋅Ker(F)=0, hence to show b0⋅W=b0⋅m=0 it suffices to check b0⋅ei=0 for 1⩽i⩽t+1.
For any 1⩽i⩽t, we choose some j≠i. Then from ei,ej∈V(1) we have:
b0⋅ei=(e2j−V1(ej,ej)⋅μ1−V2(ej,ej)⋅μ2)⋅ei=e2j⋅ei=ej⋅(δi,j⋅b0+V1(ei,ej)⋅μ1+V2(ei,ej)⋅μ2)=0. | (3.3) |
For et+1 we have :
b0⋅et+1=e21⋅et+1=e1⋅(δ1,t+1⋅b0+V1(e1,et+1)⋅μ1+V2(e1,et+1)⋅μ2)=0. |
Now for any a∈V(1) and any a′∈W, by multiplying et+1 to both sides of equation (3.2) we have:
LHS=et+1⋅a⋅a′=a⋅(F(et+1,a′)⋅b0+V1(et+1,a′)⋅μ1+V2(et+1,a′)⋅μ2)=0.RHS=et+1⋅(−F(a,a′)⋅b0+V1(a,a′)⋅μ1+V2(a,a′)⋅μ2)=λt+1⋅V2(a,a′)⋅μ1 |
where et+1⋅μ2=λt+1⋅μ1 with λt+1≠0 by et+1∈W∖V(1). Hence form LHS=RHS we have V2(a,a′)=0. Thus V(1)⋅W⊆⟨b0,μ1⟩. Since W⋅⟨μ1,b0⟩=0 by arguments above, V(1)⋅W(k)=0 for all k⩾2. Since m is generated by W, we conclude that V(1)⊆⟨b0,μ1⟩.
(ii) Firstly as F(et+1,ei)=0 for 1⩽i⩽t and from (i) we have et+1⋅ei∈⟨μ1⟩. Thus if we replace ei by ei−λ−1t+1V1(ei,et+1)⋅μ2 then et+1⋅ei=0 and we still have F(ei,ej)=δi,j. Furtherly by (3.2) we have:
e2t+1=b0+V1(et+1,et+1)⋅μ1+V2(et+1,et+1)⋅μ2. |
then we can replace et+1 by et+1−V1(et+1,et+1)2λt+1⋅μ2 to make V1(et+1,et+1)=0. Note that this will not affect the multiplication of et+1 and ei for i⩽t. Then by (i) and Lemma 2.10 we conclude that V2(et+1,et+1)≠0 if and only if dim(m2)=3. Now if V2(et+1,et+1)≠0, we replace μ2 by V2(et+1,et+1)⋅μ2 to make e2t+1=b0+δ⋅μ2 and then replace μ1 by et+1⋅μ2 to make et+1⋅μ2=μ1.
In this subcase we start with the following observation.
Observation 3.7. codim(Ker(F),V(1))=1.
Proof. As Ker(F)⊆V(1)⊆V(1)⊆W and Ker(F|W)=Ker(F), we have a natural injective linear map:
V(1)/Ker(F)σ↦(W/V(1))∗¯α↦σ(¯α):¯β→F(α,β) |
hence codim(Ker(F),V(1))⩽codim(V(1),W)=1, concluding the proof.
Note that by the assumption of dim(W)⩾5 we have codim(V(1),V(1))⩾1. And by Ker(F|W)=Ker(F) we have a decomposition of W in this subcase:
W=V(1)⏞Ker(F)⏞⟨μ1,μ2⟩⊕⟨g1⟩⏟V(1)⊕⟨e1,e2,...,et⟩⊕⟨f1⟩(t⩾1) | (3.4) |
We now can find a suitable b0.
Lemma 3.8. Let b0=e21 then b0∈m2∖W and b0⋅W=b0⋅m=0, V(1)⋅m⊆⟨μ1,b0⟩.
Proof. First we check that b0⋅W=b0⋅m=0. For b0⋅g1=0:
b0⋅g1=e21⋅g1=e1⋅(F(e1,g1)⋅b0+V1(e1,g1)⋅μ1+V2(e1,g1)⋅μ2)=0, |
where the last equation follows from F(e1,g1)=0 and e1∈V(1).
To show b0⋅ei=0 for any 1⩽i⩽t. Firstly note that if t⩾2 then we can prove it by using the same computation as (3.3).
Now we assume t=1. As g1∈V(1)∖Ker(F) we can assume F(g1,f1)=1 moreover we can assume F(f1,e1)=0 up to replacing e1 by e1−F(e1,f1)⋅g1. Then the calculation of b0⋅e1 follows:
b0⋅e1=(f1⋅g1−V1(f1,g1)⋅μ1−V2(f1,g1)⋅μ2)⋅e1=g1⋅f1⋅e1=g1⋅(F(f1,e1)⋅b0+V1(f1,e1)⋅μ1+V2(f1,e1)⋅μ2)=0, |
where the last equation follows from g1∈V(1). Then the calculation of b0⋅f1 follows:
b0⋅f1=e21⋅f1=e1⋅(F(e1,f1)⋅b0+V1(e1,f1)⋅μ1+V2(e1,f1)⋅μ2)=0. |
Finally we conclude that V(1)⋅W⊆⟨b0,μ1⟩ by multiplyng f1 to both sides of the formula (3.2).
By Lemma 3.5 we have μ1⋅Ker(F)=0 and μ2⋅W⊆⟨μ1⟩, hence we can assume μ22=μ1. Now we have a decomposition of W:
W=⟨μ1,μ2⟩⊕⟨e1,...,et⟩, | (3.5) |
with F(ei,ej)=δi,j. Moreover for any ei with ei⋅μ2=λi⋅μ1 we can replace ei by ei−λi⋅μ2 to make ei⋅μ2=0, which does not affect the value of F(ei,ej) as μ2∈Ker(F). Then V(1)=⟨μ1,e1,...,et⟩ and we can find suitable b0 as before, which also gives a normalization of this subcase:
Lemma 3.9. Let b0=e21 then b0∈m∖W and
(i) b0⋅W=b0⋅m=0, V(1)⋅m⊆⟨μ1,b0⟩.
(ii) μ22=μ1, ei⋅μ2=ei⋅μ1=0.
Proof. It suffices to prove (i). First we note that we can use the same method in Lemma 3.6 to show b0⋅W=0. Then it suffices to prove V(1)⋅m⊆⟨μ1,b0⟩. For any a∈V(1), a′∈W equation (3.2) still holds and in this case we multiply it by μ2:
LHS=μ2⋅a⋅a′=0.RHS=μ2⋅(F(a,a′)⋅b0+V1(a,a′)⋅μ1+V2(a,a′)⋅μ2)=V2(a,a′)⋅μ1. |
Then from LHS=RHS we have V2(a,a′)=0, concluding the proof.
In this and next subsections we always consider additive actions on hyperquadrics of corank two with unfixed singularities. Firstly we give the algebraic version of the flow chart, which induces an algebraic structure sequence for a given triple (R,W,F). Then by analyzing the sequence we normalize the structure of (R,W,F). Finally we show the uniqueness of the normalized structure up to equivalences.
Recall in the proof of Theorem 1.6, we have represented an operation (Gna,Q,Pm)→(G(1),Q(1),L(1)) by (R,W,F)→(R(1),V(1),F(1)) or (R,W,F)→(R(1),V(1)). In Proposition 3.3, we also gave the algebraic criterion for the output condition in the flow chart. Thus the algebraic version of the flow chart naturally arises as the following:
![]() |
where for any (V(k),V(k)) if V(k)⋅V(k)≠0 we furtherly define:
V(k+1)={α∈V(k):α⋅V(k)=0}V(k+1)=Ker(F|V(k+1)) | (4.1) |
and we represent the final output by (x,s,V(s),V(s)), where for a output (x,t) we set s=t−1 if x∈{B,C} and s=t if x=A.
Then for the final output we obtain an algebraic structure sequence as follows:
Ker(F)=V(0)⊆...⊆V(s)⊆V(s)⊆...⊆V(0)=W, | (4.2) |
where V(k)⋅V(k−1)=0 for 1⩽k⩽s.
For the sequence, our first step is to generalize Proposition 3.4 (i) and Observation 3.7 to the following.
Proposition 4.1. For an algebraic structure sequence: {(V(k),V(k)):0⩽k⩽s}:
A(k): if V(k+1)⫋V(k) then codim(V(k+1),V(k))=1;
B(k): if V(k)⫋V(k+1) then codim(V(k),V(k+1))=1.
Proof. Firstly note that if V(k+1)⫋V(k) then V(i+1)⫋V(i) for any i⩽k−1, similarly if V(k)⫋V(k+1) then V(i)⫋V(i+1) for any i⩽k−1. Hence we can prove A(k)and B(k) by induction on k.
For k=0, A(0) follows from Lemma 3.5 and B(0) follows from Observation 3.7. Now assuming A(k−1) and B(k−1) is true for some k⩾1, then for a given (V(k),V(k)) in the process we already have V(k−1)⫋V(k)⊆V(k)⫋V(k−1) with V(k)⋅V(k−1)=0 and codim(V(k−1),V(k))=1 by induction. Now since (R,W,F) represents an action on a hyperquadric of corank two with unfixed singularities and V(k)⊆V(0)=W,V(k)⊆V(1), we have V(k)⋅V(k)⊆V(1)⋅W⊆⟨μ1⟩ by Proposition 3.4 (ii). Hence by the definition of V(k+1) we conclude that codim(V(k+1),V(k))⩽1, implying A(k).
Now if V(k)⫋V(k+1) then from the process we already have V(k+1)⫋V(k) and A(k) holds. Moreover we have the chain V(k)⫋V(k+1)⊆V(k+1)⫋V(k), which induces an injective map:
V(k+1)/V(k)σk↦(V(k)/V(k+1))∗¯α↦σ(¯α):¯β↦F(α,β) |
It follows that , implying .
In this subsection we normalize the structure of by analyzing the algebraic structure sequence case by case.
In the following, we always start with a and a basis of , , satisfying Proposition 3.4. We furtherly define .
Case 1. . In this case the sequence becomes
with for (here as we assume there exist unfixed singular points). Then we have the following normalization.
Lemma 4.2. (i) If then there exist , for , and such that
(4.3) |
and
(4.4) |
for , , , when ,
and the matrix is of the canonical form (see (4.6) below).
(ii) If then there exist , for , such that
for , , when , and is the same as in (i).
Proof. Recall by Proposition 3.4 (ii) we always have and . Hence if choosing any nonzero and any nonzero then we can have for some nonzero as , and . Moreover choosing any nonzero we have from the definition of .
(i) If we can choose 's satisfying (4.3), i.e., . Then we find inductively. For we first choose , and s.t. , and . Then for the multiplications:
we can normalize them through the following steps:
for some , where the arrow means to replace by .
Now if and assuming we have found for some satisfying (4.4) except that if there exist such that then for some nonzero . Then we furtherly choose , and \, s.t. , and . And we normalize the multiplications through the following steps. Firstly:
to make for all . Then
for some . Moreover from the discussion at the beginning we have with some nonzero . And from we have if and only if . Finally note that the symmetric matrix under orthogonal transformations on transforms as the matrix of a bilinear form. And a such transformation will not affect our normalization on other elements, hence from [5,Chapter XI § 3], can be transformed into a canonical symmetric block diagonal matrix (see (4.6) in Proposition 4.3).
To finish our normalization it suffices to make and . To do this we firstly replace by and replace by . Then the condition gives a system of equations for :
(4.5) |
for which we have a solution to be calculated inductively:
concluding the normalization.
(ii) If then the process of normalization will be the same as in (i) except that we do not need to choose at the beginning.
Following our normalization we can thus determine the normalized structure of in Case 1.
Proposition 4.3 (Classification of ). can be transformed into the following:
: is a projective space (equivalently )
.
, when where
: is a hyperquadric (equivalently ).
.
when where is the same as in and is of the standard form, i.e., a symmetric block diagonal -matrix such that each block is
(4.6) |
with some .
Case 2. . In this case the sequence becomes
with for and . We have the following normalization.
Lemma 4.4. (i) If and then there exist , for , and such that
(4.7) |
and
(4.8) |
for , , , when ,
and the matrix is of the canonical form (4.6).
(ii) If and then there exists , for , such that
for , , when , and is the same as in (i).
(iii) If then there exists a basis of and such that and
and the matrix is of the canonical form (4.6).
Proof. (i) As in Case 1.(i) we can first choose satisfying (4.7). Also we can choose , and s.t. , and . Then as , and we conclude that is a nonzero element in and hence we can assume . Now we normalize the multiplications between through the following steps:
for some .
After this note that we can still use previous inductive operations in Case 1 to find for , namely we can find suitable satisfying (4.8) except that we have and for some nonzero and if and only if . Also for the same reason as in Case 1 we can assume is of the canonical form.
Now to finish our normalization we replace by , replace by and replace by . Then it suffices to satisfy the condition , which gives a system of equations for :
for which we have a solution (where ) to be calculated inductively:
concluding our normalization.
(ii) If then the process will be the same as (i) except that we do not need to choose at the beginning.
(iii) Note that is equivalent to , which is just the Case 2 in the proof of Proposition 3.4. Hence the assertion follows from Lemma 3.9.
We can now determine the algebraic structure of in Case 2.
Proposition 4.5 (Classification of ). can be transformed into the following:
: ()
where is of the canonical form (4.6).
: and is a projective space (equivalently ).
,
, , , when where is the same as in Type .
: and is a hyperquadric (equiuvalently ).
,
, , when
where is of the canonical form (4.6) and is the same as in .
Case 3. . In this case the algebraic sequence becomes
with if and . We have the following normalization.
Lemma 4.6. (i) If and then there exist , for , and such that
(4.9) |
and
(4.10) |
for , , , , ,
and the matrix is of the canonical form (4.6).
(ii) If and then there exist , for , such that
for , , , , and is the same as in (i).
(iii) If then there exist such that and:
for and is the same as in (i).
Proof. (i) Firstly we can choose satisfying (4.9) and from we can choose s.t. and . Furtherly we can choose , and s.t. , and . Moreover we have for some nonzero . Now we normalize the multiplications between through the following steps:
and for any
After this as in Case 1 and 2, we can still inductively find suitable satisfying (4.10) except that we have and for some nonzero and if and only if . Also we can assume is of the canonical form (4.6).
Now to finish our normalization we again replace by , replace by and replace by . Then the condition gives a system of equations for :
where , and for which we have a solution:
where , concluding the normalization.
(ii) If then similarly the process will be the same as (i) except that we do not need to choose at the beginning.
(iii) If then the assertion follows from Lemma 3.6.
Proposition 4.7 (Classification of ). can be transformed into the following:
: (equivalently )
where is of the canonical form (4.6) and is the same as in Type .
: is a projective space (equivalently )
where is the same as in .
: is a hyperquadric (equivalently ).
where is of the canonical form (4.6) and is the same as in .
We now give a characterization of .
Proposition 4.8. Given an additive action on a hyperquadric of corank two with unfixed singularities and , we represent it by with the maximal ideal, then .
Proof. Note that for any , . Thus the boundary as for any invertible element in . Then for any in the boundary, as , we have , concluding that . On the other hand, by our normalization results of each type, we can find a suitable element in the boundary whose orbit has dimension as follows.
If the action is not of Type or . By Lemma 4.2, Lemma 4.4 and Lemma 4.6, we have and .
If the action is of Type . By Lemma 4.4, we have and , where .
If the action is of Type . By Lemma 4.6 (iii), we have and , where .
In the following for a normalized structure of each type we call the normalized basis of , i.e., a set of normalized elements and we call the matrix (if exists) to be the canonical matrix of the action.
In this section we finish our classification by showing that the normalized structrue is determined by and the canonical matrix(if exists) up to certain elementary transformations.
Given two additive actions on hyperquadrics of corank two with unfixed singularities and for , we represent them by and respectively, and represent their final outputs in the algebraic version of flow chart by and respectively. Furthermore define and to be the algebraic sturcture sequences of the two actions. Then we have the following.
Theorem 4.9. (i) If the two actions are equivalent, i.e., there exist
such that is a local -algebra isomorphism and . Then
(i.a) and are of the same normalized type with and .
(i.b) if they are of Type , or , then they have the same normalized structure.
(i.c) if they are not of Type , or , then their canonical matrices and differ up to a permutation of blocks, a scalar multiplication, and adding a scalar matrix (which we call elementary transformations).
Conversely
(ii) if the two actions are of the same type with and when they are not of Type , or , suppose that their canonical matrices differ up to above elementary transformations. Then the two actions are equivalent.
We first prove (i.a) and (i.b).
Proof of Theorem 4.9 (i.a) and (i.b). (i.a) Firstly as is an isomorphism, we conclude that by Proposition 4.8. By and Lemma 2.7 we have for some nonzero , for any . Then from the algebraic version of the flow chart and our definition of for each , we conclude that , and for each , implying that the two actions are of the same normalized type shown in Section 4.1.2.
(i.b) Note that the set of normalized elements of these types does not contain hence the structure only depends on and by our normalization result, concluding the proof.
To prove (i.c) and (ii), we separate it into two cases.
Case 1. If , let and be the associated elements in the normalized structures respectively. Then the isomorphism gives :
(4.11) |
(4.12) |
(4.13) |
(4.14) |
where , and , , . Moreover we define then we have the following.
Lemma 4.10. (i)
(ii) , and .
(iii) .
Proof. (i) Let . Then under the notation of Lemma 2.8 we have:
(ii) The first assertion follows from and . For , from we have:
concluding that as is nonzero in . For , from we have
concluding that , hence and .
(iii) Using (i) and (4.14) we have :
concluding that .
Now we are ready to prove Theorem 4.9 (i.c) and (ii) when .
Proof of Theorem 4.9 (i.c), (ii) when . (i.c) Computing :
where if , i.e., the action is of Type . And we claim in this case , implying . This follows from computing from two sides.
Now from combined with we have the equation:
hence from [5,Chapter XI § 3] we conclude that and differ up to the listed elementary transformations.
(ii) If the two actions have the same normalized type with , , and differ up to elementary transformations, then by our normalization result, to give the isomorphism between actions it suffices to find a new set of normalized elements of having the canonical matrix which equals . In the following we find the new normalized set case by case.
1). (up to a permutation of blocks) Note that any permutation of blocks can be induced by a permutation of . Hence the new set of normalized elements can be defined through a suitable permutation of and identity on other elements.
2). (up to adding a scalar matrix) we assume for some nonzero .
In this case it suffices to find a new set of normalized elements with , and . To find the set we run our normalization in Section 4.1.2 starting with and set to be the initial elements we take at each step of the normalization. Then one can easily check that after running the normalization of each type, the new set of normalized elements meets our need.
3). (up to a scalar multiplication) we assume for some nonzero .
In this case it suffices to find a new set of normalized elements with for some nonzero s.t. . To find the elements, we define , and . Then the condition () and extra conditions in different types shown in Section 4.1.2 gives a system of equations for each type:
(Type ) with the condtion for each type.
For these equations one can easily check the existence of solutions, which enables us to find the set of normalized elements we need.
Case 2. If , i.e., they are of Type or , then we can use similar method in Case 1 to prove (i.c) and also to prove (ii) when the two canonical matrices differ from a permutation of blocks or adding a scalar matrix. Hence it sufficies to prove (ii) when and differ from a scalar multiplication.
As is Case 1, it sufficies to find a new set of normalized elements for some nonzero s.t. .
Now if the action is of Type we set
Then one can check is the normalized set we need.
If the action is of Type we set
Then one can check is the normalized set we need, concluding the proof of Theorem 4.9.
As an application of our classification, we now prove Theorem 1.8.
Proof of Theorem 1.8. (i) Recall in Section 3.1 we have constructed or to be the corresponding local algebra (and invariant linear form on it) of the obtained action in Theorem 1.6. Hence combined with the algebraic version of the flow chart, for a normalized structure of an additive action , if the final output of the flow chart is , then the output action is represented by
where when and when or . Then (i) follows by Remark 2.1 and by checking the multiplications in in different types as shown in Lemma 4.2, 4.4 and 4.6.
(ii) follows from Proposition 4.8 and our normalization result of each types. follows from Proposition 4.1.
(iii) Now for two actions if they are equivalent induced by then from Theorem 4.9 (i.a) they are of the same normalized type and . Moreover as we conclude that induces an isomorphism between the output actions of the two actions, which proves the only if part of Theorem 1.8.
For the converse, it suffices to check the condition in Theorem 4.9 (ii). If then they are of the same type . If , then as the output action is equivalent, and are either both hyperquadrics or projective spaces, hence they are of the same type or .
Now if they are of Type or Type , then consider the isomorphism between local algebras induced by the equivalence of the output actions:
using the same method in the proof of Theorem 4.9 (i.c), will induce elementary transformations between the canonical matrices of the two actions. Therefore by Theorem 4.9 (ii) we conclude that the two actions are equivalent.
In this subsection we consider the case when . Equivalently for a triple we have .
In the folowing we always take a basis of satisfying Lemma 3.5 (i). We also take defined in Section 3. Then we give the classification case by case.
Case 1.
Subcase (i): . Note that in the proof of Case 2 of Proposition 3.4 we only need to assure the number of is at least two, hence this case is just the 4-dimensional version of Type .
Subcase (ii): and . We have the following:
with . In ths case, we can choose a such that as . Then for any , up to relplacing it by , we can have . Finally as , hence we can have . Then we divide it into two more subcases.
then there exist a basis of , and s.t.
for some .
To show this, from , , and our assumption we conclude that for some nonzero . Now we can normalize in the following steps:
First we define then we replace by , replace by and finally we replace by .
Then the classification of this case follows:
and is isomorphic to
Moreover for the coefficient we have the following uniqueness result which is easy to check.
Proposition 4.11. Two actions of Case (ii.1) with coefficients and respectively are equivalent if and only if .
. Then choosing we have and . Moreover we see for some nonzero . And we set . Now we can normalize through the follwoing steps:
and if (i.e., ) we replace by to make then replace by to keep . This enables us to give the classification of this case:
and is isomorphic to
where is the same as we define in Section 4.1.2.
Subcase (iii): and .
Then we can choose s.t. and . And we divide it into two more subcases.
() . We set and replace by , then we replace by to make . Thus we have:
for some . Now if then we can furtherly make through replacing elements as the following:
Then our classification of this case follows:
and is isomorphic to
or
, depending on whether equals to zero or not.
. We divide it into two more subcases.
If then we have:
and is isomorphic to
If then we have:
and is isomorphic to
or
where one can easily check these two actions are not equivalent.
Case 2. Then we have two subcases as follows.
Subcase (i): then we have:
and is isomorphic to
, if \ and .
, if \ and .
, if .
Subcase (ii): then we have:
and is isomorphic to
, if and .
, if and .
, if \end{mycases}
I am grateful to Baohua Fu for introducing the problem, guidance and revising this paper. I am also grateful to Zhijun Luo for helpful discussions. I would like to thank the referee for many valuable comments and suggestions.
The author declares there is no conflict of interest.
[1] |
B. Hassett, Y. Tschinkel, Geometry of equivariant compactifications of {}, Int. Math. Res. Not., 22 (1999), 1211–1230. https://doi.org/10.1155/S1073792899000665 doi: 10.1155/S1073792899000665
![]() |
[2] | I. Arzhantsev, A. Popovskiy, Additive actions on projective hypersurfaces, in Automorphisms in birational and affine geometry (eds. J. McKernan, C. Ciliberto, M. Zaidenberg, I. Cheltsov), Springer Proceedings in Mathematics and Statistics, (2014), 17–33. https: //doi.org/10.1007/978-3-319-05681-4_2 |
[3] |
I. Arzhantsev, E. V. Sharoyko, Hassett-{T}schinkel correspondence: modality and projective hypersurfaces, J. Algebra, 348 (2011), 217–232. https://doi.org/10.1016/j.jalgebra.2011.09.026 doi: 10.1016/j.jalgebra.2011.09.026
![]() |
[4] |
S. Friedland, Simultaneous similarity of matrices, Adv. Math., 50 (1983), 189–265. https://doi.org/10.1016/0001-8708(83)90044-0 doi: 10.1016/0001-8708(83)90044-0
![]() |
[5] | F. R. Gantmacher, The theory of matrices. Vol. 1, Translated from the Russian by K. A. Hirsch, Reprint of the 1959 translation, AMS Chelsea Publishing, Providence, RI, 1998. |
[6] |
E. V. Sharoyko, The Hassett-Tschinkel correspondence and automorphisms of a quadric, Mat. Sb., 200 (2009), 145–160. https://doi.org/10.1070/SM2009v200n11ABEH004056 doi: 10.1070/SM2009v200n11ABEH004056
![]() |
1. | Иван Владимирович Аржанцев, Ivan Arzhantsev, Юлия Ивановна Зайцева, Yulia Ivanovna Zaitseva, Эквивариантные пополнения аффинных пространств, 2022, 77, 0042-1316, 3, 10.4213/rm10046 | |
2. | Ivan Arzhantsev, Yulia Ivanovna Zaitseva, Equivariant completions of affine spaces, 2022, 77, 0036-0279, 571, 10.4213/rm10046e | |
3. | Ivan Arzhantsev, On conjugacy of additive actions in the affine Cremona group, 2024, 47, 1607-3606, 1767, 10.2989/16073606.2024.2344039 | |
4. | Ivan Beldiev, Gorenstein Algebras and Uniqueness of Additive Actions, 2023, 78, 1422-6383, 10.1007/s00025-023-01972-w |