OAI/NumberTheory/EgyptianFractions/GoldbachSieveLocal.lean
14 declarations, 0 contain sorry, 0 declared as axioms
Finite local arithmetic for a possible binary Goldbach sieve. These results
count roots of the polynomial x * (u - x) and provide its multiplicative local
density. They do not assert any prime-pair bound or positive density of Goldbach
numbers.
- def
OAI.Problem337.GoldbachSieveRootline 18Source documentation
Residue classes removed by the binary Goldbach sieve.
def GoldbachSieveRoot (u d : ℕ) := …
- def
OAI.Problem337.goldbachSieveRootCountline 22Source documentation
Local number of roots of
x * (u - x)modulod.def goldbachSieveRootCount (u d : ℕ) : ℕ := …
- def
OAI.Problem337.goldbachSieveRootEquivline 26Source documentation
The Chinese remainder theorem separates the local root conditions.
def goldbachSieveRootEquiv (u a b : ℕ) (hab : a.Coprime b) : GoldbachSieveRoot u (a * b) ≃ GoldbachSieveRoot u a × GoldbachSieveRoot u b := by …Mentions: OAI.Problem337.GoldbachSieveRoot
- theorem
OAI.Problem337.goldbachSieveRootCount_mulline 41Source documentation
Root counts are multiplicative at coprime moduli, with no distribution hypothesis.
theorem goldbachSieveRootCount_mul (u a b : ℕ) (hab : a.Coprime b) : goldbachSieveRootCount u (a * b) = goldbachSieveRootCount u a * goldbachSieveRootCount u b := by …Mentions: OAI.Problem337.goldbachSieveRootCount
- theorem
OAI.Problem337.goldbachSieveRootCount_oneline 47 - theorem
OAI.Problem337.goldbachSieveRootCount_primeline 55Source documentation
At a prime, the only roots are zero and the target residue.
theorem goldbachSieveRootCount_prime (u p : ℕ) (hp : p.Prime) : goldbachSieveRootCount u p = if p ∣ u then 1 else 2 := by …Mentions: OAI.Problem337.goldbachSieveRootCount
- theorem
OAI.Problem337.goldbachSieveRootCount_prod_primesline 73Source documentation
A finite product of distinct primes gives the product of the local counts.
theorem goldbachSieveRootCount_prod_primes (u : ℕ) (s : Finset ℕ) (hs : ∀ p ∈ s, p.Prime) : goldbachSieveRootCount u (∏ p ∈ s, p) = ∏ p ∈ s, goldbachSieveRootCount u p := by …Mentions: OAI.Problem337.goldbachSieveRootCount
- theorem
OAI.Problem337.goldbachSieveRootCount_squarefreeline 93Source documentation
Exact squarefree local factor for the binary Goldbach sieve.
theorem goldbachSieveRootCount_squarefree (u d : ℕ) (hd : Squarefree d) : goldbachSieveRootCount u d = ∏ p ∈ d.primeFactors, if p ∣ u then 1 else 2 := by …Mentions: OAI.Problem337.goldbachSieveRootCount
- def
OAI.Problem337.goldbachSieveDensityline 109Source documentation
The exact finite local root density, normalized as an arithmetic function.
def goldbachSieveDensity (u : ℕ) : ArithmeticFunction ℝ where …
- theorem
OAI.Problem337.goldbachSieveDensity_applyline 113 - theorem
OAI.Problem337.goldbachSieveDensity_isMultiplicativeline 117Source documentation
The finite local density has exactly the multiplicativity required by a sieve.
theorem goldbachSieveDensity_isMultiplicative (u : ℕ) : (goldbachSieveDensity u).IsMultiplicative := by …Mentions: OAI.Problem337.goldbachSieveDensity
- theorem
OAI.Problem337.goldbachSieveDensity_primeline 126Source documentation
The local density at a prime is
1/por2/p.theorem goldbachSieveDensity_prime (u p : ℕ) (hp : p.Prime) : goldbachSieveDensity u p = if p ∣ u then 1 / (p : ℝ) else 2 / (p : ℝ) := by …Mentions: OAI.Problem337.goldbachSieveDensity
- theorem
OAI.Problem337.goldbachSieveDensity_prime_posline 132Source documentation
All prime local root densities are positive.
theorem goldbachSieveDensity_prime_pos (u p : ℕ) (hp : p.Prime) : 0 < goldbachSieveDensity u p := by …Mentions: OAI.Problem337.goldbachSieveDensity
- theorem
OAI.Problem337.goldbachSieveDensity_prime_lt_oneline 139Source documentation
At odd primes the sieve is nondegenerate. At two, this requires an even target.
theorem goldbachSieveDensity_prime_lt_one (u p : ℕ) (hp : p.Prime) (hparity : p = 2 → 2 ∣ u) : goldbachSieveDensity u p < 1 := by …Mentions: OAI.Problem337.goldbachSieveDensity