This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Computing Galois Groups of Fano Problems

Thomas Yahl T. Yahl
Department of Mathematics
Texas A&M University
College Station
Texas  77843
USA
thomasjyahl@math.tamu.edu http://www.math.tamu.edu/ thomasjyahl
Abstract.

A Fano problem consists of enumerating linear spaces of a fixed dimension on a variety, generalizing the classical problem of 27 lines on a cubic surface. Those Fano problems with finitely many linear spaces have an associated Galois group that acts on these linear spaces and controls the complexity of computing them in suitable coordinates. These Galois groups were first defined and studied by Jordan, who in particular considered the problem of lines in 3\mathbb{P}^{3} on a cubic surface. Recently, Hashimoto and Kadets determined the Galois groups for a special family of Fano problems and showed that all other Fano problems have Galois group that contains the alternating group. A complete classification of Galois groups of Fano problems rests on the determination of these Galois groups. We use computational tools to prove that several Fano problems of moderate size have Galois group equal to the symmetric group, each of which were previously unknown.

1. Introduction

The classical problem from enumerative geometry to describe the set of 27 lines in 3\mathbb{P}^{3} on a smooth cubic surface is one of the first examples of a Fano problem: enumerating rr–planes in n\mathbb{P}^{n} lying on a variety XX. The Grassmanian is a complex projective varieties that parameterizes the set of all rr–planes in n\mathbb{P}^{n}, and the family of rr–planes that lie on XX is a subscheme of the Grassmanian called the Fano scheme of XX. We consider XX a general complete intersection, where invariants such as dimension and degree of its Fano scheme are determined using combinatorial data. When the Fano scheme of XX is finite, we call the problem of describing its Fano scheme a Fano problem. This setting covers familiar problems such as lines in 3\mathbb{P}^{3} on a cubic surface and lines in 4\mathbb{P}^{4} on the intersection of two quadric hypersurfaces.

To each Fano problem there is an associated Galois group which acts on the Fano scheme of XX. Jordan was the first to study these Galois groups in his work “Traité des Substitutions et des Équations Algébriques” in which he noted that the Galois group of an enumerative problem must preserve intrinsic structure of the problem [11]. Jordan further instituted the idea that the Galois group of an enumerative problem must be as large as these structures permit. For instance, the Galois group of the problem of lines in 3\mathbb{P}^{3} on a cubic surface must preserve the incidences among these lines. From this, Jordan observed this Galois group is a subgroup of the Coxeter group E6E_{6}, and it has since been shown that this Galois group is equal to E6E_{6} by Harris.

Harris observed that the algebraic Galois groups Jordan defined are geometric monodromy groups, an idea tracing back to Hermite [10]. Using this, he generalized Jordan’s work by studying the Galois group of the problem of lines in n\mathbb{P}^{n} on a hypersurface of degree 2n32n-3. After showing Jordan’s inclusion to be an equality (the case n=3n=3), he showed that for n4n\geq 4 the Galois group is the symmetric group acting on a general Fano scheme—such a Galois group is called fully symmetric. To show this, Harris proved these Galois groups are two–transitive and showed they contain a simple transposition. This simple transposition is the result of an explicitly constructed point whose local monodromy yields a simple transposition. We use Harris’ technique of producing a simple transposition to determine Galois groups of other Fano problems.

The study of Galois groups of Fano problems then laid dormant until Hashimoto and Kadets nearly determined them in all cases [7]. They first proved the Fano problem of rr–planes in 2r+2\mathbb{P}^{2r+2} on the intersection of two quadrics has Galois group equal to the Coxeter group D2r+3D_{2r+3} for r1r\geq 1. Then it was shown that these Fano problems and the problem of lines on a cubic surface are enriched in the sense that these are the only Fano problems where the rr–planes of the Fano scheme intersect. Using this, it was shows that all other Fano problems have Galois group that is highly transitive and contains the alternating group—such a Galois group is said to be at least alternating.

By the results of Hashimoto and Kadets, the open problem of classifying Galois groups of Fano problems rests on determining whether those at least alternating Galois groups of Fano problems are equal to the alternating group or the symmetric group. Towards this goal, we use computational tools to prove Galois groups of Fano problems of moderate size are fully symmetric. We do so by using Harris’ technique of exhibiting a simple transposition for these Fano problems. This transposition is the result of producing a system satisfying certain properties and we verify those properties with a mixture of exact computation and numerical certification.

Refer to caption
Figure 1. 27 lines on a smooth cubic surface

2. Fano Problems

