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

Evaluation after compressing parallel tuples

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

    Taking the meet of each block in a parallel tuple has the same evaluation as renaming all ports in that block to one output. This is the local substitution identity used to compress a duplicated run in Lemma 108.

    Concept map
    65 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyClone-automataBounded profiles refine finite contextualequivalenceCompressed transitions and their cloneclosureContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsUnary normal form of deterministic elementsDeterministic 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 presentationsFinite meets in a set-algebraAutomaton 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 presentationsEventual membership in finite familiesFinite 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-resolutionsEvaluation after compressing parallel tuplesSubstitution 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 bisimulationVariable exits of unary systemsUnfold-automata and regular-tree acceptanceCompression 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.PortReindexing
    2import Lax369799.CloneTransitions
    3import Lax369799.DeterministicElements
    4
    5/-!
    6---
    7title: Evaluation after compressing parallel tuples
    8type: theorem
    9---
    10Taking the meet of each block in a parallel tuple has the same evaluation
    11as renaming all ports in that block to one output. This is the local
    12substitution identity used to compress a duplicated run in Lemma 108.
    13-/
    14namespace Lax369799.ParallelCompression
    15open RankedSystems (RankedSet)
    16open FinitePresentations SetSystemAlgebras CloneTransitions PortReindexing
    17variable {A : RankedSet} {n k : ℕ} (b : Fin (n * k) → A 1)
    18
    19axiom evaluation (E : SetAlgebra A) :
    20 E.eval n (ofSetSystem (DeterministicElements.parallel (compress E b))) =
    21 E.eval n (rename (ofSetSystem (DeterministicElements.parallel b)) (fun i => i.divNat))
    22
    23end Lax369799.ParallelCompression
    24
    Show Proof

    Discussion

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

    Loading discussion…