The numerator has the required two-term expansion
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.muNum_two_termanalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
The numerator has the required two-term expansion.
The full literal source contract is:
theorem muNum_two_term :
∃ K : ℝ, 0 < K ∧ ∀ᶠ n : ℕ in atTop,
|muNum n - (3 / massLam + (3 / (2 * massLam ^ 2)) / Real.sqrt (n : ℝ))|
≤ K / (n : ℝ)
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_MassRateMoments 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_two_term :
∃ K : ℝ, 0 < K ∧ ∀ᶠ n : ℕ in atTop,
|muNum n - (3 / massLam + (3 / (2 * massLam ^ 2)) / Real.sqrt (n : ℝ))|
≤ K / (n : ℝ) := by sorrySource