theorem MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11LinkedBoundingSieve_rem_eq_common (N : ℕ) (hEven : Even N) (ε Z : ℝ) {d : ℕ} (hd : d ∣ goldbachB10ProdPrimes N Z) : BoundingSieve.rem d = goldbachG11CommonDivisorResidual N ε d

theorem MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11Linked_upperErrSum_le (N : ℕ) (hEven : Even N) (ε Z : ℝ) (D Q : ℕ) (hDQ : D ≤ Q + 1) : have S := goldbachG11LinkedBoundingSieve N hEven ε Z (goldbachG11PrimeWindowMainMass N ε); have P := goldbachB10ProdPrimes N Z; LinearSieve.upperErrSum S D (LinearSieve.upperRosserWeight P D) ≤ ∑ d ∈ goldbachG11LinkedModuli N Q, |goldbachG11CommonDivisorResidual N ε d|

True Rosser divisors embed into the proved squarefree coprime carrier, including d=1. No full-modulus removal of the squarefree condition is used.

theorem MathlibNt.SieveTheory.LiLiuOnePlusOneNine.GoldbachBig.goldbachG11GoodTotal_le_paidRosser (A ρ : ℝ) (hA : 0 < A) (hρ : 0 < ρ) : ∃ (B : ℝ) (C : ℝ) (z₀ : ℝ), 0 < B ∧ 0 < C ∧ ∃ (N₀ : ℕ), 4 ≤ N₀ ∧ ∀ N ≥ N₀, ∀ (hEven : Even N) (ε Z Δ s : ℝ), z₀ ≤ Z → 2 ≤ Z → 0 < Δ → s = Real.log Δ / Real.log Z → 3 / 2 ≤ s → s ≤ 4 → Δ ≤ √↑N / Real.log ↑N ^ B → have X := goldbachG11PrimeWindowMainMass N ε; have S := goldbachG11LinkedBoundingSieve N hEven ε Z X; ↑(goldbachG11GoodSwitchedTotal N ε (↑N ^ (4 / 53)) (↑N ^ (4 / 33))) ≤ 400 * X * (SwitchingPrinciple.jurkatRichertUpperLinearSieveFactor s + ρ) * AnalyticNumberTheory.Sieve.sieveProductPrimeFactors S + 400 * C * ↑N / Real.log ↑N ^ A + 8000 * ↑⌈Z⌉₊

The original good G11 count with its genuine common prime-window mass, proved Rosser factor and paid distribution error. Main-mass normalization and small-output asymptotic absorption are deliberately not claimed here.