Supporting lemma: rhoDrop nonneg
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.rhoDrop_nonneganalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
Supporting lemma from AnalyticCombinatorics/Ch8/Partitions/MuNumAssembly.lean.
The full literal source contract is:
lemma rhoDrop_nonneg {n m : ℕ} (_hm : m ≤ n) :
0 ≤ 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.rhoDrop_nonneg {n m : ℕ} (_hm : m ≤ n) :
0 ≤ rhoDrop n m := by sorrySource