Documentary state: DRAFT_UNACCEPTED. This draft has NOT been editorially admitted. Mathematical claims require independent checking.
OAI-26 family 020: squarefree quartics and power-free polynomial values
Editorial status: DRAFT_UNACCEPTED. NO_CERTIFICATION. This is a source-indexed exposition, not an independent verification of the manuscript.
The question in plain language
A positive integer is squarefree if no prime square divides it. For instance, 30 is squarefree, whereas 12 is divisible by the square of 2. Given a polynomial with integer coefficients, it is natural to ask how often its values are squarefree, or more generally avoid large prime powers.
A polynomial can have an unavoidable obstruction: a fixed prime square may divide every value, making squarefree outputs impossible. Once these local obstructions are excluded, the expected proportion is described by a product of local probabilities over the primes.
The pinned OAI-26 overview claims a proof for irreducible quartic polynomials and a broader power-free-values theorem for degrees four through eight.
A small example
Consider the integer polynomial
For each prime \(p\), count how many residue classes modulo \(p^2\) make \(f(n)\) divisible by \(p^2\). If this number is \(\rho_f(p^2)\), a uniformly sampled input avoids this prime-square obstruction with local proportion
The heuristic prediction for the global density is the Euler product over primes of these local proportions. Establishing that product as the true density requires showing that rare divisibility by large prime squares does not create an uncontrolled error. Merely establishing the right answer for every fixed finite set of primes is insufficient.
This illustration does not assert that every quartic, including the example, meets the theorem's exact hypotheses without a separate local check.
What is known
The pinned source catalogue lists one Family 020 manuscript, Squarefree values of quartics and power-free values of polynomials (September 24, 2026).
The publisher overview reports two results:
- For irreducible integer polynomials of degree four with no fixed prime-square divisor, squarefree values at positive integer inputs have the predicted positive Euler-product density.
- More generally, for irreducible integer polynomials of degree \(d\) from four through eight, the density of values free of prime powers of exponent \(d-2\) is established under the necessary local condition. The overview states that combining these cases with a higher-degree theorem of Browning covers all degrees at least four.
For degree four, \(d-2=2\), so the general power-free statement specializes to squarefree values. For degree five, the corresponding condition concerns cubes; the forbidden prime-power exponent varies with the polynomial's degree.
These are publisher-reported claims. The precise counting normalization, sign conventions for polynomial outputs, definition of the local condition, treatment of fixed divisors, and invoked higher-degree theorem require direct checking against the PDF.
GCL verification state
The catalogue and overview are pinned to openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. This article uses the indexed manuscript title and scope only.
No independent verification of the large-prime-power tail estimates, positivity of the Euler product, or the reduction to Browning's higher-degree result has been performed in this documentary pass. No Family 020-specific Lean theorem, Comparator replay, semantic-equivalence adjudication, or MATHCERT certification is asserted.
What remains
Read the exact September 24 PDF, identify its main theorems and hypotheses, and check whether density is counted among all positive integers or a restricted progression. Audit the local factors and prove they are positive under the stated no-fixed-obstruction condition.
Check how the proof handles large prime powers, whether the quartic squarefree case is proved separately or through the degree-dependent theorem, and exactly which Browning result is invoked for larger degrees. Verify that no additional polynomial smoothness, discriminant, or irreducibility assumptions are silently omitted.
After source criticism, run mathematical Markdown and generated-HTML checks, record a source-bound editorial disposition, and merge through protected governance. Documentary admission must not be confused with theorem certification.
Sources and claim boundaries
- Pinned Family 020 source manuscript.
- Pinned OAI-26 overview, Family 020.
- GCL editorial programme issue.
Boundary: NO_CERTIFICATION. This article reports the claimed density theorem without certifying its proof or any formalization.
Indexed primary manuscript paths:
- Squarefree values of quartics and power-free values of polynomials —
preprints/Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026/manuscript.pdf