Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy 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 0df444a (Lean v4.33.1)

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

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me