The family of rr–planes in n\mathbb{P}^{n} is a complex irreducible projective variety known as the Grassmanian 𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n}) and is of dimension (r+1)(nr)(r+1)(n-r). For a variety XnX\subseteq\mathbb{P}^{n} its Fano scheme is the subscheme of 𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n}) of rr–planes that lie on XX. We study Fano schemes uniformly in the setting that XX is a general complete intersection.

When XnX\subseteq\mathbb{P}^{n} is a codimension ss subvariety, XX is the zero locus of homogeneous polynomials F=(f1,,fs)F=(f_{1},\dotsc,f_{s}) in n+1n+1 variables. Write d=(d1,,ds)d_{\bullet}=(d_{1},\dotsc,d_{s}) for the sequence of respective degrees of these polynomials, degfi=di\deg f_{i}=d_{i}. We make the assumption that di2d_{i}\geq 2 for i=1,,si=1,\dotsc,s, since otherwise some fif_{i} is linear from which we may consider Xn1X\subseteq\mathbb{P}^{n-1}. Since a general complete intersection XX is smooth, it contains no rr–planes of dimension r>12dimXr>\frac{1}{2}\dim X—so we require that 2rns2r\leq n-s from this point.

Let (r,n,d)\mathbb{C}^{(r,n,d_{\bullet})} denote the space of systems of complex homogeneous polynomials F=(f1,,fs)F=(f_{1},\dotsc,f_{s}) in n+1n+1 variables and of respective degrees d=(d1,,ds)d_{\bullet}=(d_{1},\dotsc,d_{s}). The zero set of a general system F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} defines a smooth complete intersection in n\mathbb{P}^{n}, whose Fano scheme of rr–planes we consider. For a system F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})}, write 𝒱r(F)𝔾(r,n)\mathcal{V}_{r}(F)\subseteq\mathbb{G}(r,\mathbb{P}^{n}) for the Fano scheme of rr–planes on its zero set in n\mathbb{P}^{n}. We say a Fano scheme is general if it is the Fano scheme of a general system F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})}. Invariants such as dimension and degree of general Fano schemes are determined by the combinatorial data (r,n,d)(r,n,d_{\bullet}), called the type of the Fano scheme.

We determine the expected dimension of a Fano scheme of a given type (r,n,d)(r,n,d_{\bullet}). Fix F=(f1,,fs)(r,n,d)F=(f_{1},\dotsc,f_{s})\in\mathbb{C}^{(r,n,d_{\bullet})}. We note that 𝒱r(F)\ell\in\mathcal{V}_{r}(F) exactly when F|=0F|_{\ell}=0, or equivalently fi|=0f_{i}|_{\ell}=0 for i=1,,si=1,\dotsc,s. Each restriction fi|f_{i}|_{\ell} is a degree did_{i} form on \ell, and the space of such forms has dimension (di+rr)\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right). As such, we expect the vanishing of these forms to have codimension i=1s(di+rr)\sum_{i=1}^{s}\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right) and the dimension of 𝒱r(F)\mathcal{V}_{r}(F) to be

δ(r,n,d)=(r+1)(nr)i=1s(di+rr).\displaystyle{\color[rgb]{0,0.22,0.66}\definecolor[named]{pgfstrokecolor}{rgb}{0,0.22,0.66}\delta(r,n,d_{\bullet})}=(r+1)(n-r)-\sum_{i=1}^{s}\begin{pmatrix}d_{i}+r\\ r\end{pmatrix}.

There is an alternative view of this description of the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F). Each F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} determines a section of a certain vector bundle (this is a direct sum of symmetric powers of the dual of the tautological bundle on 𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n})) and the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) is the vanishing locus of this section. This vector bundle has rank i=1s(di+rr)\sum_{i=1}^{s}\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right) and thus we arrive at the same expected dimension. Debarre and Manivel [4] take this view to show this expected dimension is the dimension for general Fano schemes.

Theorem 1 (Debarre,Manivel).

The general Fano scheme of type (r,n,d)(r,n,d_{\bullet}) is non-empty, smooth, and has dimension δ(r,n,d)\delta(r,n,d_{\bullet}) when δ(r,n,d)0\delta(r,n,d_{\bullet})\geq 0 and is empty otherwise.

We say the Fano problem (r,n,d)(r,n,d_{\bullet}) is the problem of describing a general Fano scheme of type (r,n,d)(r,n,d_{\bullet}), where δ(r,n,d)=0\delta(r,n,d_{\bullet})=0. That is, a Fano problem is that of describing a finite general Fano scheme.

