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

Feasible departure times

Lax330177.UniformModes · concepts/Lax330177/UniformModes.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

    Lemma

    For integer timestamps, a departure sequence is feasible with traversal time zero exactly when it is weakly increasing. With traversal time one, it is feasible exactly when it is strictly increasing.

    Read the proof.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax330177.Durations
    2
    3/-!
    4---
    5title: Feasible departure times
    6type: lemma
    7---
    8For integer timestamps, a departure sequence is feasible with traversal time zero exactly when it is weakly increasing. With traversal time one, it is feasible exactly when it is strictly increasing.
    9
    10[Read the proof.](Lax330177Proofs.Basic.uniform_modes.html)
    11-/
    12namespace Lax330177.UniformModes
    13open Lax330177.Representations
    14open Lax330177.Paths
    15open Lax330177.Durations
    16
    17axiom uniform_modes {k} (t : Fin k → ℕ) (m : TraversalMode) : Feasible t (fun _ => if m = .strict then 1 else 0) ↔ ∀ i j, i < j → TimeLE m (t i) (t j)
    18end Lax330177.UniformModes
    19
    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…