betaFeedback

WorksMathematics

Root separation for polynomials over Fq[T]\mathbb{F}_q[T]

Abstract

We study the minimum distance between distinct roots of a separable polynomial of degree d≥2d\ge2 over Fq[T]\mathbb{F}_q[T], with respect to the absolute value ∣T∣=q|T|=q. For reducible polynomials of height HH, the exponent d−1d-1 in the lower bound H−(d−1)H^{-(d-1)} is best possible in every degree. In characteristic two we construct absolutely irreducible polynomials that attain this bound at every height qNq^N, N≥1N\ge1. In odd characteristic pp, the exponent d−1d-1 is best possible for absolutely irreducible polynomials whenever d−1=pamd-1=p^a m with p∤mp\nmid m and m∣pa−1m\mid p^a-1. The separation exponents for irreducible and absolutely irreducible polynomials coincide for every qq and dd.

Use of artificial intelligence. The research was carried out under human direction from the choice of topic and research questions to the selection of results for the paper. OpenAI’s ChatGPT 6.2 Astra developed the constructions and proofs and drafted the manuscript. Anthropic’s Claude Fable 5.2 reviewed the manuscript, checked examples, and suggested improvements to the proofs and to the comparison with known results. The human review did not include an independent check of every proof.

Introduction

How close can two distinct roots of an integer polynomial of given degree and height be? For a separable integer polynomial of degree dd and height HH, Mahler [9] gave a lower bound of order H−(d−1)H^{-(d-1)} for the distance between any two distinct roots. In the other direction, Bugeaud and Dujella [3 Theorem 1] constructed, for each d≥4d \ge4, reducible integer polynomials of arbitrarily large height HH with two roots at distance ≪dH−(2d−1)/3\ll_d H^{-(2d-1)/3}. We refer to Bugeaud and Mignotte [5] for a survey.

Here we consider polynomials with coefficients in k[T]k[T], where k=Fqk=\mathbb{F}_q is the finite field with qq elements. Write pp for the characteristic of kk and put K=k(T)K=k(T). For nonzero a,b∈k[T]a,b \in k[T] set ∣a/b∣=qdeg⁡a−deg⁡b|a/b|=q^{\deg a-\deg b}. The completion of KK for this absolute value is the field of Laurent series K∞=k((T−1))K_\infty=k((T^{-1})). We extend this absolute value to an algebraic closure of K∞K_\infty and write v=−log⁡q∣⋅∣v=-\log_q|\cdot|.

Throughout the paper, F=∑i=0daiXi∈k[T][X]F=\sum_{i=0}^{d}a_iX^i \in k[T][X] is a primitive separable polynomial of degree d≥2d \ge2 in XX, with roots x1,…,xdx_1,\ldots,x_d. Thus the coefficients aia_i have no common factor of positive degree. We define its height H(F)H(F) and its separation sep⁡(F)\operatorname{sep}(F) by

h(F)=max⁡ideg⁡Tai,H(F)=qh(F),h(F)=\max_i\deg_T a_i,\qquad H(F)=q^{h(F)},
sep⁡(F)=min⁡i<j∣xi−xj∣,s(F)=−log⁡qsep⁡(F).\operatorname{sep}(F)=\min_{i<j}|x_i-x_j|,\qquad s(F)=-\log_q\operatorname{sep}(F).

Here h(F)h(F) is the logarithmic height of FF, and deg⁡0=−∞\deg0=-\infty. For u=a/bu=a/b with coprime polynomials a,b∈k[T]a,b\in k[T] and b≠0b\ne0, put h(u)=max⁡(deg⁡a,deg⁡b)h(u)=\max(\deg a,\deg b) and H(u)=qh(u)H(u)=q^{h(u)}.

For fixed qq and dd, we define the separation exponent by

Eq(d)=lim sup⁡h(F)→∞s(F)h(F).E_q(d)=\limsup_{h(F)\to\infty}\frac{s(F)}{h(F)}.

2020 Mathematics Subject Classification. Primary 11C08; Secondary 11J61, 11T55.

Key words and phrases. Root separation, polynomial height, function fields of positive characteristic, Diophantine approximation.

Tomislav Pejković proposed the topic and guided the research presented in this paper. Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia ([email protected]).

