Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Openai 2026 squarefree values quartics power free values polynomials
corollary_1_2: The manuscript's all-degrees claim: for an irreducible integer polynomial of degree d >= 4 with no fixed prime (d-2)th-power divisor, the (d-2)-power-free values at positive integers are claimed to have the positive Euler-product density; Theorem 1.1 for d <= 8, Browning's theorem in Xiao's form for d >= 9. This is the shape the release's Lean catalogue lists as formalized.
theorem_1_1: The manuscript's main claim: an irreducible integer polynomial of degree d between 4 and 8 with no fixed prime (d-2)th-power divisor takes (d-2)-power-free values at positive integers with positive density equal to the product of the local factors; squarefree values of n^4+2 are the quartic case asked in Problem 978.
OpenAI, Squarefree values of quartics and power-free values of polynomials,
OpenAI Math Release preprint, September 24, 2026. Released under the Apache
License 2.0 at https://github.com/openai/math (revision adc7f1241), folder
preprints/Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026;
the held PDF, manuscript.pdf in the release, is retained as
openai_2026_squarefree_values_quartics_power_free_values_polynomials.pdf,
and the release's TeX bundle sits beside manuscript.pdf in that folder.
@misc{OAI:Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026,
author = {{OpenAI}},
title = {{Squarefree values of quartics and power-free values of polynomials}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026/manuscript.pdf}{OAI:Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026}},
year = {2026}
}The release's root README states that the collection holds manuscripts "produced by an internal OpenAI model", that it "includes results at different stages of verification", that not all of them have Lean formalizations, and that "some of the unformalized results could have issues". The manuscript's own README gives the title, the author line "OpenAI", the date September 24, 2026 and the citation block, and adds no statement about human assistance; the title page names OpenAI as the author and September 24, 2026 as the date, and the 55-page text carries no names of individual authors, no acknowledgment and no statement on how it was produced. These are the source's own attestations, recorded here as history and not as this corpus's review. No refereed publication, arXiv version or independent review of the manuscript is recorded here and nothing on this card is independently reviewed.
The release's Lean catalogue (lean/formalization.yaml) lists this
manuscript among its sources and, separately, one main result: the
declaration OAI.QuarticPowerFree.allDegrees in
OAI/NumberTheory/PowerFree/Main.lean, with the comparator configuration
ComparatorChallenges/PowerFreeValues.json (permitted axioms propext,
Quot.sound, Classical.choice), whose challenge module is the statement
file ComparatorChallenges/PowerFreeValues.lean; the catalogue ties neither
entry to the other by name. The release's family page is what names
this manuscript as the accompanying paper, and it describes the formalized
statement as the all-degrees density: for irreducible over
of degree and such that no prime th power divides every
value of , the number of positive integers with -free
is with the convergent product of local factors,
negative values allowed, zero excluded, and no monicity, primitivity or
coefficient-height restriction. That is the shape of
Corollary 1.2
rather than of Theorem 1.1 alone; the comparator file states the local
condition as for every prime , the constant as a product
over the primes and the asymptotic as a little- statement. This corpus's
verification built the declaration and checked its axioms (propext,
Classical.choice and Quot.sound only); the record is kept with
Problem 978, and this
card adds no fidelity judgment of its own.
The release files this manuscript alone in its family (Squarefree quartics and power-free polynomial values).
Read status: claims checked for Theorem 1.1, Corollary 1.2, Corollary 1.3 and
Proposition 1.4, read clause by clause in the TeX source
(sections/01-introduction.tex, lines 20--29, 113--120, 136--158 and
197--206) on 2026-10-07, and for the statements of Proposition 2.1, Lemma
2.3, Theorem 3.1 and Corollary 12.1 (sections/02-sieve.tex lines 10--29 and
157--168, sections/03-affine-counting.tex lines 37--66,
sections/13-cyclotomic.tex lines 17--31, same date); the proofs were read
for their structure only and no step was checked; nothing here is
independently reviewed.
Contents
The manuscript (55 pages; main.tex inputs thirteen section files, and the
introduction inputs one figure) proves a large-prime estimate for prime powers
with larger than the input interval, and transfers it by
an elementary sieve to an exact density. Throughout, an integer is
-power-free when no prime power divides it, negative integers included
and zero excluded; counts the roots of modulo and
the with -power-free; the local condition
(1.1) is for every prime .
- Section 1, Introduction (pp. 2--6). States Theorem 1.1 (degrees , , the Euler-product density under (1.1), no primitivity or sign condition) and notes that the inputs are positive integers, that no coefficient-height bound is imposed and that no uniformity in is claimed for the error term; (Eisenstein at ) and (the eighth cyclotomic polynomial) are named as quartics satisfying (1.1). Subsection 1.1 surveys the earlier ranges: Ricci 1933 for ; Erdős 1953 (infinitude at exponent , and p. 425 for the unresolved ) and Hooley 1967 (the asymptotic at ); Erdős 1965, Section 6, p. 219, for the obstacle at exponent ; Nair 1976 (, reaching at ), Nair 1979 and Huxley--Nair 1980; Heath-Brown 2006, Theorem 16 (, reaching at ); Browning 2011 (, reaching at ), used in the formulation of Xiao 2017, Theorem 9.1 and Section 9; Heath-Brown 2013, Theorem 1, for binomials at ; Reuss 2015, Theorem 2, at exponent with a power saving; Granville 1998 under the conjecture; Greaves 1992 and Helfgott 2004 for binary forms; Browning--Shparlinski 2024 and Sofos 2026 on average over coefficients. Two preprints claiming the and cases (Carella 2023; Zapata Ceballos--Jalalvand 2026) are cited with the sentence "We do not use either claim as a theorem input." (p. 3) Corollary 1.2 extends the density to every , with a four-line proof from Theorem 1.1, Browning's theorem in Xiao's form and Lemma 2.3. Corollary 1.3 (Separable products and simultaneous values, p. 4): for fixed and a nonzero separable over whose irreducible factors have degree at most , the local condition for gives with ; and for a fixed family of such polynomials, the at which every is -power-free have density under the joint local condition , where is the set of classes modulo at which some vanishes modulo . Subsection 1.2 states Proposition 1.4 (p. 5), the large-prime estimate: for primitive, irreducible, with positive leading coefficient and degree , , the number of with for some prime is for some ; no local condition is needed. Subsections 1.3--1.4 outline the strategy and the dependence of the sections (Figure 1).
- Section 2, From a large-prime tail to the exact density (pp. 6--10). Proposition 2.1 (Sieve transfer): for irreducible of degree and satisfying (1.1), written with sign , content and primitive positive-leading , the hypothesis that the large-prime exceptional set of on is gives $S_{f,k}(N)=c_{f,k}N+ o(N)$ with . The proof keeps 's own factors at content primes through for , bounds outside a finite bad set by Hensel lifting, proves the product converges to a positive number, runs the Chinese remainder theorem for primes up to a fixed , bounds the primes by , lets and then , and passes from dyadic intervals to . Remark 2.2 notes that fixed congruence restrictions on can be imposed. Lemma 2.3 (Removing sign and content) transfers an already known density for to . The section ends with the proof of Corollary 1.3: factorwise tails are by a direct count for , by Reuss 2015, Lemma 3 and Section 6, for , by Proposition 1.4 for , and by Xiao 2017, Section 9, for .
- Section 3, Affine counting with adaptive auxiliary primes (pp. 10--16). Theorem 3.1: a finite set in a weighted box , lying on an algebraic set of degree at most and dimension at most , such that every subvariety irreducible over (geometrically irreducible) and defined over , of bounded degree and dimension , meeting either has for every or has weighted Hilbert function , satisfies with , uniformly in the coefficients of the defining equations. The proof builds patches with controlled equations (Lemma 3.2), cuts a simultaneous residue class modulo a product of auxiliary primes by a polynomial not vanishing on the patch (Lemma 3.3; the manuscript attributes the local determinant principle to Heath-Brown 2002, Section 3, the ordered Hilbert estimates to Salberger 2007 and the simultaneous prime conditions to Salberger 2007 and 2023), controls the primes at which later patches have singular reduction by a random deletion estimate over blocks of primes (Lemma 3.4), and counts along a tree of residue classes.
- Section 4, Arithmetic factorization and paired boxes (pp. 16--19). For primitive and irreducible with root and , Lemma 4.1 (Balanced factorization) produces integral with , , and conjugates of sizes and at every embedding, by ideal factorization, finiteness of the class group and Dirichlet's unit theorem (cited to Milne's notes), with at most selected inputs per . Lemma 4.2 (Paired boxes) partitions the normalized direction cubes into grid boxes of side , , shows that each direction is locally an analytic function of the other and of with uniform derivative bounds, and bounds the relevant pairs by .
- Section 5, Bihomogeneous determinant cuts (pp. 19--24). Lemma 5.1: the
bicone defined by
is a prime complete intersection of equations of bidegree
with explicit Hilbert polynomial ; the commutative algebra is
cited to Stacks project tags. Proposition 5.2 (label
prop:archimedean-cuts): under two explicit inequalities (5.2, the cut conditions) in , , and , the selected points of a paired box lie on boundedly many sets that are either a mixed hypersurface section of the bicone (affine dimension ) or have affine dimension at most ; a Taylor determinant estimate after Bombieri--Pila and Heath-Brown 2009 gives the first cut, and a coefficient-uniform rank bound gives a second cut on components defined by one coordinate block only. - Section 6, Lattice coordinates and exceptional fibers (pp. 24--27). Lemma 6.1 gives a lattice basis with product of lengths ; Proposition 6.2 groups the paired boxes by an excess index , with boxes in group and unimodular coordinate changes making , for , (after Reuss 2015, Sections 5--6); Lemma 6.3 removes, for , the points above a two-dimensional base at cost so that is algebraic over the -coordinates on every remaining subvariety.
- Section 7, Weighted Hilbert bounds from selected pairs (pp. 27--31). Proposition 7.1: for an irreducible subvariety of dimension of the arithmetic variety , with a nonempty open subset on which every and on which is nonconstant, the weighted Hilbert function is at least , where is the weight of an extracted equation; the coefficient doubles when the function field of has degree at least two over the pair image. The proof is a complete-intersection computation at weighted infinity. The general thresholds (dimension ), and (independent -coordinates) are recorded.
- Section 8, The additional geometry for quartics (pp. 31--35). Proposition 8.1: for a geometrically irreducible surface defined over in the quartic arithmetic variety, meeting the open set , on which is nonconstant and algebraic over the -coordinates, with ; the three cases are an -image of degree at least three, a quadric (using the bound degree codimension plus one, cited to Eisenbud--Green--Hulek--Popescu 2006) and a plane, where a deficient bound would force a polynomial of degree at most four with four distinct critical values or a degree-two map of directions ramified at four points. Proposition 8.2: there are finitely many quintics with critical points and critical values , and their integer values in form a set of size , removed once before any box is chosen.
- Section 9, Curve alternatives (pp. 35--38). Lemma 9.1: a nonpolynomial rational function of bounded degree takes integer values of size at integers of size , uniformly in its coefficients, by a resultant and the divisor bound. Proposition 9.2 (Curve alternatives): a curve irreducible over (geometrically irreducible) and defined over , of bounded degree, in the arithmetic variety either meets the selected set in points or has with , ; the quartic gain comes from the removed quintic values.
- Section 10, Parameters and an exact finite certificate (pp. 38--42). With , , , the prime exponent is cut into intervals up to a stopping index (Table 1: for ) where ; a mode (, ) uses the quartic surface bound. Proposition 10.1 (Parameter choice) asserts that each interval admits rational satisfying the cut conditions, the ratio bounds , and the saving (with in mode ), and proves a common-shift estimate by concavity. The finite inequalities are checked by the program of Appendix A, which the manuscript describes as exact rational arithmetic with every radical replaced by a strict upper bound; the manuscript flags this as a computer-assisted finite check and gives the certified gaps in Table 1. The subsection on coverage derives the final exponents and and the finite weights for the larger- range.
- Section 11, The large-prime estimate (pp. 43--45). Proof of Proposition 1.4: primes are split into dyadic ranges; when the triples on the surface are counted by Theorem 3.1 with surface threshold below and curve threshold ; otherwise the number-field range uses Lemma 4.1, Lemma 4.2, Proposition 5.2, Proposition 6.2, Lemma 6.3, Propositions 7.1, 8.1 and 9.2 and Theorem 3.1 with the certified parameters, giving exponent below per group. The completion sums the finitely many cases, and Proposition 2.1 then gives Theorem 1.1.
- Section 12, The cyclotomic quartic as a worked example (pp. 45--51). Corollary 12.1: and the with squarefree number , so at least of for large . Proposition 12.2: with the inputs in with for a prime number , using an enlarged first quartic parameter cell checked in Appendix A.1. The section then gives the Euclidean factorization in , Lemma 12.3 (a Pell estimate: solutions of in uniformly in ), the level equation and a column-selection determinant saving, and a final subsection on analytic relations and box incidence, whose analytic-relation estimate the manuscript itself calls "conditional on its stated hypotheses" (p. 51) and does not use in the density proof.
- Appendix A, The exact parameter certificate (pp. 51--53). The Python program (fractions only) implementing Section 10's prescription for every interval and , the endpoint derivative checks, and the assertions reproducing Table 1; A.1 the enlarged quartic cell for Proposition 12.2.
- References (pp. 53--55): 28 entries, listed in
references.bib.
The proofs rest on these external inputs, taken at statement level: the ideal factorization in a number field, finiteness of the class group and Dirichlet's unit theorem (Milne, Algebraic Number Theory, 2020); the Cohen--Macaulay, regular-sequence and reducedness criteria (Stacks project tags 00NQ, 02JN, 00NB, 00NA, 031Q, 031R); the lower bound degree codimension plus one for irreducible projective varieties (Eisenbud, Green, Hulek and Popescu 2006); Browning 2011 in Xiao 2017's formulation (Theorem 9.1 and Section 9) for in Corollaries 1.2 and 1.3; Reuss 2015, Lemma 3 and Section 6, for the case of Corollary 1.3; and elementary tools (Hensel lifting, the Chinese remainder theorem, Bertrand's postulate, Chebyshev's bounds and the divisor bound). Heath-Brown 2002, Salberger 2007 and 2023, Bombieri--Pila 1989, Heath-Brown 2009, 2012 and 2013 and Reuss 2015 are cited as the origin of the methods, with the manuscript stating that it proves the versions it needs. The manuscript flags two components: the finite parameter certificate of Section 10 and Appendix A is a printed program in exact rational arithmetic, and the analytic-relation estimate of Section 12 is conditional and unused. No step of any proof was checked here.
Bears on
- Problem 978: claimed resolution of the problem's second and third questions, in a stronger form. Corollary 1.2 claims that for every irreducible of degree such that no prime th power divides every value, the integers with -power-free have positive density ; the question asks only for infinitely many such , with a positive leading coefficient and with not a power of two, neither of which the manuscript requires. Theorem 1.1 applied to claims positive density of squarefree values, hence infinitely many, the third question. The first question, positive density of -power-free values, is not a result of this manuscript, which cites Hooley 1967 for that asymptotic. No step of the manuscript's proof was checked for this card; the page's status rests on acceptance evidence, which this card does not supply.
- Erdős 1953: the manuscript cites p. 425 of that paper as the source of the question and claims, in the stronger form of positive density, the infinitude of squarefree values of that the paper's closing remark (p. 425) leaves open; it does not touch the card's open question on -power-free density, which it attributes to Hooley 1967. Unverified here.
- Erdős 1965: the manuscript cites Section 6, p. 219 of the survey for the obstacle at exponent and the example; that card's digest records the passage as stating that nothing was proved for -power-free values, which is exactly the density the manuscript now claims; unverified here.