Analytic number theory · prime values of polynomial families · sieve methods

Bateman–Horn Conjecture

Collaboration beta

How often does every polynomial in a fixed admissible family take a prime value at the same integer input?

#{nx:f1(n),,fk(n)all prime}Sf2xdtilogfi(t)
Known results and sources
A dark forest-green mathematical landscape shows several patterned polynomial-value ribbons passing through open modular residue rings and aligning at one luminous integer-input slice; no proof is asserted.
An admissible polynomial family can avoid every local congruence obstruction and occasionally produce prime values simultaneously—the frequency predicted by Bateman–Horn remains conjectural.

Research problem

Exact mathematical statement

Let f1,,fk[t]f_1,…,f_k\in\mathbb Z[t] be primitive, pairwise nonassociate, irreducible, nonconstant polynomials with positive leading coefficients. Assume the family is admissible: no prime divides ifi(n)\prod_i f_i(n) for every integer nn. For each prime pp, set

ν(p)=#{amodp:ifi(a)0(modp)},Sf=p1-ν(p)/p(1-1/p)k.\nu(p)=\#\{a\operatorname{mod} p: \prod_i f_i(a)\equiv0\pmod p\},\qquad \mathfrak S_{\mathbf f}=\prod_p\frac{1-\nu(p)/p}{(1-1/p)^k}.

The Bateman–Horn conjecture predicts

#{nx:f1(n),,fk(n)are all prime}Sf2xdtilogfi(t).\#\{n\le x:f_1(n),…,f_k(n)\text{ are all prime}\}\sim\mathfrak S_{\mathbf f}\int_2^x\frac{dt}{\prod_i\log f_i(t)}.

Equivalently, the leading scale is Sfidegfix(logx)k\frac{\mathfrak S_{\mathbf f}}{\prod_i\deg f_i}\frac{x}{(\log x)^k}. The classical fixed-family conjecture remains open. The retained source develops one unfinished program centered first on f1(n)=nf_1(n)=n and f2(n)=n+2f_2(n)=n+2; it contains no complete proof.

Problem infographic

Problem at a glance

Scientific problem explainer for the open Bateman–Horn conjecture, showing an admissible family of irreducible integer polynomials, modular root counts nu of p, the singular-series local correction, the predicted simultaneous prime-value count, and the twin-prime specialization n and n plus two.
Local residue obstructions determine the singular-series correction to the predicted simultaneous prime-value count, but the classical asymptotic for every fixed admissible polynomial family remains open.

Current mathematical picture

Where work on Bateman–Horn Conjecture stands

Open conjecture

This curated overview retains the current work's exact Bateman–Horn statement and singular-series normalization, its conditional reduction of the weighted twin-prime specialization to interconvertible parity residuals, exact prime-annihilating, smooth–rough, finite-kernel, and character identities, the source-presented combined large-sieve estimate, scoped core excisions, route failures, and six work orders. The final hybrid cancellation theorem remains open; solving it would address only the weighted twin-prime nucleus, while the general conjecture still requires nonlinear and proper-prime-power work. The source includes no reproducible attachment, formal evidence, independent review, complete proof, or accepted result, and this state has no proof, review, acceptance, or publication effect.

Leading routeProjector-first reduced-conductor route

Sum primitive conductors and inflations before any absolute square, recover the true reduced additive phase, and then combine the finite-kernel or smooth–rough organization with reduced-conductor or Ramanujan dispersion.

Route status · Active route
Useful failureConditional Kloosterman side strip

A quoted Bettin–Chandee-type input yields provisional 1/38 uniform and 1/33 balanced standard-gauge strips, but the exact published theorem and all hypotheses remain unaudited, so this is an optional narrowed side branch rather than the active endpoint.

Route status · Narrowed route
Main reductionDerivative–tail blocks expose the full signed diagonal

The intrinsic -L'T_R transform, combined large-sieve bound, and divisor-stratified primitive orthogonality isolate the structure that an admissible high-conductor argument must preserve.

Evidence posture · Reported reduction
Completed special caseFixed and subpolynomial nonunit core cusps are excised

Grouped two-dimensional sieve estimates make each fixed nonunit prime-power core and the subpolynomial nonunit cusp source-reported o(X), with the unit, transition, and central scopes explicitly excluded.

Evidence posture · Reported special case
Priority open bridgeDerive the exact Q_R Poisson/character formula

Starting from (8.M1)–(8.M4), derive the Q_R-gauge primitive-character formula with reduced conductors, every coprimality condition, zero and negative frequencies, finite derivative–tail blocks, local factors, its own low-conductor estimate, and exact projector recovery.

Task status · Ready to work on
Research-record correctionResearch-record correction

We corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Reader-facing record corrected; mathematics unchanged

Work mapped so far

Bateman–Horn Conjecture in numbers

1.6kretained lines of mathematical investigation1,641 in the current working snapshot
Argument development
1,449 · 88%
Explored or eliminated routes
10 · 1%
Computational analysis
3 · 0%
Open obligations
96 · 6%
Definitions and setup
83 · 5%
18selected mapped statements7routes investigated7reported milestones6open questions4contribution-ready tasks
How this is measured

This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.

Argument map and routes

How the current approaches connect

Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.

Visible working map

Research route map

26 selected steps

Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.

26 selected steps

Scroll horizontally to explore the route

Working route overview for Bateman–Horn ConjectureA selected map of recorded claims, active routes, useful failures, open questions, and their explicit relationships. Search, filter, zoom, or pan within this page.Bateman–Horn conjecture — Depends on missing premiseBateman–Horn conjectureOpen hybrid cancellation theorem — Depends on missing premiseOpen hybrid cancellationtheoremConditional standard-gauge low-conductor estimate — ChallengedConditional standard-gaugelow-conductor estimateConditional twin-prime quadratic residual — Depends on missing premiseConditional twin-primequadratic residualDerivative–reciprocal-tail transform — ChallengedDerivative–reciprocal-tailtransformDeterminant and odd Poisson geometry — Depends on missing premiseDeterminant and odd PoissongeometryDivisor-stratified primitive diagonal — Depends on missing premiseDivisor-stratified primitivediagonalFour conditional residual presentations — Depends on missing premiseFour conditional residualpresentationsLocal depth-two parity kernel — Depends on missing premiseLocal depth-two paritykernelWeighted von Mangoldt target — Depends on missing premiseWeighted von Mangoldt targetCombined derivative–tail large sieve — Depends on missing premiseCombined derivative–taillarge sieveExact smooth–rough peeling — Depends on missing premiseExact smooth–rough peelingProjector-first reduced-conductor route — activeProjector-firstreduced-conductor routeCharacter-first derivative–tail route — activeCharacter-firstderivative–tail routeFour-term finite-kernel dispersion — activeFour-term finite-kerneldispersionLevel-2 spectral parity-kernel route — activeLevel-2 spectralparity-kernel routeEuler-complete the cutoff zero mode independently — stoppedEuler-complete the cutoffzero mode independentlyClassify oscillation by the nominal modulus L — stoppedClassify oscillation by thenominal modulus LTreat primitive conductor, inflation, gcd, and switching coordinates as independent global savings — stoppedTreat primitive conductor,inflation, gcd, andswitching…Use prime annihilation alone as a parity breakthrough — stoppedUse prime annihilation aloneas a parity breakthroughDerive the exact Q_R Poisson/character formula — OpenDerive the exact Q_RPoisson/character formulaClassify the derivative–tail diagonal — BlockedClassify the derivative–taildiagonalBuild one four-term finite-kernel dispersion identity — OpenBuild one four-termfinite-kernel dispersionidentityFinish the analytic-input audit — OpenFinish the analytic-inputauditTest the spectral level-2 parity kernel — OpenTest the spectral level-2parity kernelExtend beyond the twin-prime nucleus — BlockedExtend beyond the twin-primenucleus
Working claimActive routeOpen, active, or blocked questionUseful failure

Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.

Active routeProjector-first reduced-conductor route

Sum primitive conductors and inflations before any absolute square, recover the true reduced additive phase, and then combine the finite-kernel or smooth–rough organization with reduced-conductor or Ramanujan dispersion.

Route status · Active route
Active routeCharacter-first derivative–tail route

Retain primitive characters long enough to expose the derivative–tail blocks, carry every c|f divisor stratum after squaring, and require exact recovery of the projector-first formula after summing primitive data.

Route status · Active route
Active routeFour-term finite-kernel dispersion

Keep the depth-(1,1), mixed, and depth-(2,2) pieces in one signed dispersion identity and seek cancellation of the order-X diagonal before absolute values.

Route status · Active route
Active routeLevel-2 spectral parity-kernel route

Insert B_R into the level-2 slice before absolute values and test whether a Kuznetsov or Eisenstein decomposition exposes exact continuous-spectrum diagonal cancellation.

Route status · Active route
Active routeAnalytic-input audit

Resolve the exact literature statements, normalizations, ranges, exceptional-character posture, and small-range errors behind every conditional analytic reduction before retaining any numerical strip or final asymptotic.

Route status · Active route

Explored alternatives

Other routes

2 recorded
Narrowed routeConditional Kloosterman side strip

