Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 part ii, p. 187 — C_p(t, h) ≥ μ_p(h) ≥ μ_kl(h) for ν-a.a. t: (17) holds by construction

Proved
FrieszDUE.PIE.ess_inf_lower_bound_17

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 hhh be a density vector, and suppose that for every path ppp the cost Cp(⋅,h)C_p(\cdot,h)Cp​(⋅,h) is nonnegative on [0,T][0,T][0,T] and measurable. Then for every OD pair klklkl, every path p∈Pklp\in P_{kl}p∈Pkl​ and ν\nuν-almost all ttt,

Cp(t,h) ≥ μp(h) ≥ μkl(h),C_p(t,h)\ \ge\ \mu_p(h)\ \ge\ \mu_{kl}(h),Cp​(t,h) ≥ μp​(h) ≥ μkl​(h),

where μp(h)\mu_p(h)μp​(h) is the essential infimum (14) of Cp(⋅,h)C_p(\cdot,h)Cp​(⋅,h) on [0,T][0,T][0,T] and μkl(h)\mu_{kl}(h)μkl​(h) is the minimum (15) over PklP_{kl}Pkl​.

With h=h∗h=h^*h=h∗ and μkl∗=μkl(h∗)\mu^*_{kl}=\mu_{kl}(h^*)μkl∗​=μkl​(h∗), this says that the pair (h∗,μ∗)(h^*,\mu^*)(h∗,μ∗) satisfies condition (17) of Definition 3 by construction.

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

open MeasureTheory

/-- Proof of Theorem 2 part ii, p. 187: (17) holds by construction for `μ_kl(h)`. -/
theorem ess_inf_lower_bound_17 {P W : Type*}
    (T : ℝ) (hT : 0 < T) (od : P → W) (C : P → ℝ → (P → ℝ → ℝ) → ℝ)
    (h : P → ℝ → ℝ)
    (hC_nonneg : ∀ p, ∀ t ∈ Set.Icc 0 T, 0 ≤ C p t h)
    (hC_meas : ∀ p, AEMeasurable (fun t => C p t h) (ν T)) (p : P) :
    ∀ᵐ t ∂(ν T), muPath T C h p ≤ C p t h ∧ muOD T od C h (od p) ≤ muPath T C h p := 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. 187, proof of Theorem 2 part ii, display after the definition of μ*, with (12), (14), (15), (17)
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