Computing Galois Groups of Fano Problems
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 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 on a smooth cubic surface is one of the first examples of a Fano problem: enumerating –planes in lying on a variety . The Grassmanian is a complex projective varieties that parameterizes the set of all –planes in , and the family of –planes that lie on is a subscheme of the Grassmanian called the Fano scheme of . We consider 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 is finite, we call the problem of describing its Fano scheme a Fano problem. This setting covers familiar problems such as lines in on a cubic surface and lines in on the intersection of two quadric hypersurfaces.
To each Fano problem there is an associated Galois group which acts on the Fano scheme of . 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 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 , and it has since been shown that this Galois group is equal to 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 on a hypersurface of degree . After showing Jordan’s inclusion to be an equality (the case ), he showed that for 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 –planes in on the intersection of two quadrics has Galois group equal to the Coxeter group for . 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 –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.

2. Fano Problems
The family of –planes in is a complex irreducible projective variety known as the Grassmanian and is of dimension . For a variety its Fano scheme is the subscheme of of –planes that lie on . We study Fano schemes uniformly in the setting that is a general complete intersection.
When is a codimension subvariety, is the zero locus of homogeneous polynomials in variables. Write for the sequence of respective degrees of these polynomials, . We make the assumption that for , since otherwise some is linear from which we may consider . Since a general complete intersection is smooth, it contains no –planes of dimension —so we require that from this point.
Let denote the space of systems of complex homogeneous polynomials in variables and of respective degrees . The zero set of a general system defines a smooth complete intersection in , whose Fano scheme of –planes we consider. For a system , write for the Fano scheme of –planes on its zero set in . We say a Fano scheme is general if it is the Fano scheme of a general system . Invariants such as dimension and degree of general Fano schemes are determined by the combinatorial data , called the type of the Fano scheme.
We determine the expected dimension of a Fano scheme of a given type . Fix . We note that exactly when , or equivalently for . Each restriction is a degree form on , and the space of such forms has dimension . As such, we expect the vanishing of these forms to have codimension and the dimension of to be
There is an alternative view of this description of the Fano scheme . Each determines a section of a certain vector bundle (this is a direct sum of symmetric powers of the dual of the tautological bundle on ) and the Fano scheme is the vanishing locus of this section. This vector bundle has rank 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 is non-empty, smooth, and has dimension when and is empty otherwise.
We say the Fano problem is the problem of describing a general Fano scheme of type , where . 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 , there is a generic degree given as the maximal degree of a Fano scheme of this type. For a Fano problem , this degree is written and is the cardinality of a general Fano scheme of type . By describing the Fano scheme 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
and , as well as the Vandermonde polynomial
Theorem 2 (Debarre,Manivel).
The degree of the Fano problem , , is equal to the coefficient of in the product .
When a Fano scheme of a Fano problem is finite (as is expected), there are 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 on the intersection of two quadric hypersurfaces and the problem of 27 lines in on a cubic hypersurface.
Galois Group | ||||
---|---|---|---|---|
1 | 4 | 16 | ||
1 | 3 | 27 | ||
2 | 6 | 64 | ||
3 | 8 | 256 | ||
1 | 7 | 512 | ||
1 | 6 | 720 | ||
4 | 10 | 1024 | ||
2 | 8 | 1024 |
Lower bounds exist for , 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 be a Fano problem. We have
Proof.
For the first inequality, consider the product expansion of for fixed . For each such that , there are many terms of the product with of the equal to . The quantity then factors out of each of these many terms and appears as a constant factor of with this respective power. Hence this is a factor of every term of and of . ∎
3. Galois Groups of Fano Problems
A Fano problem determines an incidence correspondence.
The map realizes the incidence variety as a vector bundle over . Indeed, the fiber over is the kernel of the surjective linear map restricting homogeneous forms of respective degrees to homogeneous forms on of the same respective degrees. The codimension of these fibers in is then equal to ; it follows that is smooth and of dimension .
Given , the fiber is the Fano scheme . By the results of Debarre and Manivel, there is a Zariski open set (in particular dense, open, and path-connected) with the property that if , the fiber consists of smooth points. It follows that the restriction of to is a smooth covering space of degree .
Fix a base point . Every directed loop in based at lifts to paths in each starting at distinct poitns of the fiber ; the endpoints of these paths determine a permutation of this fiber. The set of all permutations obtained this way is the monodromy group of and is defined up to isomorphism for different choices of base point and reordering of the fiber . The monodromy group of acts transitively on the fiber since the incidence variety 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 of the Fano problem is the monodromy group of the restriction of to a covering space.
These Galois groups were first defined algebraically by Jordan [11]. The map induces a reverse inclusion of the function fields of these varieties . This expresses as an algebraic extension of of degree . The Galois group of the Fano problem 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 on a cubic surface and its Galois group, . 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 . Harris later proved Jordan’s inclusion to be an equality, , and studied a generalization of this problem. He showed that for , the Fano problem of lines in on a hypersurface of degree has Galois group equal to the symmetric group [6], such a Galois group is called fully symmetric. To prove his result, Harris observed for the Galois groups are highly transitive and observed systems 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 –planes in on the intersection of two quadrics for and determined the Galois group to be the Coxeter group . It was then shown that the Fano problems of lines in on a cubic surface, , and –planes in on the intersection of two quadric hypersurfaces, for are special in the sense that these are the only Fano problems where the –planes of a general Fano scheme intersect. Further, Hashimoto and Kadets were able to prove claims about those Fano problems not equal to or for . 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 is a Fano problem not equal to or for some , then 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 on a cubic surface and –planes in 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 contains a simple transposition by producing an instance with the property that the fiber consists of a unique double point and smooth points. Since and 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 for more general Fano problems . 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 –plane in is the projectivization of an –plane in and can be represented as the column span of a full rank matrix. The Grassmanian is then the quotient of the space of full rank matrices by the right action of invertible matrices. This right action uniformly scales the maximal minors of a given matrix and the map sending an –plane to the vector of maximal minors of a matrix representing it defines the projective embedding. Now consider the Zariski open subset of –planes represented by a matrix whose bottom minor is nonzero. Those –planes in can be uniquely represented by a matrix whose bottom submatrix is the identity matrix, and the entries of the top submatrix give local coordinates for .
Fix a Fano problem and . An –plane is parameterized as the column span of the matrix representing it. Substituting this parameterization into , the restriction is a degree form in parameters whose vanishing amounts to the vanishing of its coefficients. These coefficients are polynomials in the local coordinates for , totaling a system of polynomials in variables. That is, The –planes are described by the zero set of a square polynomial system. For general , and the Fano scheme is completely described by this system.
For various Fano problems , we will construct with the property that the resulting system of polynomials describing the Fano scheme 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 smooth zeros.
Simple Double Roots
Let be a square polynomial system and denote its Jacobian and Hessian by and respectively. A point is a simple double zero of if , is spanned by a single non-zero vector , and
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 , point , and tangent vector 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 given a point and an invertible matrix , , 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 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 be a square polynomial system in variables, a point, and an invertible matrix. If is a complex interval such that
then contains a zero of .
These theorems from interval arithmetic allow one to compute bounding sets on zeros of a system . 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 , this software will both compute approximate zeros of 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 or for and with degree less than 75,000 have Galois group equal to the symmetric group.
Proof.
Let be a Fano problem not equal to or for (and having degree less than 75,000). As a means of finding whose Fano scheme has a double point and smooth points, prescribe a subscheme of . Choose and a tangent vector to lie in the Fano scheme . Both of these conditions are linear constraints in , so may be chosen to have complex rational coefficients if and are chosen to have complex rational local coefficients. We choose to be general satisfying these conditions while also having complex rational coefficients. We wish to show this has a Fano scheme consisting of a double point and smooth points.
Write the square polynomial system describing the Fano scheme in local coordinates by . As the coefficients of depend linearly on the coefficients of , the coefficients of are complex rational as well and we may apply the techniques described above to verify whether satisfies the desired properties.
The –plane in local coordinates, written , is a zero of the system . As the point has some tangency in the Fano scheme , it is our candidate to be the double point of . As , , and have all been chosen to have complex rational coefficients and coordinates, it is symbolically checked that is in fact a simple double zero of and hence, is a double point of .
Approximate solutions for the remaining zeros to 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 zeros of with disjoint sets, each of which does not contain . As there are at most many isolated solutions to counting multiplicity, isolating these solutions (and ) also verifies that these isolated zeros are smooth.
This shows is such that the Fano scheme consists of a double point and smooth points, and the local monodromy around generates a simple transposition. As the Galois group is either the alternating group or the symmetric group, it follows 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 , the double point , the tangent vector , 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.
HomotopyCon (s) | ||||
---|---|---|---|---|
1 | 7 | 512 | .61 | |
1 | 6 | 720 | .87 | |
2 | 8 | 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 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.