Since the Grassmanian is a projective variety, a Fano scheme has a well-defined degree. For a fixed tuple (r,n,d)(r,n,d_{\bullet}), there is a generic degree given as the maximal degree of a Fano scheme of this type. For a Fano problem (r,n,d)(r,n,d_{\bullet}), this degree is written deg(r,n,d)\deg(r,n,d_{\bullet}) and is the cardinality of a general Fano scheme of type (r,n,d)(r,n,d_{\bullet}). By describing the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) as the vanishing locus of a section of a certain vector bundle, the degree of a Fano problem can be computed by a chern class computation. Debarre and Manivel explicitly computed this quantity using the splitting lemma and properties of Schur polynomials.

Define the quantities

Qr,d(x)=a0++ar=dai0(a0x0++arxr)[x0,,xr]\displaystyle Q_{r,d}(x)=\prod_{\stackrel{{\scriptstyle a_{i}\in\mathbb{Z}_{\geq 0}}}{{a_{0}+\dotsb+a_{r}=d}}}(a_{0}x_{0}+\dotsb+a_{r}x_{r})\in\mathbb{Z}[x_{0},\dotsb,x_{r}]

and Qr,d(x)=Qr,d0(x)Qr,ds(x)Q_{r,d_{\bullet}}(x)=Q_{r,d_{0}}(x)\dotsb Q_{r,d_{s}}(x), as well as the Vandermonde polynomial

V(x)=0i<jr(xixj).\displaystyle V(x)=\prod_{0\leq i<j\leq r}(x_{i}-x_{j}).
Theorem 2 (Debarre,Manivel).

The degree of the Fano problem (r,n,d)(r,n,d_{\bullet}), deg(r,n,d)\deg(r,n,d_{\bullet}), is equal to the coefficient of x0nx1n1xrnrx_{0}^{n}x_{1}^{n-1}\dotsb x_{r}^{n-r} in the product Qr,d(x)V(x)Q_{r,d_{\bullet}}(x)V(x).

When a Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) of a Fano problem is finite (as is expected), there are deg(r,n,d)\deg(r,n,d_{\bullet}) many points of the Fano scheme counting multiplicity. Table 1 shows some Fano problems of small degree. Note the first two rows are the familiar problem of 16 lines in 4\mathbb{P}^{4} on the intersection of two quadric hypersurfaces and the problem of 27 lines in 3\mathbb{P}^{3} on a cubic hypersurface.

Table 1. Fano problems of small degree
r~{}r~{} n~{}n~{} d~{}d_{\bullet}~{} deg(r,n,d)~{}\deg(r,n,d_{\bullet})~{}  Galois Group
1 4 (2,2)(2,2) 16 D5D_{5}
1 3 (3)(3) 27 E6E_{6}
2 6 (2,2)(2,2) 64 D7D_{7}
3 8 (2,2)(2,2) 256 D9D_{9}
1 7 (2,2,2,2)(2,2,2,2) 512 S512S_{512}
1 6 (2,2,3)(2,2,3) 720 S720S_{720}
4 10 (2,2)(2,2) 1024 D11D_{11}
2 8 (2,2,2)(2,2,2) 1024 S1024S_{1024}

Lower bounds exist for deg(r,n,d)\deg(r,n,d_{\bullet}), which can then be used to enumerate Fano problems with degree less than a given amount. For instance, we use the following lower bounds on the degree of a Fano problem to enumerate Fano problems.

Proposition 3.

Let (r,n,d)(r,n,d_{\bullet}) be a Fano problem. We have

deg(r,n,d)1isjdi1jr+1(dij)(r+1j)1isdir+1.\displaystyle\deg(r,n,d_{\bullet})\geq\prod_{1\leq i\leq s\,}\prod_{\stackrel{{\scriptstyle 1\leq j\leq r+1}}{{j\mid d_{i}}}}\left(\frac{d_{i}}{j}\right)^{\left(\begin{smallmatrix}r+1\\ j\end{smallmatrix}\right)}\geq\prod_{1\leq i\leq s}d_{i}^{r+1}.
Proof.

For the first inequality, consider the product expansion of Qr,di(x)Q_{r,d_{i}}(x) for fixed ii. For each 1jr+11\leq j\leq r+1 such that jdij\mid d_{i}, there are (r+1j)\left(\begin{smallmatrix}r+1\\ j\end{smallmatrix}\right) many terms of the product with jj of the aka_{k} equal to di/jd_{i}/j. The quantity di/jd_{i}/j then factors out of each of these (r+1j){\left(\begin{smallmatrix}r+1\\ j\end{smallmatrix}\right)} many terms and appears as a constant factor of Qr,di(x)Q_{r,d_{i}}(x) with this respective power. Hence this is a factor of every term of Qr,d(x)V(x)Q_{r,d_{\bullet}}(x)V(x) and of deg(r,n,d)\deg(r,n,d_{\bullet}). ∎

