Theorems · Theorem · number theory
BoundingSieve.nu_inv_eq_sum_divisors_inv_selbergTerms
∀ {s : BoundingSieve} {d : ℕ},
d ∣ s.prodPrimes → (s.nu d)⁻¹ = ∑ l ∈ s.prodPrimes.divisors, if l ∣ d then (BoundingSieve.selbergTerms l)⁻¹ else 0- Defined in
- Mathlib.NumberTheory.SelbergSieve
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 108 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Realstatement and proof · cited by 25,697
- Finsetproof · cited by 13,712
- Finset.sumstatement and proof · cited by 5,195
- ne_of_gtproof · cited by 637
- ArithmeticFunctionstatement · cited by 290
- Nat.divisorsstatement · cited by 137
- Finset.sum_filterproof · cited by 37
- BoundingSievestatement and proof · cited by 30
- ne_zero_of_dvd_ne_zeroproof · cited by 26
- BoundingSieve.prodPrimesstatement and proof · cited by 18
- BoundingSieve.nustatement and proof · cited by 17
Cited by2
Results whose statement or proof uses this declaration.
- BoundingSieve.sum_divisors_selbergTerms_eq_selbergTerms_mul_nu_invproof · cited by 0
- BoundingSieve.mainSum_lambdaSquared_eq_sum_mul_sum_sqproof · cited by 0