We write Eq,red(d)E_{q,\mathrm{red}}(d), Eq,irr(d)E_{q,\mathrm{irr}}(d) and Eq,abs(d)E_{q,\mathrm{abs}}(d) when FF ranges over the reducible, irreducible and absolutely irreducible polynomials, respectively. The first two classes are defined over KK. We say that FF is absolutely irreducible if it remains irreducible over kˉ(T)\bar{k}(T), where kˉ\bar{k} is an algebraic closure of kk. Since FF is primitive, this is equivalent to irreducibility in kˉ[T,X]\bar{k}[T,X].

The discriminant gives

sep⁡(F)≥H(F)−(d−1).(1)\operatorname{sep}(F) \ge H(F)^{-(d-1)}. \tag*{(1)}

In particular, Eq(d)≤d−1E_q(d) \le d-1. To compare sep⁡(F)\operatorname{sep}(F) with the right-hand side of (1), we write Δ(F)=(d−1)h(F)−s(F)\Delta(F)=(d-1)h(F)-s(F) for the loss in this bound. Thus sep⁡(F)=qΔ(F)H(F)−(d−1)\operatorname{sep}(F)=q^{\Delta(F)}H(F)^{-(d-1)}. Along any sequence with h(F)→∞h(F)\to\infty, the quotient s(F)/h(F)s(F)/h(F) tends to d−1d-1 if and only if Δ(F)=o(h(F))\Delta(F)=o(h(F)).

Theorem 1.1. Let n=d−1≥1n=d-1\ge1. Over every finite field kk there are polynomials FF of arbitrarily large logarithmic height hh with Δ(F)≪dh\Delta(F)\ll_d\sqrt{h}. We may take F=LGF=LG, where LL is linear and GG is absolutely irreducible of degree nn. In particular,

Eq,red(d)=Eq(d)=d−1.E_{q,\mathrm{red}}(d)=E_q(d)=d-1.

Every reducible FF of logarithmic height h≥n−1h\ge n-1 satisfies Δ(F)≥n−1\Delta(F)\ge n-1. Equality holds for infinitely many values of hh if and only if p∤np\nmid n or nn is a power of pp. In all other cases Δ(F)≥2(n−1)\Delta(F)\ge2(n-1) for all sufficiently large hh.

For n≥2n\ge2, the equality Eq,red(n+1)=nE_{q,\mathrm{red}}(n+1)=n also follows from a theorem of Badziahin [1 Theorem 5]. Given 0<ε<10<\varepsilon<1, he proves that the product ∣α−u∣(H(α)H(u))n−ε|\alpha-u|(H(\alpha)H(u))^{n-\varepsilon} can be arbitrarily small for u∈Ku\in K and α∈K∞\alpha\in K_\infty of degree nn over KK. Here H(α)H(\alpha) is the height of the primitive polynomial P∈k[T][X]P\in k[T][X] associated with the minimal polynomial of α\alpha over KK. To see that α\alpha is separable, suppose that PX=0P_X=0. Differentiating P(T,α)=0P(T,\alpha)=0 with respect to TT gives PT(T,α)=0P_T(T,\alpha)=0. Hence PP divides PTP_T in k[T][X]k[T][X] by Gauss’s lemma, and comparison of degrees in TT gives PT=0P_T=0. Since kk is perfect, PP would be a ppth power. This contradicts its irreducibility. Multiplying PP by the primitive linear polynomial with root uu gives a reducible polynomial of height H(α)H(u)H(\alpha)H(u). These heights are unbounded, since there are only finitely many polynomials of bounded degree and height over k[T]k[T]. Letting ε\varepsilon tend to zero gives the required equality.

The proof of Theorem 1.1 gives explicit bounds for Δ(F)\Delta(F). For p∤np\nmid n we use an example of Osgood [11, 2]. For nn a power of pp we use a lacunary power series as in Mahler’s construction [8]. In both cases the factor of degree nn is fixed. In the construction for the remaining degrees both factors vary.

