While this submission is a draft, it cannot be used by other submissions.

Elapsed time splits into travel and waiting

Lax330177.ElapsedEq · concepts/Lax330177/ElapsedEq.lean · lax-330177

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    If every available traversal takes c time units, every feasible path has elapsed time equal to its total internal waiting time plus c times its number of hops.

    Read the proof.

    Concept map
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 3 of this submission's paper

    Lean source view on GitHub

    1import Lax330177.UniformCosts
    2
    3/-!
    4---
    5title: Elapsed time splits into travel and waiting
    6type: theorem
    7---
    8If every available traversal takes c time units, every feasible path has elapsed time equal to its total internal waiting time plus c times its number of hops.
    9
    10[Read the proof.](Lax330177Proofs.UniformCosts.elapsed_eq.html)
    11-/
    12namespace Lax330177.ElapsedEq
    13open Lax330177.Representations Lax330177.OptimalPaths
    14open Lax330177.UniformCosts
    15variable {n : ℕ} {G : Graph n} {q : Query G}
    16
    17axiom elapsed_eq (p : Candidate q) (c : ℕ) (h : Uniform q c) :
    18 p.elapsed = p.waiting + p.hops * c
    19end Lax330177.ElapsedEq
    20
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…