OAI/NumberTheory/TwoPoint/Bounds/PrimeSubsetSplitting.lean
5 declarations, 0 contain sorry, 0 declared as axioms
The subset reindexing gives exactly the numerical rough support: disjoint prime subsets are equivalent to coprime squarefree products.
- lemma
OAI.TwoPointCorrelations.primeSubset_products_coprimeline 15 - lemma
OAI.TwoPointCorrelations.retainedPrimeDivisors_avoidingline 33 - lemma
OAI.TwoPointCorrelations.nonrawRoughSupport_of_primeSubsetline 59 - lemma
OAI.TwoPointCorrelations.primeSubset_core_retainedline 71 - theorem
OAI.TwoPointCorrelations.nonraw_subset_sumline 82Source documentation
The removed-subset sum is exactly the numerical rough-support sum, including its reciprocal coefficient and the prime-factor exponent.
theorem nonraw_subset_sum (U T : Finset ℕ) (hU : ∀ p ∈ U, Nat.Prime p) (hT : ∀ p ∈ T, Nat.Prime p) (H τ : ℝ) (θ : ℂ) (F : ℕ → ℂ) : (∑ W ∈ (T \ U).powerset, if 1 < (∏ p ∈ W, p) ∧ H < (((∏ p ∈ U, p) * (∏ p ∈ W, p) : ℕ) : ℝ) ∧ (((∏ p ∈ U, p) * (∏ p ∈ W, p) : ℕ) : ℝ) ≤ τ * H then ((-θ) ^ W.card / ((∏ p ∈ W, p : ℕ) : ℂ)) * F (∏ p ∈ W, p) else 0) = ∑ w ∈ nonrawRoughSupport T H τ (∏ p ∈ U, p), ((-θ) ^ w.primeFactors.card / (w : ℂ)) * F w := by …