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

Resolution values of finite presentations

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

    Initial observations are values of deterministic resolutions of the reachable restriction. Root observations use roots as starting vertices. Locally surjective maps preserve both sets of observations.

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

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

    Lean source view on GitHub

    1import Lax369799.Algebras
    2import Lax369799.RootExpansion
    3
    4/-!
    5---
    6title: Resolution values of finite presentations
    7type: theorem
    8---
    9Initial observations are values of deterministic resolutions of the reachable
    10restriction. Root observations use roots as starting vertices. Locally
    11surjective maps preserve both sets of observations.
    12-/
    13namespace Lax369799.PresentationObservations
    14open RankedSystems Morphisms Algebras
    15
    16noncomputable def values {A B : RankedSet} (E : Algebra B) (η : RankedMap A B)
    17 {n : ℕ} {V : Type} [Fintype V] (G : Presentation A n V) : Set (B n) :=
    18 {b | ∃ R : System A n, DirectResolution (trim G) R ∧ E.eval n (relabelSystem η R) = b}
    19
    20axiom values_remove_roots {A B : RankedSet} (E : Algebra B) (η : RankedMap A B)
    21 {n : ℕ} {V : Type} [Fintype V] (G : Presentation A n V) :
    22 values E η { G with root := ∅ } = values E η G
    23
    24axiom values_cover {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    25 (η : RankedMap A B) {n : ℕ} {V W : Type} [Fintype V] [Fintype W]
    26 {G : Presentation A n V} {H : Presentation A n W} (f : PresentationCovers.Cover G H) :
    27 values E η G = values E η H
    28
    29axiom root_values_cover {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    30 (η : RankedMap A B) {n : ℕ} {V W : Type} [Fintype V] [Fintype W]
    31 {G : Presentation A n V} {H : Presentation A n W} (f : PresentationCovers.Cover G H) :
    32 values E η (RootExpansion.startAtRoots G) = values E η (RootExpansion.startAtRoots H)
    33
    34end Lax369799.PresentationObservations
    35
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…