Proof of Theorem 2.4, p. 780 —
ProvedAntonelliBFSDE.Backward.iterated_integral_relationintegration-by-partslebesgue-stieltjesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be nondecreasing and right-continuous with , and let , be its iterated Lebesgue–Stieltjes integrals (without and with left limits of the integrand). Then for every and every ,
For this is the integration by parts formula .
In the proof of Theorem 2.4 this identity is applied pathwise to the nondecreasing integrator (after the reduction "without loss of generality is increasing"); it is what makes the brackets vanish at .
Formalization Note The paper writes the relation "for all " with implicit; for the sum equals , so the statement is for . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.