Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.4, p. 783 — At(n−)≤Atn/n!A_t^{(n-)}\le A_t^n/n!At(n−)​≤Atn​/n!

Proved
AntonelliBFSDE.Backward.iterIntMinus_le_pow_div_factorial

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

lebesgue-stieltjesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a:[0,∞)→Ra:[0,\infty)\to\mathbb Ra:[0,∞)→R be nondecreasing and right-continuous with a0=0a_0=0a0​=0, and let a(n−)a^{(n-)}a(n−) be its iterated Lebesgue–Stieltjes integral with left limits, a(0−)=1a^{(0-)}=1a(0−)=1, at((n+1)−)=∫(0,t]as−(n−) dasa^{((n+1)-)}_t=\int_{(0,t]}a^{(n-)}_{s-}\,da_sat((n+1)−)​=∫(0,t]​as−(n−)​das​. Then for every n≥0n\ge0n≥0 and t≥0t\ge0t≥0,

at(n−)≤at nn!.a_t^{(n-)}\le\frac{a_t^{\,n}}{n!}.at(n−)​≤n!atn​​.

Equality holds when aaa is continuous; jumps only decrease the left side.

Applied to the integrator AAA with AT≤βA_T\le\betaAT​≤β, this turns (2.8) into the bound knβn/n!k^n\beta^n/n!knβn/n!.

Formalization Note Stated for a deterministic path, as it is used pathwise.

Preamble
import Mathlib
import Definitions.Def_AntonelliBFSDE_Backward_Setting
import Definitions.Def_AntonelliBFSDE_Backward_Equation

open MeasureTheory Filter Topology
open scoped NNReal ENNReal
Formal statement
namespace AntonelliBFSDE.Backward

/-- Proof of Theorem 2.4, p. 783: for a nondecreasing right-continuous path `a` with `a(0) = 0`,
`a_t^{(n-)} ≤ a_t^n / n!` for every `n` and every `t`. -/
theorem iterIntMinus_le_pow_div_factorial (a : ℝ≥0 → ℝ) (ha_mono : Monotone a)
    (ha_rc : ∀ t, ContinuousWithinAt a (Set.Ici t) t) (ha_zero : a 0 = 0)
    (n : ℕ) (t : ℝ≥0) :
    iterIntMinus a n t ≤ a t ^ n / (n.factorial : ℝ) := by sorry

end AntonelliBFSDE.Backward
Source
Antonelli, Backward-forward stochastic differential equations, Ann. Appl. Probab. 3(3) (1993), p. 783, proof of Theorem 2.4
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me