theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.kClean_signedError_sq_le_nonzeroMode_c2 {ι : Type u_1} {κ k ℓ j : ℕ} (hk : 1 ≤ k) (hℓ : 1 ≤ ℓ) (hj : 1 ≤ j) (A : ℕ) {T : ι → ℝ} {N : ι → Finset ℕ} {β : ι → ℕ → ℝ} (hSW : BetaCoprimeSWFamily κ T N β) (hT : ∀ (i : ι), 1 ≤ T i) (hN : ∀ (i : ι), ∀ n ∈ N i, T i ≤ ↑n ∧ ↑n ≤ 2 * T i) (hβ : ∀ (i : ι), ∀ n ∈ N i, |β i n| ≤ ↑((fouvryTau k) n)) {ε : ℝ} (hε : 0 < ε) : ∀ᶠ (x : ℝ) in Filter.atTop, ∀ (i : ι) (M L : ℝ), 1 ≤ M → 1 ≤ L → 4 * M * T i = x → x ^ ε ≤ T i → T i ≤ x ^ (1 / 9) → L ≤ x ^ (5 / 9) → ∀ (S Q : Finset ℕ), (∀ m ∈ S, M ≤ ↑m ∧ ↑m ≤ 2 * M) → Q ⊆ Finset.Ioc 0 ⌊L⌋₊ → ∀ (α c : ℕ → ℝ), (∀ m ∈ S, |α m| ≤ ↑((fouvryTau ℓ) m)) → (∀ q ∈ Q, |c q| ≤ ↑((fouvryTau j) q)) → ∀ (a : ℤ), signedError S (N i) Q α (β i) c a ^ 2 ≤ (∑ m ∈ S, α m ^ 2) * smoothWNonzeroMode M (N i) Q (β i) c a + x ^ 2 / Real.log x ^ A

Full zero-mode payment at the unchanged physical scale and higher endpoint.

theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.kClean_signedError_sq_le_clean_nonzeroMode_c2 {ι : Type u_1} {κ k i j : ℕ} (A : ℕ) {T : ι → ℝ} {N : ι → Finset ℕ} {β : ι → ℕ → ℝ} (hSW : BetaCoprimeSWFamily κ T N β) (hT : ∀ (z : ι), 1 ≤ T z) (hN : ∀ (z : ι), ∀ n ∈ N z, T z ≤ ↑n ∧ ↑n ≤ 2 * T z) (hβ : ∀ (z : ι), ∀ n ∈ N z, |β z n| ≤ ↑((fouvryTau k) n)) {Cscale ε : ℝ} (hC : 1 ≤ Cscale) (hε : 0 < ε) : ∀ᶠ (x : ℝ) in Filter.atTop, ∀ (z : ι) (M L : ℝ), 1 ≤ M → 1 ≤ L → 4 * M * T z = x → x ^ ε ≤ T z → T z ≤ x ^ (1 / 9) → L ≤ x ^ (5 / 9) → ∀ (S Q : Finset ℕ), (∀ m ∈ S, M ≤ ↑m ∧ ↑m ≤ 2 * M) → Q ⊆ Finset.Ioc 0 ⌊L⌋₊ → ∀ (α c : ℕ → ℝ), (∀ m ∈ S, |α m| ≤ ↑((fouvryTau i) m)) → (∀ q ∈ Q, |c q| ≤ ↑((fouvryTau j) q)) → ∀ (a : ℤ), a ≠ 0 → |↑a| ≤ Cscale * x → signedError S (N z) Q α (β z) c a ^ 2 ≤ (2 * ∑ m ∈ S, α m ^ 2) * smoothWNonzeroMode M (N z) Q (betaClean (β z) a) c a + x ^ 2 / Real.log x ^ A

Uniform clean reduction for a fixed shift multiple; no deletion term remains.