Supporting lemma: sigmaMoment nonneg
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.sigmaMoment_nonneganalytic-combinatoricslean4partitions-remaindersmooth-driftsupporting-lemma
sigmaMoment r t ≥ 0 for t > 0 (all summands are nonnegative).
The full literal source contract is:
lemma sigmaMoment_nonneg (r : ℕ) (t : ℝ) (ht : 0 < t) : 0 ≤ sigmaMoment r t
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 Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # MuNum two-term expansion `|muNum n − (μ̄ + μA/√n)| ≤ K/n` for large `n`, where `μ̄ = 3/massLam` and `μA = 3/(2·massLam²)`. -/ set_option maxHeartbeats 4000000 open Filter Finset open scoped Topology BigOperators open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos /-! ### Algebraic expansion of the model product -/ /-! ### Model sum expressed via sigma moments (infinite-sum identity) -/ /-! ### Small lemmas -/
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.sigmaMoment_nonneg (r : ℕ) (t : ℝ) (ht : 0 < t) : 0 ≤ sigmaMoment r t := by sorry
Source