Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bunyakovsky conjecture in degree 111 (Dirichlet's theorem)

Proved
FCP.BatemanHorn.bunyakovsky_linear

by Himan · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Linear case of Bunyakovsky's conjecture. Let f∈Z[X]f \in \mathbb{Z}[X]f∈Z[X] have positive leading coefficient, be irreducible over Z\mathbb{Z}Z, and have degree exactly 111, so f=aX+bf = aX + bf=aX+b with a>0a > 0a>0. Then ∣f(n)∣|f(n)|∣f(n)∣ is prime for infinitely many natural numbers nnn.

Irreducibility of aX+baX+baX+b in Z[X]\mathbb{Z}[X]Z[X] forces gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1, so this is Dirichlet's theorem on primes in the arithmetic progression b mod ab \bmod abmoda. The Schinzel (no fixed prime divisor) condition is automatic here and is therefore not assumed.

Preamble
import Mathlib
import Definitions.Def_FCP_BatemanHorn

open Polynomial
Formal statement
namespace FCP.BatemanHorn

theorem bunyakovsky_linear (f : ℤ[X]) (h_bunyakovsky : BunyakovskyCondition f)
    (h_deg : f.natDegree = 1) :
    {n : ℕ | (f.eval (n : ℤ)).natAbs.Prime}.Infinite := by sorry

end FCP.BatemanHorn
Source
Formal Conjectures library (Google DeepMind), Apache-2.0, https://github.com/google-deepmind/formal-conjectures (FormalConjectures/Wikipedia/Bunyakovsky.lean); https://en.wikipedia.org/wiki/Bunyakovsky_conjecture (the degree-one case noted there as Dirichlet's theorem)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me