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

Supported yields, contextual order, and substitution congruence

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

    Yields with explicit variable maps agree with the reachable presentation interface after unused outputs are compacted. The comparison preserves both initial and root yields. Yield inclusion is stable under contexts and simultaneous substitution, and reverses the yield-syntactic order.

    Concept map
    50 concepts
    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 deterministiccontextsPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsContexts over finite presentationsContextual preorders on finite presentationsMorphisms of unpruned finite presentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsVariable renaming and inverse renamingwithout pruningFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsComposition and pullbacks withoutreachability pruningContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded optimal flatten-resolutionsLocally 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 resolutionsLifting unfoldings through variable renamingResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceSelection and common unfoldings of fullysupported systemsSystems with all output variables reachableSupported yields, contextual order, andsubstitution congruenceYields with explicit variable maps and fullsupportSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Lean source view on GitHub

    1import Lax369799.SupportedYields
    2import Lax369799.FiniteYieldContinuity
    3
    4/-!
    5---
    6title: Supported yields, contextual order, and substitution congruence
    7type: theorem
    8---
    9Yields with explicit variable maps agree with the reachable presentation
    10interface after unused outputs are compacted. The comparison preserves
    11both initial and root yields. Yield inclusion is stable under contexts
    12and simultaneous substitution, and reverses the yield-syntactic order.
    13-/
    14
    15namespace Lax369799.SupportedYieldComparison
    16open RankedSystems FinitePresentations FiniteContexts
    17open SupportedMorphisms FiniteRenaming SupportedYields
    18
    19axiom initial_yield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n)
    20 (U : SupportedSystems.System A m) (σ : Fin m → Fin n) :
    21 InitialYield S U σ ↔ Morphisms.InitYield (trim S.graph) (Renaming.renameSystem σ U.val)
    22
    23axiom root_yield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n)
    24 (U : SupportedSystems.System A m) (σ : Fin m → Fin n) :
    25 RootYield S U σ ↔ Morphisms.InitYield (RankedSystems.uproot (trim S.graph)) (Renaming.renameSystem σ U.val)
    26
    27axiom legacy_below {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) :
    28 YieldBelow S T ↔ Morphisms.YieldBelow (trim S.graph) (trim T.graph)
    29
    30axiom context_mono {A : RankedSet} {k n : ℕ} (C : Context A k n)
    31 (S T : FiniteSystem A k) (h : YieldBelow S T) : YieldBelow (plug C S) (plug C T)
    32
    33axiom yield_order {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    34 (S T : FiniteSystem A n) (h : YieldBelow S T) :
    35 FiniteContextualOrder.Below (FiniteAcceptance.Accepting L) T S
    36
    37axiom flatten_mono {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n)
    38 (Q : ∀ v, FiniteSystem A (P.graph.label v).1) (h : ∀ v, YieldBelow (Inner P.graph v) (Q v)) :
    39 YieldBelow (flatten P) (flatten (withLabels P Q))
    40
    41axiom flatten_congruence {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n)
    42 (Q : ∀ v, FiniteSystem A (P.graph.label v).1) (h : ∀ v, YieldEquivalent (Inner P.graph v) (Q v)) :
    43 YieldEquivalent (flatten P) (flatten (withLabels P Q))
    44
    45end Lax369799.SupportedYieldComparison
    46
    Show ProofShow 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…