(3.24), p. 13 — ∫_C G(x, dy)(∫_C ω_ε(y, z)v₀(z)K(y, dz) + ∫_{Cᶜ} ω̃_ε(y, z)|f(z)|K(y, dz)) < ∞
ProvedLyapDiffMC.RandomHorizon.eq_3_24Throughout, is a measurable state space, a family of Markov transition kernels on indexed by an open interval , measurable, and measurable. The non-negative kernel restricted to is , its powers are (), (possibly an infinite measure), , and . Write and .
Let , and let be measurable in for , with continuously differentiable on for and every , with derivative . Put ( for ) and . Let be finite, non-negative, measurable functions on satisfying the Lyapunov bound
Then for every ,
Together with the pointwise bounds (3.22)–(3.23), this is the integrable majorant for the dominated-convergence argument that proves differentiability of at .
Formalization Note The Lyapunov inequalities are written additively in (), which is equivalent because are finite; and are -valued. is the derivative within , the ordinary derivative at interior points. One serves A2, A3 and the Lyapunov conditions, as in the paper's proof. The family is given for all real ; only matters.
Differences from the source:
- generalization: the hypotheses of Theorem 3.1 are in force → only (3.12), A2 (k(·, x, y) C¹ on [θ₀ − ε, θ₀ + ε]), measurability of k(θ, ·, ·) on that interval and measurable v₀, v₁ ≥ 0 on C; reason: (3.24) follows from (3.12) and Proposition 3.1 (p. 13); A2 and the measurability of k make ω_ε measurable; under the theorem's hypotheses (with [θ₀ − ε, θ₀ + ε] ⊆ Λ) the statement specializes to the paper's
- encoding: separate ε's in A2, A3 and the theorem → one ε; reason: the proof takes the smallest of them (p. 12); shrinking ε keeps every hypothesis true, since ω_ε and r̃_ε only decrease
- encoding: (K v)(x) ≤ v(x) − (non-negative terms) in (3.11), (3.12), (3.12′) → (K v)(x) + (the terms) ≤ v(x) in ℝ≥0∞; reason: every term lies in [0, ∞] and v(x) is finite, so the two forms are equivalent
- encoding: v₀, v₁ finite-valued non-negative functions on C → v₀ v₁ : S → ℝ, non-negative on C; reason: values off C never enter the statement; same instances
- encoding: ω_ε(x, y) = sup{|k′(θ, x, y)| : |θ − θ₀| < ε}, ω̃_ε, r̃_ε → ℝ≥0∞-valued iSup (omega) and lintegral (rtilde); reason: the supremum may be +∞; a real supremum would return 0 on an unbounded set
- encoding: k′(θ, x, y), the derivative of k(·, x, y) on [θ₀ − ε, θ₀ + ε] → kder = derivWithin on Icc (θ₀ − ε) (θ₀ + ε); reason: the ordinary derivative at interior points (in particular at θ₀), the one-sided one at the endpoints, as A2's 'in [θ₀ − ε, θ₀ + ε]'
- encoding: measurability of v₀, v₁ left implicit → Measurable v₀, Measurable v₁; reason: (Kv)(x) is only defined for measurable v
import Mathlib import Definitions.Def_LyapDiffMC_RandomHorizon_Model open MeasureTheory ProbabilityTheory open scoped ENNReal
namespace LyapDiffMC.RandomHorizon
/-- (3.24), p. 13. The Lyapunov bound (3.12) together with Proposition 3.1 gives
`∫_C G(x, dy)(∫_C ω_ε(y, z) v₀(z) K(y, dz) + ∫_{Cᶜ} ω̃_ε(y, z)|f(z)| K(y, dz)) < ∞` for `x ∈ C`. -/
theorem eq_3_24 {S : Type*} [MeasurableSpace S] (M : Setting S)
(θ₀ ε : ℝ) (hε : 0 < ε) (k : ℝ → S → S → ℝ)
(hk_meas : ∀ θ ∈ Set.Icc (θ₀ - ε) (θ₀ + ε), Measurable (Function.uncurry (k θ)))
(hA2 : ∀ x ∈ M.C, ∀ y, ContDiffOn ℝ 1 (fun θ => k θ x y) (Set.Icc (θ₀ - ε) (θ₀ + ε)))
(v₀ v₁ : S → ℝ) (hv₀ : Measurable v₀) (hv₁ : Measurable v₁)
(hv₀_nn : ∀ x ∈ M.C, 0 ≤ v₀ x) (hv₁_nn : ∀ x ∈ M.C, 0 ≤ v₁ x)
(h312 : ∀ x ∈ M.C,
∫⁻ y in M.C, ENNReal.ofReal (v₁ y) ∂(discKernel M θ₀ x)
+ ∫⁻ y in M.C, omega k θ₀ ε x y * ENNReal.ofReal (v₀ y) ∂(discKernel M θ₀ x)
+ rtilde M k θ₀ ε x ≤ ENNReal.ofReal (v₁ x)) :
∀ x ∈ M.C,
∫⁻ y, (∫⁻ z in M.C, omega k θ₀ ε y z * ENNReal.ofReal (v₀ z) ∂(discKernel M θ₀ y)
+ ∫⁻ z in M.Cᶜ, omega k θ₀ ε y z * ‖M.f z‖ₑ ∂(discKernel M θ₀ y))
∂(greenMeasure M θ₀ x) < ⊤ := by sorry
end LyapDiffMC.RandomHorizon
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.