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

Evaluation of finite path graphs

Lax369799.FinitePathEvaluation · concepts/Lax369799/FinitePathEvaluation.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

    The graph with one vertex for each unary letter and a final nullary vertex evaluates to the iterated unary action on the nullary value.

    Concept map
    8 concepts; 4 descendants hidden
    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 Lax369799.FiniteBranchWords
    2
    3/-!
    4---
    5title: Evaluation of finite path graphs
    6type: theorem
    7---
    8The graph with one vertex for each unary letter and a final nullary
    9vertex evaluates to the iterated unary action on the nullary value.
    10-/
    11namespace Lax369799.FinitePathEvaluation
    12open RankedSystems (RankedSet)
    13open FinitePresentations FiniteSyntacticAlgebra FiniteBranchWords
    14
    15def path {A : RankedSet} {k : ℕ} (w : Fin k → A 1) (a : A 0) : FiniteSystem A 0 where
    16 size := k + 1
    17 graph := {
    18 label := Fin.lastCases ⟨0, a⟩ (fun i => ⟨1, w i⟩)
    19 initial := {0}
    20 root := ∅
    21 edge := fun v d t => ∃ i : Fin k, v = i.castSucc ∧ d = 0 ∧ t = .inl i.succ
    22 direction_valid := by rintro v d t ⟨i, rfl, rfl, rfl⟩; simp }
    23
    24
    25axiom evaluation {A : RankedSet} (E : Algebra A) {k : ℕ}
    26 (w : Fin k → A 1) (a : A 0) :
    27 E.eval 0 (path w a) = value E (List.ofFn w) a
    28
    29end Lax369799.FinitePathEvaluation
    30
    Show Proof

    Discussion

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

    Loading discussion…