3. Galois Groups of Fano Problems

A Fano problem (r,n,d)(r,n,d_{\bullet}) determines an incidence correspondence.

Γ={(F,)(r,n,d)×𝔾(r,n):F|=0}\Gamma=\left\{(F,\ell)\in\mathbb{C}^{(r,n,d_{\bullet})}\times\mathbb{G}(r,\mathbb{P}^{n}):F|_{\ell}=0\right\}π(r,n,d)\pi_{(r,n,d_{\bullet})}(r,n,d)\mathbb{C}^{(r,n,d_{\bullet})}𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n})

The map ρ\rho realizes the incidence variety Γ\Gamma as a vector bundle over 𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n}). Indeed, the fiber over 𝔾(r,n)\ell\in\mathbb{G}(r,\mathbb{P}^{n}) is the kernel of the surjective linear map restricting homogeneous forms F=(f1,,fs)F=(f_{1},\dotsc,f_{s}) of respective degrees dd_{\bullet} to homogeneous forms on \ell of the same respective degrees. The codimension of these fibers in (r,n,d)\mathbb{C}^{(r,n,d_{\bullet})} is then equal to i=1s(di+rr)=(r+1)(nr)\sum_{i=1}^{s}\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right)=(r+1)(n-r); it follows that Γ\Gamma is smooth and of dimension dim(r,n,d)\dim\mathbb{C}^{(r,n,d_{\bullet})}.

Given F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})}, the fiber π(r,n,d)1(F)\pi_{(r,n,d_{\bullet})}^{-1}(F) is the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F). By the results of Debarre and Manivel, there is a Zariski open set U(r,n,d)U\subseteq\mathbb{C}^{(r,n,d_{\bullet})} (in particular dense, open, and path-connected) with the property that if FUF\in U, the fiber π(r,n,d)1(F)\pi_{(r,n,d_{\bullet})}^{-1}(F) consists of deg(r,n,d)\deg(r,n,d_{\bullet}) smooth points. It follows that the restriction of π(r,n,d)\pi_{(r,n,d_{\bullet})} to π(r,n,d)1(U)\pi_{(r,n,d_{\bullet})}^{-1}(U) is a smooth covering space of degree deg(r,n,d)\deg(r,n,d_{\bullet}).

Fix a base point FUF\in U. Every directed loop in UU based at FF lifts to deg(r,n,d)\deg(r,n,d_{\bullet}) paths in Γ\Gamma each starting at distinct poitns of the fiber π(r,n,d)1(F)\pi_{(r,n,d_{\bullet})}^{-1}(F); the endpoints of these paths determine a permutation of this fiber. The set of all permutations obtained this way is the monodromy group of π(r,n,d)\pi_{(r,n,d_{\bullet})} and is defined up to isomorphism for different choices of base point FUF\in U and reordering of the fiber π(r,n,d)1(F)\pi_{(r,n,d_{\bullet})}^{-1}(F). The monodromy group of π(r,n,d)\pi_{(r,n,d_{\bullet})} acts transitively on the fiber π(r,n,d)1(F)\pi_{(r,n,d_{\bullet})}^{-1}(F) since the incidence variety Γ\Gamma is irreducible, while higher transitivity is equivalent to irreducibility of fiber products of the incidence variety with itself [9, 16]. More detail about monodromy groups can be found in [8].

Definition 4.

The Galois group 𝒢(r,n,d)\mathcal{G}_{(r,n,d_{\bullet})} of the Fano problem (r,n,d)(r,n,d_{\bullet}) is the monodromy group of the restriction of π(r,n,d)\pi_{(r,n,d_{\bullet})} to a covering space.

These Galois groups were first defined algebraically by Jordan [11]. The map π(r,n,d):Γ(r,n,d)\pi_{(r,n,d_{\bullet})}:\Gamma\to\mathbb{C}^{(r,n,d_{\bullet})} induces a reverse inclusion of the function fields of these varieties ((r,n,d))(Γ)\mathbb{C}(\mathbb{C}^{(r,n,d_{\bullet})})\hookrightarrow\mathbb{C}(\Gamma). This expresses (Γ)\mathbb{C}(\Gamma) as an algebraic extension of ((r,n,d))\mathbb{C}(\mathbb{C}^{(r,n,d_{\bullet})}) of degree deg(r,n,d)\deg(r,n,d_{\bullet}). The Galois group of the Fano problem (r,n,d)(r,n,d_{\bullet}) defined by Jordan is the Galois group of the normal closure of this field extension. The equivalence of the geometric definition with this algebraic definition was shown by Harris [6], but traces back to Hermite [10].

