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

Unit and associativity for deterministic substitution

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

    Root-free deterministic substitution obeys the two unit laws and associativity up to presentation isomorphism. Flattening also preserves isomorphisms of the outer system.

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

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

    2 flatten_isomorphic proven

    Lean source view on GitHub

    1import Lax369799.PolynomialContexts
    2
    3/-!
    4---
    5title: Unit and associativity for deterministic substitution
    6type: theorem
    7---
    8Root-free deterministic substitution obeys the two unit laws and
    9associativity up to presentation isomorphism. Flattening also preserves
    10isomorphisms of the outer system.
    11-/
    12
    13namespace Lax369799.SystemMonad
    14open RankedSystems Morphisms
    15
    16axiom outer_unit {A : RankedSet} {n : ℕ} (S : System A n) (U : System A n)
    17 (hU : Flattening.SystemFlattening (atomicSystem S) U) : Isomorphic U.val S.val
    18
    19axiom inner_unit {A : RankedSet} {n : ℕ} (S : System A n) (U : System A n)
    20 (hU : Flattening.SystemFlattening (relabelSystem (fun _ a => atomicSystem a) S) U) :
    21 Isomorphic U.val S.val
    22
    23axiom associative {A : RankedSet} {n : ℕ} (P : System (System (System A)) n)
    24 (Q : System (System A) n) (U : System A n)
    25 (t : ∀ v : P.val.Vertex, System A (P.val.graph.label v).1) (W : System A n)
    26 (hQ : Flattening.SystemFlattening P Q)
    27 (hU : Flattening.SystemFlattening Q U)
    28 (ht : ∀ v, Flattening.SystemFlattening (P.val.graph.label v).2 (t v))
    29 (hW : Flattening.SystemFlattening (PolynomialContexts.withLabels P t) W) :
    30 Isomorphic U.val W.val
    31
    32axiom flatten_isomorphic {A : RankedSet} {n : ℕ}
    33 (P Q : System (System A) n) (U W : System A n)
    34 (hP : Flattening.SystemFlattening P U) (hQ : Flattening.SystemFlattening Q W)
    35 (h : Isomorphic P.val Q.val) : Isomorphic U.val W.val
    36
    37end Lax369799.SystemMonad
    38
    Show ProofShow 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…