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

Isomorphisms of deterministic substitutions

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

    Isomorphisms between deterministic presentations, their reachable restrictions, and their flattenings. Output renaming commutes with flattening up to presentation isomorphism.

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

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

    Lean source view on GitHub

    1import Lax369799.SupportPorts
    2
    3/-!
    4---
    5title: Isomorphisms of deterministic substitutions
    6type: theorem
    7---
    8Isomorphisms between deterministic presentations, their reachable
    9restrictions, and their flattenings. Output renaming commutes with
    10flattening up to presentation isomorphism.
    11-/
    12
    13namespace Lax369799.SystemIsomorphisms
    14open RankedSystems Morphisms Renaming FinitePresentations
    15
    16axiom injective_isomorphic {A : RankedSet} {n : ℕ} (S T : System A n)
    17 (f : Morphism S.val T.val) (hf : Function.Injective f.toFun) : Isomorphic S.val T.val
    18
    19axiom iso_symm {A : RankedSet} {n : ℕ} {S T : SetSystem A n}
    20 (h : Isomorphic S T) : Isomorphic T S
    21
    22axiom iso_trans {A : RankedSet} {n : ℕ} {S T U : SetSystem A n}
    23 (hST : Isomorphic S T) (hTU : Isomorphic T U) : Isomorphic S U
    24
    25axiom trim_isomorphic {A : RankedSet} {n : ℕ} {V W : Type} [Fintype V] [Fintype W]
    26 {G : Presentation A n V} {H : Presentation A n W} (f : PresentationIso G H)
    27 (hG : (trim G).Deterministic) (hH : (trim H).Deterministic) :
    28 Isomorphic (trim G) (trim H)
    29
    30axiom flatten_output_rename {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    31 (P : System (System A) m) (U : System A m) (W : System A n)
    32 (hU : Flattening.SystemFlattening P U)
    33 (hW : Flattening.SystemFlattening (Renaming.renameSystem σ P) W) :
    34 Isomorphic (Renaming.renameSystem σ U).val W.val
    35
    36axiom flatten_from_trim {A : RankedSet} {n : ℕ} {V : Type} [Fintype V]
    37 (G : Presentation (System A) n V) (r : V) (hi : G.initial = {r}) (hr : G.root = ∅)
    38 (ht : ∀ v d, d < (G.label v).1 → ∃! t, G.edge v d t)
    39 (P : System (System A) n) (hP : P.val = trim G)
    40 (U : System A n) (hU : Flattening.SystemFlattening P U) :
    41 Isomorphic U.val (trim (SupportPorts.flattened G))
    42
    43end Lax369799.SystemIsomorphisms
    44
    Show ProofShow ProofShow 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…