Jordan considered the problem of lines in 3\mathbb{P}^{3} on a cubic surface and its Galois group, 𝒢(1,3,(3))\mathcal{G}_{(1,3,(3))}. He observed that the Galois group acting on a given Fano scheme must preserve the incidence structure of the lines, and so is a subgroup of the Coxeter group E6E_{6}. Harris later proved Jordan’s inclusion to be an equality, 𝒢(1,3,(3))=E6\mathcal{G}_{(1,3,(3))}=E_{6}, and studied a generalization of this problem. He showed that for n4n\geq 4, the Fano problem of lines in n\mathbb{P}^{n} on a hypersurface of degree 2n32n-3 has Galois group equal to the symmetric group [6], such a Galois group is called fully symmetric. To prove his result, Harris observed for n4n\geq 4 the Galois groups 𝒢(1,n,(2n3))\mathcal{G}_{(1,n,(2n-3))} are highly transitive and observed systems F(1,n,(2n3))F\in\mathbb{C}^{(1,n,(2n-3))} whose local monodromy generates a simple transposition.

Hashimoto and Kadets later took up the study of these Galois groups more generally. They studied the Fano problem of rr–planes in 2r+2\mathbb{P}^{2r+2} on the intersection of two quadrics for r1r\geq 1 and determined the Galois group to be the Coxeter group 𝒢(r,2r+2,(2,2))=D2r+3\mathcal{G}_{(r,2r+2,(2,2))}=D_{2r+3}. It was then shown that the Fano problems of lines in 3\mathbb{P}^{3} on a cubic surface, (1,3,(3))(1,3,(3)), and rr–planes in 2r+2\mathbb{P}^{2r+2} on the intersection of two quadric hypersurfaces, (r,2r+2,(2,2))(r,2r+2,(2,2)) for r1r\geq 1 are special in the sense that these are the only Fano problems where the rr–planes of a general Fano scheme intersect. Further, Hashimoto and Kadets were able to prove claims about those Fano problems (r,n,d)(r,n,d_{\bullet}) not equal to (1,3,(3))(1,3,(3)) or (r,2r+2,(2,2))(r,2r+2,(2,2)) for r1r\geq 1. These Galois groups were shown to be highly transitive, and classical results from group theory were used to prove the following.

Theorem 5 (Hashimoto, Kadets).

If (r,n,d)(r,n,d_{\bullet}) is a Fano problem not equal to (1,3,(3))(1,3,(3)) or (r,2r+2,(2,2))(r,2r+2,(2,2)) for some r1r\geq 1, then 𝒢(r,n,d)\mathcal{G}_{(r,n,d_{\bullet})} contains the alternating group.

Such a Galois group with this property are said to be at least alternating. The result above states that the only Galois groups of Fano problems which are not at least alternating occur in the special cases of lines in 3\mathbb{P}^{3} on a cubic surface and rr–planes in 2r+r\mathbb{P}^{2r+r} on the intersection of two quadrics. A complete classification of Galois groups of Fano problems rests on determining whether each at least alternating Galois group of a Fano problem is the alternating group or the symmetric group. The rest of this paper is devoted to proving that many of these at least alternating Galois groups of Fano problems are in fact fully symmetric. We use computational methods to extend Harris’ technique of producing a simple transposition in the Galois group, proving they are fully symmetric.

4. Computational Methods

Harris showed the Galois group 𝒢(1,n,(2n3))\mathcal{G}_{(1,n,(2n-3))} contains a simple transposition by producing an instance F(1,n,(2n3))F\in\mathbb{C}^{(1,n,(2n-3))} with the property that the fiber π(1,n,(2n3))1(F)=𝒱r(F)\pi_{(1,n,(2n-3))}^{-1}(F)=\mathcal{V}_{r}(F) consists of a unique double point and deg(1,n,(2n3))2\deg(1,n,(2n-3))-2 smooth points. Since Γ\Gamma and (1,n,(2n3))\mathbb{C}^{(1,n,(2n-3))} are smooth, irreducible varieties, the local monodromy around such a point generates a simple transposition as described by Harris [6].

We describe symbolic and numerical methods of verifying these conditions for a given F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} for more general Fano problems (r,n,d)(r,n,d_{\bullet}). The tools we use to verify these conditions are applicable to polynomial systems. We briefly detail our choice of local coordinates on the Grassmanian and how we describe a general Fano scheme as the zeros of a polynomial system in these coordinates.