A quoted Bettin–Chandee-type input yields provisional 1/38 uniform and 1/33 balanced standard-gauge strips, but the exact published theorem and all hypotheses remain unaudited, so this is an optional narrowed side branch rather than the active endpoint.

Route status · Narrowed route
Route held in reserveGeneral Bateman–Horn extension

General low-divisor, multi-coordinate, proper-subtuple, nonlinear-conductor, proper-power, and partial-summation work remains in the current research map but paused until the weighted twin-prime nucleus is solved.

Route status · Route held in reserve

Route statements and reductions

Statements the next route can inspect and build on

Route statementDeterminant and odd Poisson geometry

Writing n=ar and n+2=bs gives the exact determinant equation bs-ar=2. In the recomputed odd sector, solution-line Poisson summation has prefactor X/(2rs) and phase (-1)^k e(-k r-bar/s), producing a level-2 slice rather than a full Hecke correspondence.

Source-reported route statement · dependencies incomplete
Route statementPrimitive projector and cutoff collapse

For odd squarefree conductor, the primitive Gauss projector has the divisor formula K_f(u)=sum_{c|f} phi(c)e_c(overline{(f/c)u}); after summing conductor and inflation without a cutoff, the projector collapses exactly to the original reduced additive phase.

Source-reported route statement · dependencies incomplete
Route statementConditional standard-gauge low-conductor estimate

Assuming the current work's uniform smooth twisted-Mertens estimate for primitive conductor at most (log X)^C, the standard-gauge low-primitive-conductor block is bounded by X(log X)^(-A). The source explicitly warns that this does not establish the corresponding Q_R-gauge estimate.

Source-reported route statement · dependencies incomplete
Route statementLocal depth-two parity kernel

On the support ceiling C_w X+2, A_R^{3}=0 and M_R has the local inverse epsilon-A_R+A_R^{2}. Consequently Q_R=-tildeLambda_RB_R with B_R=A_R-A_R^{2}; only multiplicative depths one and two occur at the square-root cutoff.

Source-reported route statement · dependencies incomplete
Route statementRough-sector Möbius parity

For supported R-rough n>1, the local finite kernel satisfies B_R(n)=-mu(n). Thus prime annihilation transfers Möbius parity into B_R instead of eliminating it.

Source-reported route statement · dependencies incomplete
Route statementDerivative–reciprocal-tail transform

For a Dirichlet character chi and Re(s)>1, the Dirichlet series of Q_R is -L'(s,chi) T_R(s,chi). Near Re(s)=1 the current work authorizes only finite or smoothly truncated tails with an explicit justified contour passage.

Source-reported route statement · dependencies incomplete
Route statementCombined derivative–tail large sieve

Keeping the derivative polynomial and reciprocal Möbius tail in one character polynomial, the current work gives a proof of a mean-square bound by (Q^2+AN)R^{-1}log^2(2A). This remains source-presented proof text, not independently checked evidence.

Source-reported route statement · dependencies incomplete
Route statementDivisor-stratified primitive diagonal

After a fixed-conductor absolute square, primitive orthogonality produces the full signed family f sum_{c|f} phi(c)mu(f/c) 1_{Y_1=Y_2 mod c}. The congruence modulo f is only the top stratum, and the fixed-f square destroys the outer mu(f) sign.

Source-reported route statement · dependencies incomplete
Route statementSubpolynomial nonunit-core cusp bound

