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

Initial and root observations under bounded-profile substitution

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

    Bounded initial and root profiles suffice to transfer root observations of substitution, including observations starting in unreachable outer components.

    Concept map
    34 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.ObservedSubstitution
    2
    3/-!
    4---
    5title: Initial and root observations under bounded-profile substitution
    6type: theorem
    7---
    8Bounded initial and root profiles suffice to transfer root observations of
    9substitution, including observations starting in unreachable outer components.
    10-/
    11namespace Lax369799.RootProfileSubstitution
    12open RankedSystems Algebras ObservedSubstitution
    13
    14axiom transfer_initial_value {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    15 [Finite (B 1)] (η : RankedMap A B) {V : Type} [Fintype V]
    16 (P : Presentation (SetSystem A) 0 V) (Q : ∀ v, SetSystem A (P.label v).1)
    17 (hi : ∀ v, FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    18 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    19 FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    20 (fun k R => E.eval k (relabelSystem η R)) (Q v)) :
    21 PresentationObservations.values E η (FinitePresentations.flattenPresentation (finiteLabels P)) ⊆
    22 PresentationObservations.values E η
    23 (FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q)))
    24
    25axiom transfer_root_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 (hi : ∀ v, FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    29 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    30 FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    31 (fun k R => E.eval k (relabelSystem η R)) (Q v))
    32 (hr : ∀ v, FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    33 (fun k R => E.eval k (relabelSystem η R)) (uproot (P.label v).2) =
    34 FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    35 (fun k R => E.eval k (relabelSystem η R)) (uproot (Q v))) :
    36 PresentationObservations.values E η
    37 (RootExpansion.startAtRoots (FinitePresentations.flattenPresentation (finiteLabels P))) ⊆
    38 PresentationObservations.values E η (RootExpansion.startAtRoots
    39 (FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q))))
    40
    41end Lax369799.RootProfileSubstitution
    42
    Show ProofShow Proof

    Discussion

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

    Loading discussion…