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

Initial and root observations of set-systems

Lax369799.RootObservations · concepts/Lax369799/RootObservations.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 resolutions do not depend on root marks. Removing these marks and restricting to initial reachability therefore preserves the complete initial profile. Root observations can be treated separately by making roots initial, as in uprooting.

    Concept map
    17 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteProfiles
    2
    3/-!
    4---
    5title: Initial and root observations of set-systems
    6type: theorem
    7---
    8Initial resolutions do not depend on root marks. Removing these marks
    9and restricting to initial reachability therefore preserves the complete
    10initial profile. Root observations can be treated separately by making
    11roots initial, as in uprooting.
    12-/
    13namespace Lax369799.RootObservations
    14open RankedSystems Morphisms Resolutions
    15
    16noncomputable def initialPart {A : RankedSet} {n : ℕ} (S : SetSystem A n) : SetSystem A n :=
    17 trim { S.graph with root := ∅ }
    18
    19axiom resolution_initial_part {A : RankedSet} {m n : ℕ} (S : SetSystem A n)
    20 (T : System A m) (σ : Fin m → Fin n) :
    21 IsResolution (initialPart S) T σ ↔ IsResolution S T σ
    22
    23axiom initial_profile {A B : RankedSet} (ρ : ∀ n, System A n → B n) {n : ℕ}
    24 (S : SetSystem A n) : Profile ρ (initialPart S) = Profile ρ S
    25
    26axiom rootless_outer_cover {A : RankedSet} {n : ℕ}
    27 (S T : FinitePresentations.FiniteSystem (FinitePresentations.FiniteSystem A) n)
    28 (f : PresentationCovers.Cover S.graph T.graph)
    29 (h : ∀ w, (FinitePresentations.Inner T.graph w).graph.root = ∅) :
    30 Nonempty (PresentationCovers.Cover (FinitePresentations.flatten S).graph
    31 (FinitePresentations.flatten T).graph)
    32
    33end Lax369799.RootObservations
    34
    Show 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…