Documentation

MathlibNt.SieveTheory.LiLiuGoldbachG11OrdinaryGridPaid

Inspect dependencies

MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11OrdinaryDensityMain · compiled type and proof/definition references.

theorem MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11OrdinaryGrid_sifted_paid (A : ℕ) {δ θ ρ : ℝ} (hδ : 0 < δ) (hδu : δ < 1 / 2) (hθ : 0 < θ) (hθu : θ < 1 / 8) (hρ : 1 < ρ) (hρu : ρ ≤ 5 / 4) :
∃ (N₀ : ℕ), 4 ≤ N₀ ∧ ∀ (N : ℕ), N₀ ≤ N → ∀ (ε : ℝ), ∀ S ⊆ goldbachG11GridUsed N ε ρ, ∀ (P : ℕ × ℕ → Finset ℕ) (z : ℕ × ℕ → ℝ), (∀ k ∈ S, ∀ p ∈ P k, Nat.Prime p) → (∀ k ∈ S, ∀ p ∈ P k, p.Coprime N) → (∀ k ∈ S, ∀ p ∈ P k, ↑p < z k) → ∑ k ∈ S, goldbachG11AllPrimeSiftedMass N (goldbachG11GridLong N ε ρ k) (goldbachG11GridShort N ρ k) (P k) ≤ goldbachG11OrdinaryDensityMain N ε ρ δ θ S P z + ↑N / Real.log ↑N ^ A

Fully paid ordinary sifted counts on any subset of occupied cells. The threshold precedes epsilon, the cell subset and all changing sieve data.

Inspect dependencies

MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11OrdinaryGrid_sifted_paid · compiled type and proof/definition references.

theorem MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11OrdinaryGrid_prime_outputs_paid (A : ℕ) {δ θ ρ : ℝ} (hδ : 0 < δ) (hδu : δ < 1 / 2) (hθ : 0 < θ) (hθu : θ < 1 / 8) (hρ : 1 < ρ) (hρu : ρ ≤ 5 / 4) :
∃ (N₀ : ℕ), 4 ≤ N₀ ∧ ∀ (N : ℕ), N₀ ≤ N → ∀ (ε : ℝ), ∀ S ⊆ goldbachG11GridUsed N ε ρ, ∀ (z : ℝ), 0 ≤ z → z ≤ √↑N → ∑ k ∈ S, goldbachG11RectanglePrimeMass N (goldbachG11GridLong N ε ρ k) (goldbachG11GridShort N ρ k) ≤ (goldbachG11OrdinaryDensityMain N ε ρ δ θ S (fun (x : ℕ × ℕ) => fouvryG9SievePrimes N z) fun (x : ℕ × ℕ) => z) + 2 * ↑N / Real.log ↑N ^ A

Only the sifted part is enlarged to all primes. The original already-paid small-output budget is retained, so no new all-prime fibre estimate is needed.

Inspect dependencies

MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11OrdinaryGrid_prime_outputs_paid · compiled type and proof/definition references.