Genuine and strongly genuine polynomials: With an application to the persistence of Galois groups under specialization

Abstract: We develop the theory of strongly $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}&#39;)$ with $\mathbf{x}&#39;=(x_2,\ldots,x_n) \in \mathbb{Z}<sup>{n-1}$ (respectively $\mathbf{x}&#39; \in \mathbb{F}_p<sup>{n-1}$) such that $F(Y,X_1,\mathbf{x}&#39;)$ is reducible over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) can be well-controlled quantitatively. We also develop the theory of a larger class of $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}&#39;)$ with $\mathbf{x}&#39; \in \mathbb{Z}<sup>{n-1}$ (respectively $\mathbf{x}&#39; \in \mathbb{F}_p<sup>{n-1}$) such that $F(Y,X_1,\mathbf{x}&#39;)$ splits completely over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) into factors that are linear in $Y$ can be well-controlled quantitatively. For each of these classes, we prove that there are four equivalent characterizations. As an application, we demonstrate that $n$-genuine and strongly $n$-genuine polynomials can be used to prove, for any polynomial $F(Y,X_1,\ldots,X_n)$, an upper bound for the number of specializations $F(Y,\mathbf{x})$ with $\mathbf{x}=(x_1,\ldots,x_n) \in \mathbb{Z}<sup>n$ such that the Galois group of the splitting field of $F(Y,\mathbf{x})$ over $\mathbb{Q}$ is not isomorphic to the Galois group of the splitting field of $F(Y,X_1,\ldots,X_n)$ over $\mathbb{Q}(X_1,\ldots,X_n)$. We simultaneously prove analogous results over any number field.

• The paper introduces n-genuine and strongly n-genuine polynomials to precisely control reducibility and the persistence of Galois groups.
• It establishes quantitative upper bounds on exceptional specializations, refining classical thin set estimates with explicit invariants.
• The innovative framework resolves gaps in earlier proofs and lays the groundwork for advances in arithmetic geometry and computational Galois theory.

Genuine and Strongly Genuine Polynomials and the Persistence of Galois Groups Under Specialization

Introduction and Motivation

The paper "Genuine and strongly genuine polynomials: With an application to the persistence of Galois groups under specialization" (2607.01969) develops a robust theoretical framework for analyzing classes of multivariate polynomials—termed $n$-genuine and strongly $n$-genuine polynomials—which provide quantitative control over the behavior of specializations, particularly with respect to reducibility and the persistence of Galois groups. The persistence problem, central in arithmetic geometry and field theory, concerns whether the Galois group of a specialized polynomial $F(Y, x)$ (for $x$ taking values in a number field $K^n$) coincides with that of the generic polynomial $F(Y, X)$ over the function field $K(X)$. Classic work by Serre, Cohen, and others showed that the exceptional set (where the Galois group changes) is thin and small in a qualitative sense. This work addresses the quantitative dimension, resolving subtleties in prior proofs, and introduces new algebraic structures facilitating precise bounds.

Definitions and Structural Characterization

$n$-Genuine and Strongly $n$-Genuine Polynomials

Given $F(Y, X_1, \ldots, X_n) \in K[Y, X_1, \ldots, X_n]$, the field extension $n$0 is called $n$1-genuine if, for any minimal polynomial representative $n$2 of the extension, every $n$3 appears with nonzero degree; i.e., the extension is fully entwined with all variables. It is strongly $n$4-genuine if every proper intermediate extension is also $n$5-genuine. These notions generalize regularity and irreducibility to a higher-dimensional, multivariate context.

The authors provide four equivalent characterizations for both $n$6-genuine and strongly $n$7-genuine polynomials. These include:

• Field-theoretic conditions on the intersection of splitting fields with algebraic closures,
• Factorization behavior under specialization,
• Non-vanishing of certain explicit invariants (Noether forms) that algebraically encode reducibility/splitting criteria,
• Regularity conditions for chain extensions.

These equivalences facilitate the passage between arithmetic, algebraic, and geometric viewpoints and are instrumental in the subsequent analytic bounds.

Quantitative Results and Key Theorems

Bounds for Specializations

The main technical results control the count of exceptional specializations—those for which reducibility occurs or for which the Galois group changes—by exhibiting strong upper bounds:

