The model-product tail past the n^(2/3) cutoff
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.model_rhoDropModel_tail_leanalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
The model-product tail past the n^(2/3) cutoff.
The full literal source contract is:
theorem model_rhoDropModel_tail_le :
∃ K : ℝ, 0 < K ∧ ∀ᶠ n : ℕ in atTop,
(∑' m : ℕ,
if m ≤ ⌊(n : ℝ) ^ (2 / 3 : ℝ)⌋₊ then (0 : ℝ)
else |modelSummand n m * rhoDropModel n m|)
≤ K / (n : ℝ)
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_tail_le :
∃ K : ℝ, 0 < K ∧ ∀ᶠ n : ℕ in atTop,
(∑' m : ℕ,
if m ≤ ⌊(n : ℝ) ^ (2 / 3 : ℝ)⌋₊ then (0 : ℝ)
else |modelSummand n m * rhoDropModel n m|)
≤ K / (n : ℝ) := by sorrySource