We use local coordinates determined by the classical Plücker embedding of the Grassmanian, constructed as follows. An rr–plane in n\mathbb{P}^{n} is the projectivization of an (r+1)(r+1)–plane in n+1\mathbb{C}^{n+1} and can be represented as the column span of a full rank (n+1)×(r+1)(n+1)\times(r+1) matrix. The Grassmanian 𝔾(r,n)\mathbb{G}(r,\mathbb{P}^{n}) is then the quotient of the space of full rank (n+1)×(r+1)(n+1)\times(r+1) matrices by the right action of invertible (r+1)×(r+1)(r+1)\times(r+1) matrices. This right action uniformly scales the maximal minors of a given (n+1)×(r+1)(n+1)\times(r+1) matrix and the map sending an rr–plane to the vector of maximal minors of a matrix representing it defines the projective embedding. Now consider the Zariski open subset U𝔾(r,n)U\subseteq\mathbb{G}(r,\mathbb{P}^{n}) of rr–planes represented by a matrix whose bottom (r+1)×(r+1)(r+1)\times(r+1) minor is nonzero. Those rr–planes in UU can be uniquely represented by a matrix whose bottom (r+1)×(r+1)(r+1)\times(r+1) submatrix is the identity matrix, and the entries of the top (nr)×(r+1)(n-r)\times(r+1) submatrix give local coordinates for UU.

Fix a Fano problem (r,n,d)(r,n,d_{\bullet}) and F=(f1,,fs)(r,n,d)F=(f_{1},\dotsc,f_{s})\in\mathbb{C}^{(r,n,d_{\bullet})}. An rr–plane U\ell\in U is parameterized as the column span of the matrix representing it. Substituting this parameterization into fif_{i}, the restriction fi|f_{i}|_{\ell} is a degree did_{i} form in r+1r+1 parameters whose vanishing amounts to the vanishing of its (di+rr)\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right) coefficients. These coefficients are polynomials in the local coordinates for UU, totaling a system of i=1s(di+rr)=(nr)(r+1)\sum_{i=1}^{s}\left(\begin{smallmatrix}d_{i}+r\\ r\end{smallmatrix}\right)=(n-r)(r+1) polynomials in (nr)(r+1)(n-r)(r+1) variables. That is, The rr–planes U𝒱r(F)\ell\in U\cap\mathcal{V}_{r}(F) are described by the zero set of a square polynomial system. For general FF, 𝒱r(F)U\mathcal{V}_{r}(F)\subseteq U and the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) is completely described by this system.

For various Fano problems (r,n,d)(r,n,d_{\bullet}), we will construct F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} with the property that the resulting system of polynomials describing the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) has an obvious candidate for a double point. We describe a purely symbolic computation to verify that this candidate is in fact a double point, and detail the use of numerical certification to show there are deg(r,n,d)2\deg(r,n,d_{\bullet})-2 smooth zeros.

Simple Double Roots

Let GG be a square polynomial system and denote its Jacobian and Hessian by DGDG and D2GD^{2}G respectively. A point xmx\in\mathbb{C}^{m} is a simple double zero of GG if G(x)=0G(x)=0, kerDG(x)\ker DG(x) is spanned by a single non-zero vector vmv\in\mathbb{C}^{m}, and

D2G(x)(v,v)ImDG(x).\displaystyle D^{2}G(x)(v,v)\not\in\text{Im}\,DG(x).

Dedieu and Shub studied simple double zeros of square polynomial systems in efforts to extend previous work of Smale. In their work, they show that simple double zeros have multiplicity two and they compute a positive separation bound for simple double zeros of a system from other zeros of the same system, showing that simple double zeros are isolated zeros of multiplicity two [5]. When the system GG, point xx, and tangent vector vv have complex rational coefficients and coordinates, these conditions can be checked with a symbolic computation.

Interval Arithmetic

One flavor of numerical certification comes from interval arithmetic. A complex interval is the set of tuples of complex numbers such that each the real and imaginary parts of each coordinate lies in an interval. The setwise sum and difference of two complex intervals is again a complex interval, however the setwise product of two complex intervals need not be. Usual arithmetic operations are defined on the space of complex intervals as to contain their setwise counterpart. This allows for the evaluation of polynomials and other functions at complex intervals, the result of which contains the setwise evaluation of the function. More information on complex intervals and their arithmetic can be found in [13].

