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

Unfolding congruence for deterministic substitution

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

    Substituting pointwise unfold-equivalent inner systems preserves unfolding. A morphism between deterministic outer systems also induces an unfolding relation between their flattenings. Inner roots are absent, so outer unreachable vertices cannot introduce additional root observations.

    Concept map
    6 concepts; 2 descendants hidden
    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.

    Lean source view on GitHub

    1import Lax369799.PolynomialContexts
    2
    3/-!
    4---
    5title: Unfolding congruence for deterministic substitution
    6type: theorem
    7---
    8Substituting pointwise unfold-equivalent inner systems preserves unfolding.
    9A morphism between deterministic outer systems also induces an unfolding
    10relation between their flattenings. Inner roots are absent, so outer
    11unreachable vertices cannot introduce additional root observations.
    12-/
    13namespace Lax369799.SystemSubstitution
    14open RankedSystems Morphisms Flattening PolynomialContexts
    15
    16axiom pointwise_unfold {A C : RankedSet} {n : ℕ} (P : System C n)
    17 (q r : ∀ v, System A (P.val.graph.label v).1)
    18 (h : ∀ v, UnfoldEquivalent (q v).val (r v).val)
    19 (U V : System A n) (hU : SystemFlattening (withLabels P q) U)
    20 (hV : SystemFlattening (withLabels P r) V) : UnfoldEquivalent U.val V.val
    21
    22axiom outer_morphism {A : RankedSet} {n : ℕ} (S T : System (System A) n)
    23 (f : Morphism S.val T.val) (U V : System A n)
    24 (hU : SystemFlattening S U) (hV : SystemFlattening T V) : UnfoldsTo V.val U.val
    25
    26axiom evaluation {A B C : RankedSet} (E : Algebras.Algebra B) (η : RankedMap A B)
    27 (f : RankedMap C (System A)) {n : ℕ} (S : System C n) (U : System A n)
    28 (hU : SystemFlattening (relabelSystem f S) U) :
    29 E.eval n (relabelSystem η U) = E.eval n
    30 (relabelSystem (fun k a => E.eval k (relabelSystem η (f k a))) S)
    31
    32end Lax369799.SystemSubstitution
    33
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…