Supporting lemma: model rhoDropModel tsum split
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.model_rhoDropModel_tsum_splitanalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
Supporting lemma from AnalyticCombinatorics/Ch8/Partitions/MuNumAssembly.lean.
The full literal source contract is:
lemma model_rhoDropModel_tsum_split (n M : ℕ) (hn : 1 ≤ n) :
(∑' m : ℕ, if m = 0 then (0 : ℝ) else modelSummand n m * rhoDropModel n m)
= (∑ m ∈ Finset.Icc 1 M, modelSummand n m * rhoDropModel n m)
+ (∑' m : ℕ,
if m ≤ M then (0 : ℝ)
else if m = 0 then (0 : ℝ) else modelSummand n m * rhoDropModel n m)
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_MuNumModel import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_SigmaRecurrence import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_UpperBound import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_ErdosKernel import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_MassRateMoments import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_MassRateApprox2 import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Assembly of the two-term expansion for `muNum` This file only assembles the banked estimates: * the infinite model two-term expansion, * the two main-range errors, * the weighted Erdős far tail, * and a local model-product tail. -/ open Filter Finset open scoped Topology BigOperators open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.model_rhoDropModel_tsum_split (n M : ℕ) (hn : 1 ≤ n) :
(∑' m : ℕ, if m = 0 then (0 : ℝ) else modelSummand n m * rhoDropModel n m)
= (∑ m ∈ Finset.Icc 1 M, modelSummand n m * rhoDropModel n m)
+ (∑' m : ℕ,
if m ≤ M then (0 : ℝ)
else if m = 0 then (0 : ℝ) else modelSummand n m * rhoDropModel n m) := by sorrySource