The Krawczyk operator of GG given a point xx and an invertible m×mm\times m matrix YY, KG,x,YK_{G,x,Y}, is a generalization of the Newton operator that acts on the space of complex intervals. A result due to Rump allows us isolate zeros to GG using the Krawczyk operator [15]. Older versions of this theorem exist for real intervals, and more refined theorems exist for complex intervals [14, 2].

Theorem 6 (Rump).

Let GG be a square polynomial system in mm variables, xmx\in\mathbb{C}^{m} a point, and YY an invertible m×mm\times m matrix. If II is a complex interval such that

KG,x,Y(I)I,\displaystyle K_{G,x,Y}(I)\subseteq I,

then II contains a zero of GG.

These theorems from interval arithmetic allow one to compute bounding sets on zeros of a system GG. As we will soon see, in our setting isolating these zeros will be sufficient for proving they are smooth.

A benefit of using interval arithmetic over other methods of numerical certification is that the conditions can be verified with floating-point arithmetic through the use of proper rounding etiquitte. This computational ease drastically decreases the time required to compute and certify bounding sets for zeros of a system as described in [2]. Numerical certification using inverval arithmetic has been implemented in the julia package HomotopyContinuation.jl [3], which we make great use of. Given a system GG, this software will both compute approximate zeros of GG and attempt to provide an interval satisfying the condition above for each approximate solution.

5. Results

Theorem 7.

Those Fano problems at least alternating Galois group and degree less than 75,000 have fully symmetric Galois group. More precisely, those Fano problems not equal to (1,3,(3))(1,3,(3)) or (r,2r+2,(2,2))(r,2r+2,(2,2)) for r1r\geq 1 and with degree less than 75,000 have Galois group equal to the symmetric group.

Proof.

Let (r,n,d)(r,n,d_{\bullet}) be a Fano problem not equal to (1,3,(3))(1,3,(3)) or (r,2r+2,(2,2))(r,2r+2,(2,2)) for r1r\geq 1 (and having degree less than 75,000). As a means of finding F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} whose Fano scheme has a double point and deg(r,n,d)2\deg(r,n,d_{\bullet})-2 smooth points, prescribe a subscheme of 𝒱r(F)\mathcal{V}_{r}(F). Choose 𝔾(r,n)\ell\in\mathbb{G}(r,\mathbb{P}^{n}) and a tangent vector vT𝔾(r,n)v\in T_{\ell}\mathbb{G}(r,\mathbb{P}^{n}) to lie in the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F). Both of these conditions are linear constraints in (r,n,d)\mathbb{C}^{(r,n,d_{\bullet})}, so FF may be chosen to have complex rational coefficients if \ell and vv are chosen to have complex rational local coefficients. We choose FF to be general satisfying these conditions while also having complex rational coefficients. We wish to show this FF has a Fano scheme consisting of a double point and deg(r,n,d)2\deg(r,n,d_{\bullet})-2 smooth points.

Write the square polynomial system describing the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) in local coordinates by GG. As the coefficients of GG depend linearly on the coefficients of FF, the coefficients of GG are complex rational as well and we may apply the techniques described above to verify whether FF satisfies the desired properties.

The rr–plane 𝒱r(F)\ell\in\mathcal{V}_{r}(F) in local coordinates, written xx_{\ell}, is a zero of the system GG. As the point \ell has some tangency in the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F), it is our candidate to be the double point of 𝒱r(F)\mathcal{V}_{r}(F). As GG, \ell, and vv have all been chosen to have complex rational coefficients and coordinates, it is symbolically checked that xx_{\ell} is in fact a simple double zero of GG and hence, \ell is a double point of 𝒱r(F)\mathcal{V}_{r}(F).

Approximate solutions for the remaining zeros to GG are readily computed by softwares such as NAG4M2 [12], Bertini [1], and HomotopyContinuation.jl [3] and numerical certification techniques are used to isolate the remaining deg(r,n,d)2\deg(r,n,d_{\bullet})-2 zeros of GG with disjoint sets, each of which does not contain xx_{\ell}. As there are at most deg(r,n,d)\deg(r,n,d_{\bullet}) many isolated solutions to GG counting multiplicity, isolating these deg(r,n,d)2\deg(r,n,d_{\bullet})-2 solutions (and xx_{\ell}) also verifies that these isolated zeros are smooth.

This shows F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})} is such that the Fano scheme 𝒱r(F)\mathcal{V}_{r}(F) consists of a double point and deg(r,n,d)2\deg(r,n,d_{\bullet})-2 smooth points, and the local monodromy around FF generates a simple transposition. As the Galois group 𝒢(r,n,d)\mathcal{G}_{(r,n,d_{\bullet})} is either the alternating group or the symmetric group, it follows 𝒢(r,n,d)\mathcal{G}_{(r,n,d_{\bullet})} is the symmetric group. ∎