For a strongly $n$8-genuine polynomial $n$9 of total degree $F(Y, x)$0 over the ring of integers $F(Y, x)$1 of a number field $F(Y, x)$2:

• The number of tuples $F(Y, x)$3 with norm $F(Y, x)$4 such that $F(Y, x)$5 is reducible over $F(Y, x)$6 satisfies

$F(Y, x)$7

and a similar estimate holds for reductions modulo almost all primes $F(Y, x)$8:

$F(Y, x)$9

Analogously for $x$0-genuine polynomials (not necessarily strongly $x$1-genuine), one obtains the same bound when counting those $x$2 for which $x$3 splits completely into linear factors.

Persistence of Galois Groups Under Specialization

An essential application is to the quantitative persistence of Galois groups:

Let $x$4 be of total degree at most $x$5, $x$6 its Galois group over $x$7. For $x$8, let $x$9 denote the Galois group of the splitting field of $K^n$0 over $K^n$1. Then there exist constants $K^n$2 (depending only on $K^n$3) such that

$K^n$4

where $K^n$5 denotes the maximal absolute norm of the coefficients of $K^n$6.

This result both clarifies and quantitatively sharpens longstanding statements attributed to Cohen and Serre. The main theorems are established over arbitrary number fields and elucidate precise dependence on the data of $K^n$7, including explicit control of exceptional sets of primes.

Methodology and Technical Innovations

The core technical method combines:

• Advanced polynomial invariants (Noether forms) for reducibility/splitting, controlling the probability that a specialization $K^n$8 manifests exceptional behavior.
• Quantitative analysis of thin sets using the structure of Hilbertian fields, stratifying the exceptional locus via the geometry of varieties with morphisms of degree $K^n$9 and relating counting to the dimension and degree of the defining equations.
• A systematic procedure for shifting (linear change of variables) to force strong genuineness properties when they are only generically present, guaranteeing the main bounds via specialization to a suitable coordinate system.
• Reduction to sieve-theoretic techniques (large sieve) for upper bounds on the number of exceptional specializations, relying on refined Chebotarev density results for function fields and regularity assertions propagated through the genuine property.

The work further closes a subtle but significant gap in Cohen’s classical proof for $F(Y, X)$0 variables, demonstrating that the prior claimed step fails without the introduction of the genuine polynomial framework, and proves the necessity of the additional arithmetic hypotheses.

Implications and Potential for Future Directions

The introduction of the $F(Y, X)$1-genuine and strongly $F(Y, X)$2-genuine condition separates the problem of persistence of Galois groups into algebraically meaningful classes, resolving ambiguities in prior treatments and generating a toolkit for further arithmetic investigations. The bounds on the number of exceptions—especially the $F(Y, X)$3 scaling—are optimal up to logarithmic factors in general, by comparison with classical thin set constructions.

Significantly, being $F(Y, X)$4-genuine is a generic property in the natural parameter spaces of polynomials, so the results apply very broadly.

This framework suggests multiple future research directions:

• Extension to other moduli spaces and polynomial invariants, exploring further thinness and uniformity phenomena.
• Application to the quantitative Hilbert Irreducibility Theorem in more general settings (arbitrary global fields, larger classes of coefficient rings).
• Sieve-theoretic and arithmetic-statistical analysis of resolvent polynomials and Galois images, leveraging the control provided by genuine/strongly genuine classes.
• Investigation of uniformity questions regarding the implied constants, as counterexamples show uniformity in the degree and number of variables without coefficient-size dependence fails.

From an algorithmic and computational perspective, the explicit non-vanishing criteria and structural characterizations open the possibility for effective computation of Galois groups, counting exceptional specializations, and constructing specialized thin families with controlled exceptional behavior.

Conclusion

This paper provides a technically rigorous and algebraically deep study of $F(Y, X)$5-genuine and strongly $F(Y, X)$6-genuine polynomials, establishing strong quantitative results concerning the reducibility and Galois-theoretic behavior of specializations in multivariate polynomial families (2607.01969). The implications for both theoretical and computational aspects of algebraic geometry and number theory are substantial, creating a clarified framework for persistence phenomena and thin set estimates in the arithmetic of function fields.