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

Ultimately periodic witnesses in finite parity graphs

Lax369799.PeriodicPaths · concepts/Lax369799/PeriodicPaths.lean · lax-369799

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

    Every infinite path in a finite graph has an ultimately periodic path with the same initial vertex and least recurring priority. This supplies the periodic witness for checking a finite-state parity branch condition.

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

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.WordParity
    2
    3/-!
    4---
    5title: Ultimately periodic witnesses in finite parity graphs
    6type: theorem
    7---
    8Every infinite path in a finite graph has an ultimately periodic path
    9with the same initial vertex and least recurring priority. This supplies
    10the periodic witness for checking a finite-state parity branch condition.
    11-/
    12namespace Lax369799.PeriodicPaths
    13
    14def UltimatelyPeriodic {Q : Type} (r : ℕ → Q) : Prop :=
    15 ∃ N p, 0 < p ∧ ∀ n, N ≤ n → r (n + p) = r n
    16
    17axiom periodic_witness {Q : Type} [Finite Q] (R : Q → Q → Prop)
    18 (priority : Q → ℕ) (r : ℕ → Q) (hr : ∀ n, R (r n) (r (n + 1)))
    19 (c : ℕ) (hc : WordParity.LeastRecurring (fun n => priority (r n)) c) :
    20 ∃ s : ℕ → Q, s 0 = r 0 ∧ (∀ n, R (s n) (s (n + 1))) ∧
    21 UltimatelyPeriodic s ∧ WordParity.LeastRecurring (fun n => priority (s n)) c
    22
    23axiom periodic_test {Q : Type} [Finite Q] (R : Q → Q → Prop)
    24 (priority : Q → ℕ) (q : Q) :
    25 (∀ r : ℕ → Q, r 0 = q → (∀ n, R (r n) (r (n + 1))) → UltimatelyPeriodic r →
    26 ∃ c, Even c ∧ WordParity.LeastRecurring (fun n => priority (r n)) c) ↔
    27 (∀ r : ℕ → Q, r 0 = q → (∀ n, R (r n) (r (n + 1))) →
    28 ∃ c, Even c ∧ WordParity.LeastRecurring (fun n => priority (r n)) c)
    29
    30end Lax369799.PeriodicPaths
    31
    Show ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…