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

Bounded profiles in root-free substitution patterns

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

    A finite outer presentation need not be reachable. If its inner set-systems have no roots, equality of their bounded initial profiles suffices to transfer every observed value of the closed substitution.

    Concept map
    33 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.PresentationObservations
    2import Lax369799.ProfileSubstitution
    3
    4/-!
    5---
    6title: Bounded profiles in root-free substitution patterns
    7type: theorem
    8---
    9A finite outer presentation need not be reachable. If its inner set-systems
    10have no roots, equality of their bounded initial profiles suffices to
    11transfer every observed value of the closed substitution.
    12-/
    13namespace Lax369799.ObservedSubstitution
    14open RankedSystems Algebras
    15
    16def finiteLabels {A : RankedSet} {n : ℕ} {V : Type}
    17 (P : Presentation (SetSystem A) n V) :
    18 Presentation (FinitePresentations.FiniteSystem A) n V := {
    19 P with label := fun v => ⟨(P.label v).1, FinitePresentations.ofSetSystem (P.label v).2⟩ }
    20
    21def replaceLabels {A : RankedSet} {n : ℕ} {V : Type}
    22 (P : Presentation (SetSystem A) n V) (Q : ∀ v, SetSystem A (P.label v).1) :
    23 Presentation (SetSystem A) n V := { P with label := fun v => ⟨(P.label v).1, Q v⟩ }
    24
    25axiom transfer_value {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    26 [Finite (B 1)] (η : RankedMap A B) {V : Type} [Fintype V]
    27 (P : Presentation (SetSystem A) 0 V) (Q : ∀ v, SetSystem A (P.label v).1)
    28 (hP : ∀ v, (P.label v).2.graph.root = ∅) (hQ : ∀ v, (Q v).graph.root = ∅)
    29 (h : ∀ v, FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    30 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    31 FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    32 (fun k R => E.eval k (relabelSystem η R)) (Q v)) :
    33 PresentationObservations.values E η (FinitePresentations.flattenPresentation (finiteLabels P)) ⊆
    34 PresentationObservations.values E η
    35 (FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q)))
    36
    37end Lax369799.ObservedSubstitution
    38
    Show Proof

    Discussion

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

    Loading discussion…