(47), p. 188 — for a route q attaining μ_kl(h*), T_q(ε) = {t: C_q(t, h*) < μ*_kl + ε} has positive measure
ProvedFrieszDUE.PIE.near_min_set_pos_measure_47essential-infimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1user-equilibrium
In the setting of the PIE model, let , let be a density vector whose costs are nonnegative on and measurable, and write . Let be a route with . Then for every the set
has positive measure.
This is the defining property of the essential infimum (12) applied to the cheapest route ; 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.