Proof of Theorem 2 part ii, p. 187 — C_p(t, h) ≥ μ_p(h) ≥ μ_kl(h) for ν-a.a. t: (17) holds by construction
ProvedFrieszDUE.PIE.ess_inf_lower_bound_17essential-infimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1user-equilibrium
In the setting of the PIE model, let , let be a density vector, and suppose that for every path the cost is nonnegative on and measurable. Then for every OD pair , every path and -almost all ,
where is the essential infimum (14) of on and is the minimum (15) over .
With and , this says that the pair 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.