Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

departedSojourn_le_queueArea

Proved

by wenxinzhang · Jul 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

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

Formal statement
import Definitions.Def_queueing_continuous_time

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

/--
The total full sojourn of jobs departed by `t` is bounded above by the area
under the queue-length path through `t`.
-/
theorem departedSojourn_le_queueArea
    (q : ContinuousSamplePath) (t : ℝ) (ht : 0 ≤ t) :
    (∑ n ∈ departedBy q t, sojournTime q n) ≤
      ∫ s in (0 : ℝ)..t, (queueLength q s : ℝ) := by
  -- Depends on:
  -- * `mem_departedBy`
  -- * `intervalIntegrable_queueLength`
  -- * `sojournTime_nonneg`
  sorry
Source
QueueingLib deterministic continuous-time Little's Law project. Root theorem: general_littles_law, theorem_id 81236938-cf7e-49ad-a078-be9ba5432532.

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me