When can Δ\Delta stay bounded as the height tends to infinity? For reducible polynomials of degree n+1n+1, this happens precisely when some finite group of fractional linear transformations of the projective line over kˉ\bar{k} has an orbit of size nn. In those degrees the factor of degree nn can be kept fixed. In every other degree all reducible polynomials of sufficiently large logarithmic height satisfy Δ≫nh\Delta\gg_n\sqrt{h}, and the construction of Theorem 1.1 shows that this order is best possible. Theorem 7.1 gives the list of degrees. For example, when d=29d=29 and p=7p=7, every reducible FF of sufficiently large height satisfies 28h−s(F)≫h28h-s(F)\gg\sqrt{h}, and there are polynomials of arbitrarily large height for which 28h−s(F)≪h28h-s(F)\ll\sqrt{h}.

Theorem 1.2. Let d≥2d\ge2. In characteristic two, for every integer N≥1N\ge1 there is an absolutely irreducible polynomial of degree dd and height qNq^N for which equality holds in (1). For d≥3d\ge3 the polynomial can be chosen monic in XX. In particular, Eq,abs(d)=d−1E_{q,\mathrm{abs}}(d)=d-1.

In odd characteristic write d−1=pamd-1=p^a m with a≥0a\ge0 and p∤mp\nmid m. If m∣pa−1m\mid p^a-1, there are absolutely irreducible polynomials FF of degree dd and arbitrarily large logarithmic height hh satisfying Δ(F)≪dh\Delta(F)\ll_d\sqrt{h}. Hence Eq,abs(d)=d−1E_{q,\mathrm{abs}}(d)=d-1 in this case as well.

References

  1. [1]D. Badziahin, Distance between cubics and rationals, Results Math. 81 (2026), article 58. doi:10.1007/s00025-026-02616-5.
  2. [2]Y. Bugeaud, On simultaneous approximation in fields of power series, Bull. Math. Soc. Sci. Math. Roumanie 65(113) (2022), 191–202.
  3. [3]Y. Bugeaud and A. Dujella, Root separation for reducible integer polynomials, Acta Arith. 162 (2014), 393–403. doi:10.4064/aa162-4-6.DOI
  4. [4]Y. Bugeaud and M. Mignotte, On the distance between roots of integer polynomials, Proc. Edinb. Math. Soc. 47 (2004), 553–556. doi:10.1017/S0013091503000257.DOI
  5. [5]Y. Bugeaud and M. Mignotte, Polynomial root separation, Int. J. Number Theory 6 (2010), 587–602. doi:10.1142/S1793042110003083.DOI
  6. [6]X. Faber, Finite p-groups subgroups of PGL₂(k), La Matematica 2 (2023), 479–522. doi:10.1007/s44007-023-00051-4.
  7. [7]A. Lasjaunias and B. de Mathan, Differential equations and Diophantine approximation in positive characteristic, Monatsh. Math. 128 (1999), 1–6. doi:10.1007/PL00010080.
  8. [8]K. Mahler, On a theorem of Liouville in fields of positive characteristic, Canad. J. Math. 1 (1949), 397–400. doi:10.4153/CJM-1949-035-0.DOI
  9. [9]K. Mahler, An inequality for the discriminant of a polynomial, Michigan Math. J. 11 (1964), 257–262. doi:10.1307/mmj/1028999140.DOI
  10. [10]T. Ooto, Quadratic approximation in F_q((T^{-1})), Osaka J. Math. 54 (2017), 129–156. doi:10.18910/61892.
  11. [11]C. F. Osgood, Effective bounds on the “Diophantine approximation” of algebraic functions over fields of arbitrary characteristic and applications to differential equations, Indag. Math. 37 (1975), 105–119. doi:10.1016/1385-7258(75)90023-2.DOI
  12. [12]H. Stichtenoth, Algebraic Function Fields and Codes, 2nd ed., Graduate Texts in Mathematics, vol. 254, Springer, Berlin, 2009. doi:10.1007/978-3-540-76878-4.DOI
  13. [13]J. F. Voloch, Diophantine approximation in characteristic p, Monatsh. Math. 119 (1995), 321–325. doi:10.1007/BF01293591.

Paper details

vlnc:W_yhwtsffm
Version
v1 · latest
Published
Fresh — published within the last 30 days
License
CC BY 4.0
  • Mathematics

OpenAI ChatGPT, Anthropic Claude Fable

View statement
Looking for related papers…
Contents