Supporting lemma: muNum split main tail
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.muNum_split_main_tailanalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
Supporting lemma from AnalyticCombinatorics/Ch8/Partitions/MuNumAssembly.lean.
The full literal source contract is:
lemma muNum_split_main_tail (n M : ℕ) (hMle : M ≤ n - 1) :
muNum n =
(∑ m ∈ Finset.Icc 1 M, erdosWeight n m * rhoDrop n m)
+ (∑ m ∈ Finset.Icc (M + 1) (n - 1), erdosWeight n m * rhoDrop n m)
Preamble
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_MuTilde 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.muNum_split_main_tail (n M : ℕ) (hMle : M ≤ n - 1) :
muNum n =
(∑ m ∈ Finset.Icc 1 M, erdosWeight n m * rhoDrop n m)
+ (∑ m ∈ Finset.Icc (M + 1) (n - 1), erdosWeight n m * rhoDrop n m) := by sorrySource