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

Planting finite presentations

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

    Planting moves initial vertices to roots. Since acceptance checks both initial and root yields, planting preserves acceptance.

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

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

    1 accepting_evaluation_plant proven

    2 accepting_plant proven

    Lean source view on GitHub

    1import Lax369799.FiniteAcceptance
    2
    3/-!
    4---
    5title: Planting finite presentations
    6type: theorem
    7---
    8Planting moves initial vertices to roots. Since acceptance checks both
    9initial and root yields, planting preserves acceptance.
    10-/
    11namespace Lax369799.FinitePlant
    12open RankedSystems (RankedSet)
    13open FinitePresentations FiniteAcceptance
    14
    15axiom accepting_plant {A : RankedSet} (L : Algebras.Language A) (S : FiniteSystem A 0) :
    16 Accepting L (plant S) ↔ Accepting L S
    17
    18axiom flatten_plant {A : RankedSet} {n : ℕ} (S : FiniteSystem (FiniteSystem A) n) :
    19 Isomorphic (flatten (plant S)) (plant (flatten S))
    20
    21axiom accepting_evaluation_plant {A : RankedSet} (L : Algebras.Language A)
    22 (E : FiniteSyntacticAlgebra.Algebra (FiniteContextualOrder.Carrier (Accepting L)))
    23 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    24 E.eval n (relabel (FiniteContextualOrder.quotientMap (Accepting L)) S) =
    25 FiniteContextualOrder.quotientMap (Accepting L) n (flatten S))
    26 (P : FiniteSystem (FiniteContextualOrder.Carrier (Accepting L)) 0) :
    27 FiniteSyntacticAlgebra.AcceptingClass (Accepting L) (E.eval 0 (plant P)) ↔
    28 FiniteSyntacticAlgebra.AcceptingClass (Accepting L) (E.eval 0 P)
    29
    30end Lax369799.FinitePlant
    31
    Show ProofShow ProofShow 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…