Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(47), p. 188 — for a route q attaining μ_kl(h*), T_q(ε) = {t: C_q(t, h*) < μ*_kl + ε} has positive measure

Proved
FrieszDUE.PIE.near_min_set_pos_measure_47

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

essential-infimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1user-equilibrium

In the setting of the PIE model, let T>0T>0T>0, let h∗h^*h∗ be a density vector whose costs Cp(⋅,h∗)C_p(\cdot,h^*)Cp​(⋅,h∗) are nonnegative on [0,T][0,T][0,T] and measurable, and write μkl∗=μkl(h∗)\mu^*_{kl}=\mu_{kl}(h^*)μkl∗​=μkl​(h∗). Let q∈Pklq\in P_{kl}q∈Pkl​ be a route with μq(h∗)=μkl(h∗)\mu_q(h^*)=\mu_{kl}(h^*)μq​(h∗)=μkl​(h∗). Then for every ε>0\varepsilon>0ε>0 the set

Tq(ε)={t∈[0,T]:Cq(t,h∗)<μkl∗+ε}(47)T_q(\varepsilon)=\{t\in[0,T]: C_q(t,h^*)<\mu^*_{kl}+\varepsilon\}\qquad(47)Tq​(ε)={t∈[0,T]:Cq​(t,h∗)<μkl∗​+ε}(47)

has positive measure.

This is the defining property of the essential infimum (12) applied to the cheapest route qqq; it supplies the set onto which flow is shifted in the sufficiency half of Theorem 2.

Preamble
import Mathlib
import Definitions.Def_FrieszDUE_PIE_Setting
Formal statement
namespace FrieszDUE.PIE

open MeasureTheory

/-- Proof of Theorem 2 part ii, (47), p. 188. -/
theorem near_min_set_pos_measure_47 {P W : Type*}
    (T : ℝ) (hT : 0 < T) (od : P → W) (C : P → ℝ → (P → ℝ → ℝ) → ℝ)
    (hs : P → ℝ → ℝ)
    (hC_nonneg : ∀ p, ∀ t ∈ Set.Icc 0 T, 0 ≤ C p t hs)
    (hC_meas : ∀ p, AEMeasurable (fun t => C p t hs) (ν T))
    (q : P) (hq : muPath T C hs q = muOD T od C hs (od q)) (ε : ℝ) (hε : 0 < ε) :
    0 < ν T {t | C q t hs < muOD T od C hs (od q) + ε} := by sorry

end FrieszDUE.PIE
Source
Friesz, Bernstein, Smith, Tobin and Wie, A variational inequality formulation of the dynamic network user equilibrium problem, Oper. Res. 41 (1993), p. 188, proof of Theorem 2 part ii, (47), with (12) and (14)
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