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

Early and late direct paths

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

    On the three-vertex chain and its shortcut triangle, each traversal takes c units, where c is zero or one. In the triangle, direct departures at 0 and 3 both minimize hops, elapsed time and waiting for either traversal cost. Of these two paths, only the early one is foremost and only the late one is latest-departing.

    Read the proof.

    Concept map
    8 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.CostExamples
    2
    3/-!
    4---
    5title: Early and late direct paths
    6type: lemma
    7---
    8On the three-vertex chain and its shortcut triangle, each traversal takes c units, where c is zero or one. In the triangle, direct departures at 0 and 3 both minimize hops, elapsed time and waiting for either traversal cost. Of these two paths, only the early one is foremost and only the late one is latest-departing.
    9
    10[Read the proof.](Lax330177Proofs.CostExamples.direct_choices.html)
    11-/
    12namespace Lax330177.DirectChoices
    13open Lax330177.Representations Lax330177.Durations Lax330177.OptimalPaths
    14open Lax330177.CostExamples
    15
    16axiom direct_choices (c : Fin 2) :
    17 Shortest (direct false c) ∧ Fastest (direct false c) ∧ MinimumWaiting (direct false c) ∧
    18 Foremost (direct false c) ∧ ¬ LatestDeparture (direct false c) ∧
    19 Shortest (direct true c) ∧ Fastest (direct true c) ∧ MinimumWaiting (direct true c) ∧
    20 LatestDeparture (direct true c) ∧ ¬ Foremost (direct true c)
    21end Lax330177.DirectChoices
    22
    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…