LeanMachineLearning

ProbabilityTheory.HasSubexponentialMGF.trim🔗

Lemma

No docstring.

Types
  • Ω : Type u_1m : MeasurableSpace ΩA measurable space is a space equipped with a σ-algebra.mΩ : MeasurableSpace Ω
Given
  • μ : MeasureTheory.Measure ΩA measure is defined to be an outer measure that is countably additive on measurable sets, with the additional assumption that the outer measure is the canonical extension of the restricted measure.
  • X : Ω →
  • V :
  • b :
Assuming
Then
HasSubexponentialMGF X V b (μ.trim hm)
Code
lemma trim (hm : m ≤ mΩ) (hXm : Measurable[m] X) (hX : HasSubexponentialMGF X V b μ) :
    HasSubexponentialMGF X V b (μ.trim hm) where
  integrable_exp_mul t ht
Proof
by
    refine (hX.integrable_exp_mul t ht).trim hm ?_
    exact Measurable.stronglyMeasurable <| by fun_prop
  mgf_le t ht := by
    rw [mgf, ← integral_trim]
    · exact hX.mgf_le t ht
    · exact Measurable.stronglyMeasurable <| by fun_prop

Meaning last changed in v4.34.0-rc2-76-g565f652 (2026-09-10).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Audit surface: 1 project declarations, 56 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.