For grouped nonunit full-smooth prime-power cores with min(u,u')<=Y<=X^(1/4), the current work sketches a two-dimensional Selberg-sieve bound C_R^cusp(Y;X) << X log Y/log X+o(X), hence o(X) for a subpolynomial Y. The scope excludes rough-unit states, transition collars, and fully smooth cases.

Source-reported route statement · dependencies incomplete

More ways to contribute

Open questions

Additional prepared tasks for exploring this research frontier.

6 featured tasks
01
Derive the exact Q_R Poisson/character formula

Starting from (8.M1)–(8.M4), derive the Q_R-gauge primitive-character formula with reduced conductors, every coprimality condition, zero and negative frequencies, finite derivative–tail blocks, local factors, its own low-conductor estimate, and exact projector recovery.

Suggested move: Fix one Fourier and Gauss-sum convention, differentiate the analytic Poisson family, reduce each phase to its true conductor, and verify exact recovery of the additive projector before estimating any block.
Ready to work on
02
Build one four-term finite-kernel dispersion identity

Expand the shifted product with signs (+,-,-,+), derive a common dispersion identity before absolute values, and prove or refute cancellation of the depth-(1,1) diagonal against the mixed and depth-(2,2) corrections.

Suggested move: Write the four depth pieces with the exact kernel signs in one identity and inspect the complete diagonal before applying any norm inequality.
Ready to work on
03
Finish the analytic-input audit

Pin the exact Bettin–Chandee, smooth Bombieri–Vinogradov, twisted-Mertens, Mellin-truncation, and two-dimensional Selberg-sieve inputs, including all coefficients, ranges, errors, epsilon losses, exceptional-character posture, and small-range treatment.

Suggested move: Begin with exact source identification and theorem statements for the quoted trilinear estimate and the smooth twisted-Mertens input, then recompute every range and epsilon loss.
Ready to work on
04
Test the spectral level-2 parity kernel

Insert B_R into the level-2 congruence slice and determine whether the finite inverse cancels the continuous-spectrum diagonal before absolute values; if not, return the exact Eisenstein coefficients.

Suggested move: Write the level-2 Kuznetsov/Eisenstein decomposition with B_R inserted before absolute values and compute the continuous-spectrum coefficients.
Ready to work on
05
Classify the derivative–tail diagonal

After the exact formula from Work Order 1 exists, square only the combined derivative–tail block and classify equality, common-factor, genuinely modular, low-effective-conductor, and one-/two-large-factor solutions for every divisor stratum c|f with its exact sign.

Suggested move: Wait for the exact Work Order 1 coefficient formula, then retain all c|f strata and the fixed-f loss of the outer mu(f) sign.
Blocked by the current route
06
Extend beyond the twin-prime nucleus

Only after the twin nucleus is solved, prove uniform low-divisor asymptotics, construct a multi-coordinate finite parity kernel, control proper-subtuple faces, handle nonlinear root-class conductors, prove proper-prime-power removal, and perform partial summation.

Suggested move: Do not generalize the active endpoint yet; retain the explicit nonlinear proper-power obligation and return to it only after the weighted twin-prime gate closes.
Blocked by the current route

Sourced mathematical context

The known mathematical landscape

Context collected Aug 6, 2026
Current statusOpen conjecture

As of 2026-08-06, the classical fixed-polynomial integer Bateman–Horn conjecture remains open. For an admissible family f₁,…,fₖ in ℤ[x], it predicts that the number of n≤N for which every fᵢ(n) is prime is asymptotic to (C/∏ᵢ deg fᵢ)∫₂ᴺ dt/(log t)ᵏ, where C is the Euler product of local correction factors (1−Nₚ/p)/(1−1/p)ᵏ and Nₚ counts roots of ∏ᵢfᵢ modulo p. Results for almost all coefficient choices, generalized von Mangoldt functions, numerical experiments, and polynomial rings over finite fields are meaningful progress in neighboring or averaged settings, but none proves this asymptotic for every fixed admissible integer-polynomial family.

[3][4][7]
External progress

What the literature has established

Selected external milestones in reverse chronological order, with their evidence posture.

  1. PreprintSofos announced a Bateman–Horn average theorem for generalized von Mangoldt functions, with almost-all-polynomial applications to values having exactly two or three prime factors. It does not prove prime values for every fixed admissible polynomial.[9]
  2. PreprintKravitz, Woo, and Xu announced moment and distributional Bateman–Horn results for random polynomials with substantial averaging in the coefficients. The source is a preprint and its quantifiers differ from the classical fixed-polynomial conjecture.[8]
  3. Peer reviewedSkorobogatov and Sofos proved Schinzel-type conclusions for 100% of coefficient-ordered polynomial families and derived a form of the Bateman–Horn conjecture on average. This does not establish the claim for every fixed admissible tuple.[7]
  4. Computational resultLi reported empirical investigations of Bateman–Horn predictions and proposed a modified approximation with improved finite-range behavior for nonmonic polynomials. Numerical agreement does not prove the asymptotic conjecture.[6]
13 cited sources8 related results or reductionsReferences

Mathematical neighborhood

Related results and reusable starting points

Current focusBateman–Horn conjecture
Weaker or relaxed formSchinzel's Hypothesis H

Schinzel's Hypothesis H predicts infinitely many simultaneous prime values under the corresponding admissibility conditions; Bateman–Horn strengthens this qualitative claim by predicting an explicit asymptotic frequency.

[2][3]
Weaker or relaxed formBouniakowsky conjecture

The single-polynomial infinitude assertion known as Bouniakowsky's conjecture is contained in the Bateman–Horn framework, which additionally predicts the asymptotic count.

[3][7]
Weaker or relaxed formHardy–Littlewood prime-tuples conjecture

Restricting to tuples of linear polynomials recovers the prime-tuples setting of the first Hardy–Littlewood conjecture.

[3][4]
Logical consequencetwin-prime conjecture

Applying Bateman–Horn to f₁(n)=n and f₂(n)=n+2 yields the Hardy–Littlewood asymptotic for twin primes and therefore implies their infinitude.

[3][4]
Logical consequenceLandau's n²+1 prime-values problem

For the polynomial n²+1, Bateman–Horn predicts an explicit asymptotic count and in particular infinitely many prime values, a famous problem of Landau.

[3][4]
Solved special caseprime number theorem

For the single polynomial f(n)=n, the Bateman–Horn prediction reduces to the prime number theorem.

[3][4]
Related problemBateman–Horn analogues over large finite fields

Entin's theorem establishes a broad analogue for irreducible values over polynomial rings over large finite fields. It is a strategically informative neighboring theorem with a different arithmetic setting.

[5]
Weaker or relaxed formBateman–Horn on average over polynomial coefficients

Average-over-coefficients theorems show Bateman–Horn-type behavior for almost all polynomial families under stated ranges and averaging regimes, without resolving every fixed family.

[7][8]

Formal and computational footholds

Existing statements, libraries, computations, and datasets that can shorten the next serious attempt.

  • formal library support · partial resource linkedMathlib prime, polynomial, and prime-counting foundations

    Mathlib supplies natural-number primality, polynomial evaluation and irreducibility lemmas, and a prime-counting function. The scoped review did not find a canonical Bateman–Horn proposition, its singular-series asymptotic, or a checked proof.

    [10][11]
  • computation · not independently reproducedLi empirical Bateman–Horn study

    The peer-reviewed study reports numerical investigations and a modified finite-range approximation, especially for nonmonic polynomials. ProofAtlas did not rerun the computations, and the cited landing pages did not expose a reusable code or data package.

    [6]

Formalization opportunities

Lean work can make these reusable foundations precise without being presented as a proof of the core problem.

  • Formalization targetA revision-pinned formal statement must define an admissible finite family of pairwise nonassociate irreducible integer polynomials with positive leading coefficients and no fixed prime divisor.
  • Formalization targetThe simultaneous prime-value counting function, local root counts modulo primes, the Euler-product singular series, degree normalization, logarithmic integral, and asymptotic-equivalence conclusion must be formalized and aligned with the original statement.
  • Formalization targetSubstantial analytic-number-theory infrastructure would be required for any proof route; the scoped Mathlib review exposed only lower-level foundations, not the conjectural asymptotic machinery.
  • Formalization targetNo checked proof term for the classical Bateman–Horn conjecture was located in the reviewed public formal libraries.

Research-record corrections

What changed in the research record

These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.

Research-record correctionWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details

The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.

How the route was assembled

Argument structure

These stages follow the mathematical order of the supplied argument.

7 mapped milestonesretained argument map

Browse all 7 mapped stages

  1. stage 1General conjecture and weighted target normalized
  2. stage 2Twin residual reaches determinant–Poisson geometry
  3. stage 3Primitive projector collapses to the reduced phase
  4. stage 4Prime annihilation becomes a finite parity kernel
  5. stage 5Derivative–tail blocks expose the full signed diagonal
  6. stage 6Fixed and subpolynomial nonunit core cusps are excised
  7. stage 7The current hybrid gate remains open
General conjecture and weighted target normalizedThe source fixes the admissible polynomial-tuple statement, ordered singular series, weighted von Mangoldt target, and separate proper-prime-power obligation.

Mapped research milestoneInitial research sequence

Research stage 1
Twin residual reaches determinant–Poisson geometryConditional low-term analysis isolates the twin quadratic residual, and exact divisor algebra turns it into bs-ar=2 with the corrected odd Poisson phase.

Mapped research milestoneInitial research sequence

Research stage 2
Primitive projector collapses to the reduced phaseExact projector algebra removes fictitious independent conductor savings and conditionally controls the standard-gauge low-conductor block.

Mapped research milestoneInitial research sequence

Research stage 3
Prime annihilation becomes a finite parity kernelExact Q_R identities, smooth–rough peeling, and the local depth-two inverse isolate prime-power cores while showing that rough-sector Möbius parity survives.

Mapped research milestoneInitial research sequence

Research stage 4
Derivative–tail blocks expose the full signed diagonalThe intrinsic character transform, combined large sieve, and exact primitive orthogonality identify the complete signed divisor family that the high-conductor argument must retain.

Mapped research milestoneInitial research sequence

Research stage 5
Fixed and subpolynomial nonunit core cusps are excisedGrouped two-dimensional sieve estimates make fixed and subpolynomial nonunit prime-power cores source-reported o(X) while explicitly leaving unit, transition, and central scopes open.

Mapped research milestoneInitial research sequence

Research stage 6
The current hybrid gate remains openThe source isolates two admissible main attack orders, a parallel finite-kernel route, a spectral alternative, an analytic audit, and a blocked general extension around one unresolved hybrid cancellation theorem.

Mapped research milestoneInitial research sequence

Research stage 7

Detailed research inventory

Claims, milestones, and routes in the current map

This view highlights the mathematical statements most useful for following the current route.

15 standing statements3 proposed statements7 mathematical milestones6 open questions1 narrowed routes4 conditional results4 completed special cases
Statements by mathematical role18 selected mapped statements
  • theorem candidate2 of 182
  • definition1 of 181
  • reduction4 of 184
  • equivalence4 of 184
  • lemma7 of 187
Selected mathematical clusters7 mathematical clusters
Conjecture, admissibility, and normalizationThe exact polynomial hypotheses, local obstruction count, ordered singular series, weighted target, and proper-prime-power boundary.5 displayed rows · 1 route included
  • retained route statementBateman–Horn conjecture
  • retained route statementAdmissibility and singular series
  • retained route statementWeighted von Mangoldt target
  • Research targetExtend beyond the twin-prime nucleusblocked
  • Route held in reserveGeneral Bateman–Horn extensionGeneral low-divisor, multi-coordinate, proper-subtuple, nonlinear-conductor, proper-power, and partial-summation work remains in the current research map but paused until the weighted twin-prime nucleus is solved.
Conditional twin-prime reductionThe weighted twin specialization, determinant geometry, odd Poisson formula, and four conditional residual presentations.5 displayed rows · 1 route included
  • retained route statementConditional twin-prime quadratic residualspecial case
  • retained route statementDeterminant and odd Poisson geometryconditional
  • retained route statementFour conditional residual presentationsconditional
  • DerivationThe current work expands the low, mixed, and quadratic terms and, conditional on the named analytic estimates, isolates the parity residual before rewriting it in four exact support-range forms.active reported
  • Narrowed routeConditional Kloosterman side stripA quoted Bettin–Chandee-type input yields provisional 1/38 uniform and 1/33 balanced standard-gauge strips, but the exact published theorem and all hypotheses remain unaudited, so this is an optional narrowed side branch rather than the active endpoint.
Exact parity reorganizationsPrimitive projector collapse, prime annihilation, smooth–rough peeling, the local finite inverse, and rough-sector Möbius parity.7 displayed rows · 2 routes included
  • retained route statementPrimitive projector and cutoff collapseintermediate
  • retained route statementPrime-annihilating residualintermediate
  • retained route statementExact smooth–rough peelingintermediate
  • retained route statementLocal depth-two parity kernelintermediate
  • retained route statementRough-sector Möbius parityspecial case
  • Active routeProjector-first reduced-conductor routeSum primitive conductors and inflations before any absolute square, recover the true reduced additive phase, and then combine the finite-kernel or smooth–rough organization with reduced-conductor or Ramanujan dispersion.
  • Active routeFour-term finite-kernel dispersionKeep the depth-(1,1), mixed, and depth-(2,2) pieces in one signed dispersion identity and seek cancellation of the order-X diagonal before absolute values.
Character and diagonal structureThe derivative–tail transform, combined large sieve, full divisor-stratified diagonal, and boundary/gauge warnings.8 displayed rows · 2 routes included
  • retained route statementConditional standard-gauge low-conductor estimateconditional
  • retained route statementDerivative–reciprocal-tail transformintermediate
  • retained route statementCombined derivative–tail large sieveintermediate
  • retained route statementDivisor-stratified primitive diagonalintermediate
  • ChallengeThe standard-gauge bound (5.21) uses log(r/R_0)log(s/R_0), while the prime-annihilating gauge has the different joint amplitude log(a)log(b); the former cannot be cited as the latter.overclaimed scope · open
  • ChallengeThe infinite reciprocal tail is not authorized as an absolutely convergent boundary object on Re(s)=1; a finite or smoothed tail and a justified Mellin/contour passage are required.overclaimed scope · open
  • Active routeCharacter-first derivative–tail routeRetain primitive characters long enough to expose the derivative–tail blocks, carry every c|f divisor stratum after squaring, and require exact recovery of the projector-first formula after summing primitive data.
  • Active routeAnalytic-input auditResolve the exact literature statements, normalizations, ranges, exceptional-character posture, and small-range errors behind every conditional analytic reduction before retaining any numerical strip or final asymptotic.
Scoped core excisions and computation postureThe source-reported nonunit cusp and fixed-core bounds, plus unreproduced finite regression checks and their explicit exclusions.3 displayed rows
  • retained route statementSubpolynomial nonunit-core cusp boundspecial case
  • retained route statementFixed nonunit core special casespecial case
  • ComputationThe source reports finite regression checks for the primitive projector, cutoff collapse, Poisson–Ramanujan duality, local inverse/kernel values, smooth–rough and transition formulas, and gauge/radical identities.The checks are reported only in the governing Markdown. No code, input, output log, certificate, or independently reproduced artifact accompanies the ZIP, and ProofAtlas did not rerun them. · reported unreproduced
Scoped route failuresTen source-reported failure modes delimit invalid cutoff completion, wrong conductors, lost signs/phases, overglobalized identities, and insufficient standalone estimates.10 displayed rows
  • Useful failureEuler-complete the cutoff zero mode independentlyreported failure
  • Useful failureClassify oscillation by the nominal modulus Lreported failure
  • Useful failureTreat primitive conductor, inflation, gcd, and switching coordinates as independent global savingsreported failure
  • Useful failureUse prime annihilation alone as a parity breakthroughreported failure
  • Useful failureEstimate raw affine lines or almost-prime layers independentlyreported failure
  • Useful failureApply separate Cauchy inequalities and ordinary large sievesreported failure
  • Useful failureUse rapid Fourier decay for the entire H<1 rangereported failure
  • Useful failureDamped analytic deformation and generalized-von-Mangoldt moment descentreported failure
  • Useful failureUse local sieve improvements, GRH, or fixed-frequency equidistribution alonereported failure
  • Useful failureGlobalize the reciprocal tail or finite inverse beyond their proved domainsreported failure
Open hybrid frontierThe unresolved hybrid theorem, plural active routes, analytic audit, spectral alternative, and blocked general extension.13 displayed rows · 6 routes included
  • retained route statementOpen hybrid cancellation theoremconditional
  • Research targetDerive the exact Q_R Poisson/character formulaopen
  • Research targetClassify the derivative–tail diagonalblocked
  • Research targetBuild one four-term finite-kernel dispersion identityopen
  • Research targetFinish the analytic-input auditopen
  • Research targetTest the spectral level-2 parity kernelopen
  • Research targetExtend beyond the twin-prime nucleusblocked
  • Active routeProjector-first reduced-conductor routeSum primitive conductors and inflations before any absolute square, recover the true reduced additive phase, and then combine the finite-kernel or smooth–rough organization with reduced-conductor or Ramanujan dispersion.
  • Active routeCharacter-first derivative–tail routeRetain primitive characters long enough to expose the derivative–tail blocks, carry every c|f divisor stratum after squaring, and require exact recovery of the projector-first formula after summing primitive data.
  • Active routeFour-term finite-kernel dispersionKeep the depth-(1,1), mixed, and depth-(2,2) pieces in one signed dispersion identity and seek cancellation of the order-X diagonal before absolute values.
  • Active routeLevel-2 spectral parity-kernel routeInsert B_R into the level-2 slice before absolute values and test whether a Kuznetsov or Eisenstein decomposition exposes exact continuous-spectrum diagonal cancellation.
  • Active routeAnalytic-input auditResolve the exact literature statements, normalizations, ranges, exceptional-character posture, and small-range errors behind every conditional analytic reduction before retaining any numerical strip or final asymptotic.
  • Route held in reserveGeneral Bateman–Horn extensionGeneral low-divisor, multi-coordinate, proper-subtuple, nonlinear-conductor, proper-power, and partial-summation work remains in the current research map but paused until the weighted twin-prime nucleus is solved.
How to interpret these counts

A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.

Research outlook

Conditions that would advance the current route

Priority open bridgeStarting from (8.M1)–(8.M4), derive the Q_R-gauge primitive-character formula with reduced conductors, every coprimality condition, zero and negative frequencies, finite derivative–tail blocks, local factors, its own low-conductor estimate, and exact projector recovery.

1 approach has already been tested and narrowed. The task above is the current priority within the larger open route.

Evidence needed nextConcrete conditions for progress

A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.

  • The separated formula includes zero mode, negative frequencies, local Euler factors, conductor inflation, and every coprimality condition.
  • A Q_R-specific low-effective-conductor estimate is proved without importing (5.21).
  • Exact summation of primitive data recovers the reduced additive phase.

Continue the mathematics

Contribute

ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.

Read-only beta · actions unavailable
Prepared starting pointDerive the exact Q_R Poisson/character formula

Bateman–Horn Conjecture · ready to start

Mathematical updatesFollow this problem

Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.

Research contextPrepared context for any AI agent

How often does every polynomial in a fixed admissible family take a prime value at the same integer input?

  • Exact question and boundaries
  • Current routes and known obstacles
  • What a useful result should report
Return mathematical workReturn what you or your agent found

A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.

Proof attempt or partial resultSupporting notes or data
Hosted agentRun this task with a hosted agent

A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.

Your own AI agentConnect an outside research agent

Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.

Sources and references13 cited works · next context review by Nov 6, 2026

The mathematical context was checked on Aug 6, 2026. Status can be refreshed sooner after a material result or claim.

  1. 1
    A heuristic asymptotic formula concerning the distribution of prime numbersoriginal source · Paul T. Bateman, Roger A. Horn · Mathematics of Computation · 1962 · DOI 10.1090/S0025-5718-1962-0148632-7 · MR MR0148632 · accessed Aug 6, 2026
  2. 2
    Sur certaines hypothèses concernant les nombres premiersoriginal source · Andrzej Schinzel, Wacław Sierpiński · Acta Arithmetica · 1958 · accessed Aug 6, 2026
  3. 3
    The Bateman–Horn conjecture: Heuristic, history, and applicationssurvey or monograph · Soren Laing Aletheia-Zomlefer, Lenny Fukshansky, Stephan Ramon Garcia · Expositiones Mathematicae · 2020 · ARXIV 1807.08899 · DOI 10.1016/j.exmath.2019.04.005 · MR MR4177951 · accessed Aug 6, 2026
  4. 4
    What is... the Bateman–Horn Conjecture?survey or monograph · Stephan Ramon Garcia · Notices of the American Mathematical Society · 2024 · DOI 10.1090/noti3046 · accessed Aug 6, 2026
  5. 5
    On the Bateman–Horn conjecture for polynomials over large finite fieldspeer reviewed result · Alexei Entin · Compositio Mathematica · 2016 · ARXIV 1409.0846 · DOI 10.1112/S0010437X16007570 · accessed Aug 6, 2026
  6. 6
    A note on the Bateman–Horn conjecturepeer reviewed result · Weixiong Li · Journal of Number Theory · 2020 · ARXIV 1906.03370 · DOI 10.1016/j.jnt.2019.07.025 · accessed Aug 6, 2026
  7. 7
    Schinzel Hypothesis on average and rational pointspeer reviewed result · Alexei N. Skorobogatov, Efthymios Sofos · Inventiones Mathematicae · 2023 · DOI 10.1007/s00222-022-01153-6 · accessed Aug 6, 2026
  8. 8
    The distribution of prime values of random polynomialspreprint · Noah Kravitz, Katharine Woo, Max Wenqiang Xu · arXiv · 2025 · ARXIV 2512.03292 · DOI 10.48550/arXiv.2512.03292 · accessed Aug 6, 2026
  9. 9
    The Bateman–Horn conjecture on average for generalized von Mangoldt Functionspreprint · Efthymios Sofos · arXiv · 2026 · ARXIV 2606.15698 · DOI 10.48550/arXiv.2606.15698 · accessed Aug 6, 2026
  10. 10
    Mathlib.Data.Nat.Prime.Defsformalization · The mathlib Community · Mathlib · accessed Aug 6, 2026
  11. 11
    Mathlib.Algebra.Polynomial.Eval.Irreducibleformalization · The mathlib Community · Mathlib · accessed Aug 6, 2026
  12. 12
    Mathlib.NumberTheory.PrimeCountingformalization · The mathlib Community · Mathlib · accessed Aug 6, 2026
  13. 13
    Bateman–Horn conjectureencyclopedia · Wikipedia · accessed Aug 6, 2026

Important qualifications

  • This record concerns the classical Bateman–Horn conjecture for a fixed finite family of one-variable integer polynomials. It does not identify averaged coefficient-family results, multivariable variants, or function-field analogues with the classical statement.
  • The review selected representative frontier results and did not attempt an exhaustive bibliography of the many conditional applications of Bateman–Horn.
  • The scoped formalization search found useful Mathlib foundations but no canonical Bateman–Horn statement or checked proof in the official Mathlib documentation, the Isabelle Archive of Formal Proofs, or the public Lean/Rocq/Isabelle results reviewed. This scoped negative search does not establish nonexistence.
  • Mathlib is a moving library. Any public formal-library claim should be pinned to an exact source revision before it is treated as reproducible evidence.
  • The empirical work cited from Li was not independently rerun by ProofAtlas, and no reusable code or dataset was verified from the cited article landing page.
  • Recent average theorems and preprints do not prove the predicted asymptotic for every fixed admissible polynomial family.
  • Recent purported proofs found in broad search results do not change the open status without authoritative mathematical acceptance.
  • No current Clay Millennium, Hilbert, Smale, Erdős-problem, or verified selective maintained-list membership was found for this exact statement in the scoped review; absence from those checked collections is not a mathematical ranking.

Continue exploring

Compare another research frontier

See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.

Explore all research workspaces

Expanded visual

Open original image