ProbabilityTheory.HasSubexponentialMGF.sub_of_indepFun
Lemma
No docstring.
Types
-
Ω : Type u_1mΩ : MeasurableSpace ΩA measurable space is a space equipped with a σ-algebra.
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 : Ω → ℝ -
b : ℝ -
Y : Ω → ℝ -
VX : ℝ -
VY : ℝ
Assuming
-
hX : HasSubexponentialMGF X VX b μXhas a sub-exponential moment generating function with parameters(V, b): for everytwithb * |t| ≤ 1,exp (t * X)is integrable andmgf X μ t ≤ exp (V * t ^ 2 / 2). -
hY : HasSubexponentialMGF Y VY b μ -
hindep : IndepFun X Y μTwo functions are independent if the two measurable space structures they generate are independent.
Then
HasSubexponentialMGF (fun ω => X ω - Y ω) (VX + VY) b μMeasurableSpace : Type u_6 → Type u_6A measurable space is a space equipped with a σ-algebra.
MeasureTheory.Measure : (α : Type u_5) → [MeasurableSpace α] → Type u_5A 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. The measure of a set `s`, denoted `μ s`, is an extended nonnegative real. The real-valued version is written `μ.real s`.
Real : TypeThe type `ℝ` of real numbers constructed as equivalence classes of Cauchy sequences of rational numbers.
ProbabilityTheory.HasSubexponentialMGF : {Ω : Type u_1} →
{mΩ : MeasurableSpace Ω} →
(Ω → ℝ) → ℝ → ℝ → autoParam (MeasureTheory.Measure Ω) ProbabilityTheory.HasSubexponentialMGF._auto_1 → Prop`X` has a sub-exponential moment generating function with parameters `(V, b)`: for every `t` with `b * |t| ≤ 1`, `exp (t * X)` is integrable and `mgf X μ t ≤ exp (V * t ^ 2 / 2)`. For `b = 0` this is `HasSubgaussianMGF X V μ`. This is equivalent to `Kernel.HasSubexponentialMGF X V b (Kernel.const Unit μ) (Measure.dirac ())`, as proved in `hasSubexponentialMGF_iff_kernel`.Go to its page
ProbabilityTheory.IndepFun : {Ω : Type u_1} →
{β : Type u_6} →
{γ : Type u_7} →
{_mΩ : MeasurableSpace Ω} →
[MeasurableSpace β] →
[MeasurableSpace γ] →
(Ω → β) → (Ω → γ) → autoParam (MeasureTheory.Measure Ω) ProbabilityTheory.IndepFun._auto_1 → PropTwo functions are independent if the two measurable space structures they generate are independent. For a function `f` with codomain having measurable space structure `m`, the generated measurable space structure is `MeasurableSpace.comap f m`. We use the notation `f ⟂ᵢ[μ] g` for `IndepFun f g μ` (scoped in `ProbabilityTheory`).
HSub.hSub : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HSub α β γ] → α → β → γ`a - b` computes the difference of `a` and `b`. The meaning of this notation is type-dependent. * For natural numbers, this operator saturates at 0: `a - b = 0` when `a ≤ b`. Conventions for notations in identifiers: * The recommended spelling of `-` in identifiers is `sub` (when used as a binary operator).
HAdd.hAdd : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HAdd α β γ] → α → β → γ`a + b` computes the sum of `a` and `b`. The meaning of this notation is type-dependent. Conventions for notations in identifiers: * The recommended spelling of `+` in identifiers is `add`.
Code
lemma sub_of_indepFun {Y : Ω → ℝ} {VX VY : ℝ} (hX : HasSubexponentialMGF X VX b μ)
(hY : HasSubexponentialMGF Y VY b μ) (hindep : IndepFun X Y μ) :
HasSubexponentialMGF (fun ω ↦ X ω - Y ω) (VX + VY) b μProof
by simp_rw [sub_eq_add_neg] exact hX.add_of_indepFun hY.neg hindep.neg_right
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, 60 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.