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

Substitution after reindexing directions

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

    Reindexing the directions of an outer system and renaming the ports of its substituted pieces give the same flattened graph. Evaluation is therefore unchanged. All vertices and marks are retained.

    Concept map
    57 concepts; 1 descendant hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsReindexing the outgoing directions at eachvertexContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsAutomaton property of the unprunedsyntactic algebraContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderContext decomposition without pruningExtremal unary data for finite presentationsMorphisms of unpruned finite presentationsUnary normal forms without pruningOrdered syntactic algebras of finitepresentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded optimal flatten-resolutionsSubstitution after reindexing directionsLocally surjective maps of finitepresentationsResolution values of finite presentationsTransfer of resolutions through boundedprofilesRanked sets, set-systems, and systemsRenaming variables in systems andresolutionsCompression of the variables offlatten-resolutionsFinite families of split-variable resolutionsResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceSet-algebras with retained verticesSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasRanked encodings of transition systemsFinite transition systems and bisimulationCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.DirectionReindexing
    2import Lax369799.SetSystemAlgebras
    3
    4/-!
    5---
    6title: Substitution after reindexing directions
    7type: theorem
    8---
    9Reindexing the directions of an outer system and renaming the ports of
    10its substituted pieces give the same flattened graph. Evaluation is
    11therefore unchanged. All vertices and marks are retained.
    12-/
    13namespace Lax369799.PortReindexing
    14open RankedSystems (RankedSet System)
    15open TransitionEncoding FinitePresentations SetSystemAlgebras DirectionReindexing
    16
    17def rename {Y : RankedSet} {m n : ℕ} (P : FiniteSystem Y m) (σ : Fin m → Fin n) :
    18 FiniteSystem Y n where
    19 size := P.size
    20 graph := {
    21 label := P.graph.label
    22 initial := P.graph.initial
    23 root := P.graph.root
    24 edge := fun v d t => match t with
    25 | .inl w => P.graph.edge v d (.inl w)
    26 | .inr i => ∃ j, σ j = i ∧ P.graph.edge v d (.inr j)
    27 direction_valid := by
    28 intro v d t h
    29 cases t with
    30 | inl w => exact P.graph.direction_valid _ _ _ h
    31 | inr i => obtain ⟨j, _, hj⟩ := h; exact P.graph.direction_valid _ _ _ hj }
    32
    33
    34axiom evaluation {P : Type} {Y : RankedSet} (S : System (TransitionAlphabet P) 0)
    35 (R : Reindexing S) (B : ∀ v : S.val.Vertex, FiniteSystem Y (R.arity v)) (E : SetAlgebra Y) :
    36 E.eval 0 (withLabels (ofSetSystem S.val) (fun v => E.eval _ (rename (B v) (R.map v)))) =
    37 E.eval 0 (withLabels (ofSetSystem (DirectionReindexing.system S R).val)
    38 (fun v => E.eval _ (B v)))
    39
    40end Lax369799.PortReindexing
    41
    Show Proof

    Discussion

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

    Loading discussion…