Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (8) - signed indicatrix identity for increments of FσF_\sigmaFσ​

Proved
ExcursionCoupling.cdf_difference_eq_signed_indicatrix_integral

by ykanoria · Aug 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

bounded-variationoptimal-transportreal-analysis

Let μ,ν\mu,\nuμ,ν be finite Borel measures on R\mathbf{R}R and Fσ=Fμ−FνF_\sigma = F_\mu-F_\nuFσ​=Fμ​−Fν​. For all s≤ts\le ts≤t,

Fσ(t)−Fσ(s)  =  ∫R(i]s,t]∗,+(h)−i]s,t]∗,−(h)) dh,F_\sigma(t) - F_\sigma(s) \;=\; \int_{\mathbf{R}} \bigl(i^{*,+}_{]s,t]}(h) - i^{*,-}_{]s,t]}(h)\bigr)\,dh,Fσ​(t)−Fσ​(s)=∫R​(i]s,t]∗,+​(h)−i]s,t]∗,−​(h))dh,

where i]s,t]∗,±(h)i^{*,\pm}_{]s,t]}(h)i]s,t]∗,±​(h) count the increasing and decreasing points (x,h)(x,h)(x,h) of the completed graph of FσF_\sigmaFσ​ with x∈ ]s,t]x\in\,]s,t]x∈]s,t]. Together with eqs. (6)-(7) this identifies the positive and negative variations of FσF_\sigmaFσ​ as the level integrals of i∗,+i^{*,+}i∗,+ and i∗,−i^{*,-}i∗,−, which is how the marginals μ\muμ and ν\nuν are recovered from crossing counts in Proposition 3.3.

Formalization Note The two lower integrals are extended-real valued and finite (each is bounded by the total variation); the statement takes their real values via ENNReal.toReal.

Preamble
import Definitions.Def_excursion_coupling
open MeasureTheory Set Function
Formal statement
namespace ExcursionCoupling

theorem cdf_difference_eq_signed_indicatrix_integral
    (μ ν : Measure ℝ) [IsFiniteMeasure μ] [IsFiniteMeasure ν] (s t : ℝ) (_hst : s ≤ t) :
    Fsigma μ ν t - Fsigma μ ν s
      = (∫⁻ h : ℝ, ({x ∈ Ioc s t | (x, h) ∈ posPoints (Fsigma μ ν)}.encard.toENNReal)).toReal
        - (∫⁻ h : ℝ,
            ({x ∈ Ioc s t | (x, h) ∈ negPoints (Fsigma μ ν)}.encard.toENNReal)).toReal := by sorry

end ExcursionCoupling
Source
Nicolas Juillet, On a solution to the Monge transport problem on the real line arising from the strictly concave case, arXiv:1907.00681v1 (2019), https://arxiv.org/abs/1907.00681; eq. (8), p. 14
Read-back

What the Lean code literally says, in plain math · claude-fable-5

Setting. Let μ,ν\mu,\nuμ,ν be Borel measures on R\mathbb{R}R, each assumed finite (finite total mass), and let s,t∈Rs,t\in\mathbb{R}s,t∈R with the hypothesis s≤ts\le ts≤t.

Throughout, write

Fσ(x)=μ((−∞,x])−ν((−∞,x])F_\sigma(x)=\mu\big((-\infty,x]\big)-\nu\big((-\infty,x]\big)Fσ​(x)=μ((−∞,x])−ν((−∞,x])

(masses converted to reals by the total map sending ∞↦0\infty\mapsto 0∞↦0), Fσ−F_\sigma^-Fσ−​ for its left-limit function (junk value where no left limit exists), and completed graph for the set of (x,y)(x,y)(x,y) with yyy between Fσ−(x)F_\sigma^-(x)Fσ−​(x) and Fσ(x)F_\sigma(x)Fσ​(x) inclusive.

Conclusion. The theorem asserts the real-number identity

Fσ(t)−Fσ(s)  =  A−B,F_\sigma(t)-F_\sigma(s) \;=\; A - B,Fσ​(t)−Fσ​(s)=A−B,

where:

  • AAA is the real number obtained from the lower Lebesgue integral (over h∈Rh\in\mathbb{R}h∈R, Lebesgue measure)
∫R#{x∈(s,t]  :  (x,h) is an increasing point of the completed graph}  dh,\int_{\mathbb{R}}\#\big\{x\in(s,t] \;:\; (x,h)\text{ is an \textit{increasing} point of the completed graph}\big\}\;dh,∫R​#{x∈(s,t]:(x,h) is an increasing point of the completed graph}dh,

the cardinality counted in N∪{∞}\mathbb{N}\cup\{\infty\}N∪{∞}, viewed in [0,∞][0,\infty][0,∞], over the half-open interval (s,t](s,t](s,t]; here (x,h)(x,h)(x,h) is increasing when it is on the graph and, for some ε>0\varepsilon>0ε>0, every graph point (x′,h′)(x',h')(x′,h′) with x′≠xx'\neq xx′=x, ∣x′−x∣<ε|x'-x|<\varepsilon∣x′−x∣<ε has (h′−h)(x′−x)>0(h'-h)(x'-x)>0(h′−h)(x′−x)>0;

  • BBB is the analogous quantity for decreasing points, i.e. with (h′−h)(x′−x)<0(h'-h)(x'-x)<0(h′−h)(x′−x)<0.

Conventions and edge cases.

  • Each of A,BA,BA,B is produced by the total conversion [0,∞]→R[0,\infty]\to\mathbb{R}[0,∞]→R that sends ∞\infty∞ to the junk value 000: if either integral is infinite, the corresponding term of the right-hand side is 000.
  • No measurability of the integrands is hypothesized, and no claim is made that the integrals are finite.
Human review
  • Endorsed by Community (Bot) · Aug 6, 2026

  • Endorsed by ykanoria · Aug 6, 2026

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

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me