This amounts to proving 12 at least alternating Galois groups of Fano problems are in fact fully symmetric, which were previously unknwon. Table 2 lists the 12 problems whose Galois group was shown to be the symmetric group as well as timings indicating the time (in seconds (s)) needed to perform the numerical certification using the software HomotopyContinuation.jl. For each of these problems, the computed data of F(r,n,d)F\in\mathbb{C}^{(r,n,d_{\bullet})}, the double point 𝔾(r,n)\ell\in\mathbb{G}(r,\mathbb{P}^{n}), the tangent vector vT𝒱r(F)v\in T_{\ell}\mathcal{V}_{r}(F), and sets isolating for each of the smooth points is available at [17]. This further includes code to verify the data satisfies the desired properties and code to generate data for larger Fano problems as well. This result suggests that all at least alternating Galois groups of Fano problems are fully symmetric, though this problem is still open.

Table 2. Large Fano Problems
r~{}r~{} n~{}n~{} d~{}d_{\bullet}~{} deg(r,n,d)~{}\deg(r,n,d_{\bullet})~{} HomotopyCon (s)
1 7 (2,2,2,2)(2,2,2,2) 512 .61
1 6 (2,2,3)(2,2,3) 720 .87
2 8 (2,2,2)(2,2,2) 1024 1.57
1 5 (3,3) 1053 .32
1 5 (2,4) 1280 .73
1 10 (2,2,2,2,2,2) 20480 15.44
1 9 (2,2,2,2,3) 27648 25.97
2 10 (2,2,2,2) 32768 36.67
1 8 (2,2,3,3) 37584 38.23
1 8 (2,2,2,4) 47104 111.88
1 7 (3,3,3) 51759 42.86
1 7 (2,3,4) 64512 125.63

References

  • [1] D. Bates, J. Hauenstein, A. Sommese, and C. Wampler. Bertini: Software for numerical algebraic geometry.
  • [2] P. Breiding, K. Rose, and S. Timme. Certifying zeros of polynomial systems using interval arithmetic. 2020. arXiv:2011.05000.
  • [3] P. Breiding and S. Timme. HomotopyContinuation.jl: A Package for Homotopy Continuation in Julia. In International Congress on Mathematical Software, pages 458–465. Springer, 2018.
  • [4] O. Debarre and L. Manivel. Sur la variété des espaces linéaires contenus dans une intersection complète. Mathematische Annalen, 312:549–574, 1998.
  • [5] J.-P. Dedieu and M. Shub. On simple double zeros and badly conditioned zeros of analytic functions of nn variables. Math. Comp., 70(233):319–327, 2001.
  • [6] J. Harris. Galois groups of enumerative problems. Duke Math. Journal, 46(4):685–724, 1979.
  • [7] S. Hashimoto and B. Kadets. 38406501359372282063949 and all that: Monodromy of Fano problems. International Mathematics Research Notices, 2020. rnaa275, arxiv:2002.04580.
  • [8] A. Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002.
  • [9] J. Hauenstein, J. Rodriguez, and F. Sottile. Numerical Computation of Galois Groups. Found. Comput. Math., 18(4):867–890, 2018.
  • [10] C. Hermite. Sur les fonctions algébriques. CR Acad. Sci.(Paris), 32:458–461, 1851.
  • [11] C. Jordan. Traité des Substitutions et des Équations algébriques. Gauthier-Villars, Paris, 1870.
  • [12] A. Leykin. Numerical Algebraic Geometry. The Journal of Software for Algebra and Geometry, 3:5–10, 2011. Available at http://j-sag.org/volume3.html.
  • [13] G. Mayer. Interval analysis—and automatic result verification, volume 65 of De Gruyter Studies in Mathematics. De Gruyter, Berlin, 2017.
  • [14] R. E. Moore. A test for existence of solutions to nonlinear systems. SIAM J. Numer. Anal., 14(4):611–615, 1977.
  • [15] S. M. Rump. Solving algebraic problems with high accuracy. In Parallel and large-scale computers: performance, architecture, applications (Montreal, Que., 1982), IMACS Trans. Sci. Comput., II, pages 299–300. IMACS, New Brunswick, NJ, 1983.
  • [16] F. Sottile and T. Yahl. Galois groups in enumerative geometry and applications, 2021. arXiv:2108.07905.
  • [17] T. Yahl. Data and tools for computing galois groups of fano problems, 2022. https://github.com/tjyahl/FanoGaloisGroups.