Banach indicatrix, hard half:
ProvedExcursionCoupling.lintegral_levelSet_count_le_eVariationOnLet be finite Borel measures on and . For ,
where counts the generalized solutions of , i.e. the points with in the completed graph.
This is the substantial half of the generalized Banach indicatrix identity: it says the level counts cannot integrate to more than the variation. The standard route is Banach's: for the uniform subdivision of into cells let be the number of cells whose two endpoint values straddle . Then exactly, increases under refinement, and for almost every one has : once the mesh is finer than the minimal gap between two solutions they fall into distinct cells, and for almost every level every solution is genuinely crossed rather than merely touched (the levels of local extrema form a countable set). Monotone convergence then gives the bound.
Together with the reverse inequality this yields eq. (6) of Juillet 2019.
Formalization note. Both sides may be a priori; the statement is in the extended nonnegative reals. The counts use Set.encard coerced into .
import Definitions.Def_excursion_coupling open MeasureTheory Set Function Filter Topology
namespace ExcursionCoupling
theorem lintegral_levelSet_count_le_eVariationOn
(μ ν : Measure ℝ) [IsFiniteMeasure μ] [IsFiniteMeasure ν] (s t : ℝ) (_hst : s ≤ t) :
(∫⁻ h : ℝ, ((Ioc s t ∩ levelSet (Fsigma μ ν) h).encard.toENNReal))
≤ eVariationOn (Fsigma μ ν) (Icc s t) := by sorry
end ExcursionCoupling