OctoInformBeta

Squarefree quartics and power-free polynomial values

For an integer k≥2k \ge 2, an integer aa is kk-power-free if no kk-th power of a prime divides aa. A 22-power-free integer is called squarefree. For a polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and a positive integer qq, let ρf(q)=#{a∈ℤ/qℤ:f(a)≡0(mod⁡q)}\rho_f(q) = \#\{a \in \mathbb{Z}/q\mathbb{Z} : f(a) \equiv 0 \pmod{q}\} count the roots of ff modulo qq. For a real number X>0X > 0, let Sf,k(X)=#{n∈ℤ:1≤n≤X,f(n) is k-power-free}S_{f,k}(X) = \#\{n \in \mathbb{Z} : 1 \le n \le X,\ f(n) \text{ is } k\text{-power-free}\}. A polynomial f∈ℤ[x]f \in \mathbb{Z}[x] is locally admissible for kk if ρf(pk)<pk\rho_f(p^k) < p^k for every prime pp. The associated Euler product is cf,k=∏p(1−ρf(pk)/pk)c_{f,k} = \prod_p \bigl(1 - \rho_f(p^k)/p^k\bigr). The central problem is to determine which degrees d≥2d \ge 2 and exponents k≥2k \ge 2 guarantee the asymptotic Sf,k(X)=cf,kX+of(X)S_{f,k}(X) = c_{f,k}X + o_f(X) with cf,k>0c_{f,k} > 0 for every polynomial f∈ℤ[x]f \in \mathbb{Z}[x] irreducible over ℚ\mathbb{Q} of degree dd that is locally admissible for kk.

Ricci (1933) proved this asymptotic in the range k≥dk \ge d. For d≥3d \ge 3, Erdős (1953) proved infinitude of (d−1)(d - 1)-power-free values. In the same range d≥3d \ge 3, Hooley (1967) obtained the asymptotic for exponent d−1d - 1, covering squarefree values of cubics. In 1953, Erdős singled out the unresolved squarefreeness of n4+2n^4 + 2. Erdős (1965) returned to this example when describing the obstacle at exponent d−2d - 2. Nair (1976) proved the asymptotic for k≥(2−12)dk \ge (\sqrt{2} - \frac{1}{2})d, reaching k=d−2k = d - 2 for d≥24d \ge 24. Heath-Brown (2006) improved the range to k≥(3d+2)/4k \ge (3d + 2)/4, which covers k=d−2k = d - 2 for d≥10d \ge 10. Browning (2011) lowered the threshold to k≥(3d+1)/4k \ge (3d + 1)/4, attaining k=d−2k = d - 2 for d≥9d \ge 9. Xiao (2017) gave a published reproof of this result on 1≤n≤X1 \le n \le X with the Euler product over all residue classes modulo pkp^k. For irreducible binomials xd+c∈ℤ[x]x^d + c \in \mathbb{Z}[x], Heath-Brown (2013) proved a power-saving asymptotic for k≥(5d+3)/9k \ge (5d + 3)/9, which yields k=d−2k = d - 2 for d≥6d \ge 6. Reuss (2015) obtained a power-saving error for general degree-dd polynomials at exponent d−1d - 1. Conditionally on the abcabc conjecture, Granville (1998) proved the predicted squarefree-value density for separable integer polynomials locally admissible for k=2k = 2. Greaves (1992) studied squarefree values of binary forms. Helfgott (2004) treated squarefree values of homogeneous forms in two variables of degree at most six.

The preprint proves that if f∈ℤ[x]f \in \mathbb{Z}[x] is irreducible over ℚ\mathbb{Q} of degree dd with 4≤d≤84 \le d \le 8 and is locally admissible for k=d−2k = d - 2, then Sf,k(X)=cf,kX+of(X)S_{f,k}(X) = c_{f,k}X + o_f(X) with cf,k>0c_{f,k} > 0, requiring neither primitivity nor a sign condition on the leading coefficient. For any integer k≥2k \ge 2 and any nonempty finite family of nonzero polynomials in ℤ[x]\mathbb{Z}[x] separable over ℚ\mathbb{Q} whose nonconstant irreducible factors have degree at most k+2k + 2, the integers 1≤n≤X1 \le n \le X at which every polynomial in the family takes a kk-power-free value have positive Euler-product density, provided that for every prime pp not every residue class a∈ℤ/pkℤa \in \mathbb{Z}/p^k\mathbb{Z} satisfies pk∣F(a)p^k \mid F(a) for some polynomial FF in the family, which the Lean library does not contain.

The results on these pages are those of the Lean library, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library, so the Lean library is the reference. Where the preprint states a result differently, the statement on the page is the Lean library’s, with the preprint’s given beside it. The preprint is a guide only, giving the results their order and their names. The Lean library takes no external theorem as a hypothesis, proving the (d−2)(d - 2)-power-free density statement unconditionally for all locally admissible polynomials f∈ℤ[x]f \in \mathbb{Z}[x] irreducible over ℚ\mathbb{Q} of degree d≥4d \ge 4 rather than assuming Browning’s theorem for d≥9d \ge 9.

The Lean library: PowerFree

PowerFree is a Lean library: 19 items, in eight groups. Each has a page written by OctoInform, listed below.

§1. Setting and main results 4 items
  1. §1 (setting) Local admissibility and density of power-free polynomial values.
  2. Theorem 1.1 Asymptotic density of power-free values for integer polynomials.
  3. Corollary 1.2 Power-free density for locally admissible ℚ\mathbb{Q}-irreducible polynomials.
  4. Proposition 1.4 Explicit dyadic tail bounds for primitive integer polynomials.
§2. Sieve transfer 1 item
  1. 2.1: Sieve transfer Asymptotic density of power-free values from dyadic tail bounds.
§3. Affine counting and integer patches 5 items
  1. §3 (setting) Bounded integer patches and Hilbert invariants for polynomial ideals.
  2. Theorem 3.1 Bounding integer points in weighted boxes on prime ideals.
  3. 3.2: Bounded-coefficient integer patches Bounded-coefficient integer patch covers on prime ideals.
  4. 3.3: Weighted residue cut Weighted Hilbert and prime-product bounds yield cuts and descent.
  5. 3.4: Deletion estimate Deterministic prime blocks control minor divisors across adaptive stages.
§4. Arithmetic model and balanced factorization 2 items
  1. §4 (setting) Arithmetic models for integer polynomials and integral embedding charts.
  2. Lemma 4.1 Balanced factorizations and fibre bounds for integer polynomials.
§7. Pair rings and weighted Hilbert lower bounds 2 items
  1. §7 (setting) Pair rings and weighted Hilbert functions.
  2. Proposition 7.1 Uniform weighted Hilbert lower bounds for algebraic pair relations.
§8. Quartic surface Hilbert bound 1 item
  1. Proposition 8.1 Weighted Hilbert bounds and alternatives for quartic box systems.
§9. Rational values and curve alternatives 2 items
  1. 9.1: Integral values of a rational function Complex nonpolynomial rational functions have sparse bounded integral values.
  2. Proposition 9.2 Point sparsity or linear weighted Hilbert growth in polynomial quotients.
§11. Degree ranges and completion 2 items
  1. 11.1 (proof): Range handled by the original surface Asymptotic power-free density for degree at least nine.
  2. 11.2-11.3 (proof): Number-field range and completion Dyadic tail bounds and power-free polynomial density.

No item matches.