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

Evaluation and variable renaming in regular-tree algebras

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

    Renaming the variables of a system depends only on its algebra value. This follows by flattening a renamed atomic outer system and applies also to noninjective variable maps.

    Concept map
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.Renaming
    2
    3/-!
    4---
    5title: Evaluation and variable renaming in regular-tree algebras
    6type: theorem
    7---
    8Renaming the variables of a system depends only on its algebra value.
    9This follows by flattening a renamed atomic outer system and applies
    10also to noninjective variable maps.
    11-/
    12namespace Lax369799.SystemEvaluation
    13open RankedSystems Algebras Renaming Flattening
    14
    15/-- Replace the hole symbol by a letter of its rank. -/
    16def fillLetter {A : RankedSet} {k : ℕ} (a : A k) : RankedMap (WithHole A k) A :=
    17 fun _ b => match b with
    18 | .inl b => b
    19 | .inr ⟨h⟩ => h ▸ a
    20
    21def substituteSystem {A : RankedSet} {k : ℕ} (S : System A k) :
    22 RankedMap (WithHole A k) (System A) :=
    23 fun _ b => match b with
    24 | .inl b => atomicSystem b
    25 | .inr ⟨h⟩ => h ▸ S
    26
    27axiom context_evaluation {A : RankedSet} (E : Algebra A) {k n : ℕ}
    28 (C : SetContext A k n) (hC : C.system.Deterministic) (S : System A k) :
    29 ∃ U : System A n, U.val = plug C S.val ∧
    30 E.eval n U = E.eval n (relabelSystem (fillLetter (E.eval k S)) ⟨C.system, hC⟩)
    31
    32axiom rename_evaluation {A : RankedSet} (E : Algebra A) (hE : UnfoldInvariant E)
    33 {m n : ℕ} (σ : Fin m → Fin n) (S : System A m) :
    34 E.eval n (renameSystem σ S) =
    35 E.eval n (renameSystem σ (atomicSystem (E.eval m S)))
    36
    37axiom rename_congruence {A : RankedSet} (E : Algebra A) (hE : UnfoldInvariant E)
    38 {m n : ℕ} (σ : Fin m → Fin n) (S T : System A m) (h : E.eval m S = E.eval m T) :
    39 E.eval n (renameSystem σ S) = E.eval n (renameSystem σ T)
    40
    41end Lax369799.SystemEvaluation
    42
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…