Source lean/Determinize/Proof/Primitives/Moments.lean
import Determinize.Proof.Primitives.Kernels/-!# First moments of the primitive laws`PrimitiveMomentBounds laws` bounds the first absolute moment linearly in the affine-positionparameters, with a bound that may depend on the general-position parameters.`primitiveMomentBounds_primitiveLaws` proves this for the canonical primitive kernels.`Proof/Symbolic/Moments.lean` uses it to integrate affine forms along a sample history.-/namespace Determinize.Proof.Paperopen MeasureTheory ProbabilityTheory Determinize.Spec.Papernoncomputable section/-- First absolute moments grow at most linearly in the affine parameters. -/def PrimitiveMomentBounds (laws : PrimitiveLaws) : Prop :=  ∀ op general, ∃ bound : ℝ, 0 ≤ bound ∧    ∀ affine, InDomain op (affine, general) →      (∫ value : ℝ, |value| ∂laws.kernel op (affine, general)) ≤        bound * (1 + ∑ i, |affine i|)theorem ae_nonneg_gammaMeasure (shape rate : ℝ) :    ∀ᵐ value ∂gammaMeasure shape rate, 0 ≤ value := by  rw [ae_iff]  simp only [not_le]  change gammaMeasure shape rate (Set.Iio 0) = 0  rw [gammaMeasure, withDensity_apply _ measurableSet_Iio]  exact lintegral_gammaPDF_of_nonpos le_rfltheorem ae_nonneg_poissonMeasure (rate : NNReal) :    ∀ᵐ value ∂(poissonMeasure rate).map (fun n : Nat ↦ (n : ℝ)), 0 ≤ value := by  exact ae_map_iff (by fun_prop) measurableSet_Ici |>.2 (ae_of_all _ fun _ ↦ Nat.cast_nonneg _)theorem ae_abs_le_uniformMeasure (lower upper : ℝ) (ordered : lower ≤ upper) :    ∀ᵐ value ∂uniformMeasure lower upper, |value| ≤ |lower| + |upper| := by  unfold uniformMeasure  rw [dite_eq_left ordered]  split  · rename_i point    simp only [ae_dirac_eq, Filter.eventually_pure]    exact le_add_of_nonneg_right (abs_nonneg _)  · apply Measure.ae_smul_measure    filter_upwards [ae_restrict_mem measurableSet_Icc] with value member    exact abs_le.mpr ⟨by linarith [neg_abs_le lower, abs_nonneg upper, member.1],      by linarith [le_abs_self upper, abs_nonneg lower, member.2]⟩theorem integral_abs_gaussianReal_le (mean : ℝ) (variance : NNReal) :    (∫ value : ℝ, |value| ∂gaussianReal mean variance) ≤      (∫ value : ℝ, |value| ∂gaussianReal 0 variance) + |mean| := by  have shift : (gaussianReal 0 variance).map (fun x ↦ x + mean) =      gaussianReal mean variance := by    simpa using gaussianReal_map_add_const (μ := 0) (v := variance) mean  rw [← shift, integral_map (by fun_prop) (by fun_prop)]  have integrable : Integrable (fun x : ℝ ↦ x) (gaussianReal 0 variance) := IsGaussian.integrable_id  calc    _ ≤ ∫ value : ℝ, |value| + |mean| ∂gaussianReal 0 variance := by      apply integral_mono      · exact (integrable.add (integrable_const mean)).abs      · exact integrable.abs.add (integrable_const _)      · exact fun value ↦ abs_add_le value mean    _ = _ := by rw [integral_add integrable.abs (integrable_const _), integral_const]; simptheorem primitiveMomentBounds_primitiveLaws : PrimitiveMomentBounds primitiveLaws := by  intro op general  have nonnegMoment (affine) : 0 ≤ ∫ x : ℝ, |x| ∂primitiveLaws.kernel op (affine, general) :=    integral_nonneg fun _ ↦ abs_nonneg _  cases op with  | exponential =>    let affine : Fin (affineArity .exponential) → ℝ := Fin.elim0    refine ⟨(∫ x : ℝ, |x| ∂primitiveLaws.kernel .exponential (affine, general)),      nonnegMoment affine, ?_⟩    intro actual _    have eq : actual = affine := by funext i; exact Fin.elim0 i    rw [eq]    simp  | beta =>    let affine : Fin (affineArity .beta) → ℝ := Fin.elim0    refine ⟨(∫ x : ℝ, |x| ∂primitiveLaws.kernel .beta (affine, general)), nonnegMoment affine, ?_⟩    intro actual _    have eq : actual = affine := by funext i; exact Fin.elim0 i    rw [eq]    simp  | uniform =>    refine ⟨1, zero_le_one, ?_⟩    intro affine valid    have mass := primitiveLaws.mass_one .uniform (affine, general) valid    let : IsProbabilityMeasure (primitiveLaws.kernel .uniform (affine, general)) := ⟨mass⟩    have bound : ∀ᵐ value ∂primitiveLaws.kernel .uniform (affine, general),        |value| ≤ |affine 0| + |affine 1| := by      rw [primitiveLaws.kernel_eq_paperMeasure]      exact ae_abs_le_uniformMeasure _ _ valid    have inequality := integral_mono_ae      (primitiveLaws.integrable_id .uniform (affine, general) valid).abs      (integrable_const _) bound    simp only [integral_const, probReal_univ, one_smul] at inequality    have sumEq : (∑ i, |affine i|) = |affine 0| + |affine 1| := by      change (∑ i : Fin 2, |affine i|) = _      exact Fin.sum_univ_two _    rw [sumEq, one_mul]    linarith  | gaussian =>    let variance : NNReal := ⟨max (general 0) 0, le_max_right _ _⟩    let c := ∫ value : ℝ, |value| ∂gaussianReal 0 variance    have hc : 0 ≤ c := integral_nonneg fun _ ↦ abs_nonneg _    refine ⟨c + 1, by positivity, ?_⟩    intro affine valid    have hv : 0 ≤ general 0 := valid    have eq : variance = ⟨general 0, hv⟩ := by      apply Subtype.ext      exact max_eq_left hv    rw [primitiveLaws.kernel_eq_paperMeasure, paperMeasure, dite_eq_left hv, ← eq]    have bound := integral_abs_gaussianReal_le (affine 0) variance    change _ ≤ (c + 1) * (1 + ∑ i : Fin 1, |affine i|)    rw [Fin.sum_univ_one]    dsimp only [c] at hc ⊢    change _ ≤ (∫ value : ℝ, |value| ∂gaussianReal 0 variance + 1) * (1 + |affine 0|)    nlinarith [abs_nonneg (affine 0)]  | poisson =>    refine ⟨1, zero_le_one, ?_⟩    intro affine valid    have nonnegative : ∀ᵐ value ∂primitiveLaws.kernel .poisson (affine, general), 0 ≤ value := by      rw [primitiveLaws.kernel_eq_paperMeasure]      change ∀ᵐ value ∂(if h : 0 ≤ affine 0 then        (poissonMeasure ⟨affine 0, h⟩).map (fun n : Nat ↦ (n : ℝ)) else 0), 0 ≤ value      rw [dite_eq_left (show 0 ≤ affine 0 from valid)]      exact ae_nonneg_poissonMeasure _    have meanEq : meanValue .poisson (affine, general) = affine 0 := rfl    have sumEq : (∑ i, |affine i|) = |affine 0| := Fin.sum_univ_one _    rw [integral_congr_ae (nonnegative.mono fun value h ↦ abs_of_nonneg h),      primitiveLaws.mean_law .poisson (affine, general) valid, meanEq, sumEq, one_mul]    linarith [le_abs_self (affine 0)]  | gamma =>    refine ⟨|1 / general 0| + 1, by positivity, ?_⟩    intro affine valid    have nonnegative : ∀ᵐ value ∂primitiveLaws.kernel .gamma (affine, general), 0 ≤ value := by      rw [primitiveLaws.kernel_eq_paperMeasure]      change ∀ᵐ value ∂(if 0 < affine 0 ∧ 0 < general 0 then        gammaMeasure (affine 0) (general 0) else 0), 0 ≤ value      rw [ite_eq_left (show 0 < affine 0 ∧ 0 < general 0 from valid)]      exact ae_nonneg_gammaMeasure _ _    rw [integral_congr_ae (nonnegative.mono fun value h ↦ abs_of_nonneg h),      primitiveLaws.mean_law .gamma (affine, general) valid]    rw [meanValue_eq_affine]    change (0 + ∑ i : Fin 1, 1 / general 0 * affine i) ≤      (|1 / general 0| + 1) * (1 + ∑ i : Fin 1, |affine i|)    simp only [Fin.sum_univ_one, zero_add]    have bound : 1 / general 0 * affine 0 ≤        |1 / general 0| * |affine 0| := by      rw [← abs_mul]      exact le_abs_self _    change 1 / general 0 * affine 0 ≤      (|1 / general 0| + 1) * (1 + |affine 0|)    nlinarith [abs_nonneg (1 / general 0), abs_nonneg (affine 0)]  | bernoulli =>    refine ⟨1, zero_le_one, ?_⟩    intro affine valid    rw [primitiveLaws.kernel_eq_paperMeasure]    change (∫ x : ℝ, |x| ∂bernoulliFiber (.sample .G) (affine 0)) ≤      1 * (1 + ∑ i : Fin 1, |affine i|)    rw [DiscreteLaws.integral_bernoulliFiber (affine 0) valid]    simp only [abs_zero, abs_one, mul_zero, mul_one, zero_add, one_mul,      Fin.sum_univ_one]    linarith [le_abs_self (affine 0)]  | discrete n =>    refine ⟨n, Nat.cast_nonneg _, ?_⟩    intro affine valid    simp only [InDomain] at valid    rw [primitiveLaws.kernel_eq_paperMeasure, paperMeasure, ite_eq_left valid]    change (∫ x : ℝ, |x| ∂DiscreteLaws.remainderMeasure n affine) ≤ _    rw [DiscreteLaws.integral_remainderMeasure n affine valid]    simp only [Nat.abs_cast]    have bound : (∑ i : Fin n, affine i * (i : ℕ)) +        (1 - ∑ i, affine i) * (n : ℝ) ≤ n := by      have term : ∑ i : Fin n, affine i * (i : ℕ) ≤ (∑ i, affine i) * (n : ℝ) := by        rw [Finset.sum_mul]        exact Finset.sum_le_sum fun i _ ↦          mul_le_mul_of_nonneg_left (by exact_mod_cast Nat.le_of_lt i.isLt) (valid.1 i)      nlinarith    have positive : 0 ≤ ∑ i : Fin n, |affine i| := Finset.sum_nonneg fun _ _ ↦ abs_nonneg _    nlinarith [Nat.cast_nonneg (α := ℝ) n]endend Determinize.Proof.Paper