sojournTime_nonneg

Proved

by wenxinzhang · Jul 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

Supporting subproblem for the deterministic continuous-time Little's Law decomposition graph: sojournTime_nonneg.

Formal statement

import Definitions.Def_queueing_continuous_time

open Filter
open scoped BigOperators Interval Topology
open QueueingLib.LittlesLaw.ContinuousTime

/-- Sojourn times are nonnegative. -/
theorem sojournTime_nonneg (q : ContinuousSamplePath) (n : Nat) :
    0 ≤ sojournTime q n := by
  sorry

/-! ## Finite-area comparison lemmas -/

Source

QueueingLib deterministic continuous-time Little's Law project. Root theorem: general_littles_law, theorem_id 81236938-cf7e-49ad-a078-be9ba5432532.

View graph