Positive convergence of the Bateman–Horn Euler product
ProvedFCP.BatemanHorn.partialProduct_tendsto_posLet be a nonempty finite set of distinct integer polynomials. Assume each polynomial is irreducible, has positive leading coefficient and positive degree, and that for every prime some integer avoids all their roots modulo . Write and let count the residue classes modulo at which at least one polynomial vanishes. Then there is a positive real number such that
This is the classical convergence theorem for the singular product, separate from the conjectural prime-counting asymptotic. The primes are taken in increasing order; absolute convergence is not asserted. The source's convention for convergence of a product of positive factors requires its limit to be nonzero.
This node records a known mathematical result whose Lean proof is still required.
import Definitions.Def_FCP_BatemanHorn open Polynomial Filter Topology Asymptotics FCP.BatemanHorn
theorem FCP.BatemanHorn.partialProduct_tendsto_pos
(polys : Finset ℤ[X]) (h_nonempty : polys.Nonempty)
(h_bunyakovsky : ∀ f ∈ polys, BunyakovskyCondition f)
(h_schinzel : SchinzelCondition polys) :
∃ C : ℝ, 0 < C ∧ Tendsto (partialProduct polys) atTop (𝓝 C) := by sorry