Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.4, p. 780 — ∑i=0n(−1)iAt((n−i)−)At(i)=0\sum_{i=0}^n(-1)^iA_t^{((n-i)-)}A_t^{(i)}=0∑i=0n​(−1)iAt((n−i)−)​At(i)​=0

Proved
AntonelliBFSDE.Backward.iterated_integral_relation

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

integration-by-partslebesgue-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), a(n−)a^{(n-)}a(n−) be its iterated Lebesgue–Stieltjes integrals (without and with left limits of the integrand). Then for every n≥1n\ge1n≥1 and every t≥0t\ge0t≥0,

∑i=0n(−1)i at((n−i)−) at(i)=0.\sum_{i=0}^n(-1)^i\,a_t^{((n-i)-)}\,a_t^{(i)}=0 .i=0∑n​(−1)iat((n−i)−)​at(i)​=0.

For n=2n=2n=2 this is the integration by parts formula at2=(a⋅a)t+(a−⋅a)ta_t^2=(a\cdot a)_t+(a_-\cdot a)_tat2​=(a⋅a)t​+(a−​⋅a)t​.

In the proof of Theorem 2.4 this identity is applied pathwise to the nondecreasing integrator AAA (after the reduction "without loss of generality AAA is increasing"); it is what makes the brackets (Au−At)[n](A_u-A_t)^{[n]}(Au​−At​)[n] vanish at u=tu=tu=t.

Formalization Note The paper writes the relation "for all t∈[0,T]t\in[0,T]t∈[0,T]" with nnn implicit; for n=0n=0n=0 the sum equals 111, so the statement is for n≥1n\ge1n≥1. It is stated for a deterministic path, which is how it is used.

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. 780: for a nondecreasing right-continuous path `a` with `a(0) = 0`,
the iterated integrals `a^{(n)}` and `a^{(n-)}` satisfy
`∑_{i=0}^n (-1)^i a_t^{((n-i)-)} a_t^{(i)} = 0` for every `n ≥ 1` and every `t`. -/
theorem iterated_integral_relation (a : ℝ≥0 → ℝ) (ha_mono : Monotone a)
    (ha_rc : ∀ t, ContinuousWithinAt a (Set.Ici t) t) (ha_zero : a 0 = 0)
    (n : ℕ) (hn : 1 ≤ n) (t : ℝ≥0) :
    ∑ i ∈ Finset.range (n + 1), (-1 : ℝ) ^ i * iterIntMinus a (n - i) t * iterInt a i t = 0 := by sorry

end AntonelliBFSDE.Backward
Source
Antonelli, Backward-forward stochastic differential equations, Ann. Appl. Probab. 3(3) (1993), p. 780, proof of Theorem 2.4 (notation paragraph)
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