let f : ℕ → ℕ → ℝ := fun x z : ℕ => if n = x.lcm z then 1 else 0
s : SelbergSieve
n : ℕ
hn : n ∈ P.divisors
⊢ |s.selbergMuPlus n| ≤ 3 ^ ω n
s : SelbergSieve
n : ℕ
hn : n ∈ P.divisors
f : ℕ → ℕ → ℝ := fun x z => if n = x.lcm z then 1 else 0
⊢ |s.selbergMuPlus n| ≤ 3 ^ ω n