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

Locally surjective maps of finite presentations

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

    Definition

    A cover of presentations preserves labels, initial vertices, roots, and edges, and is surjective on initial vertices, roots, and each successor set. Presentations may contain unreachable vertices. Restricting the source of a cover to its reachable part still covers a reachable target. This permits finite constructions to be checked before enumerating and removing unreachable vertices.

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

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

    2 trim_cover proven

    Lean source view on GitHub

    1import Lax369799.Morphisms
    2
    3/-!
    4---
    5title: Locally surjective maps of finite presentations
    6type: definition
    7---
    8A cover of presentations preserves labels, initial vertices, roots, and
    9edges, and is surjective on initial vertices, roots, and each successor
    10set. Presentations may contain unreachable vertices. Restricting the
    11source of a cover to its reachable part still covers a reachable target.
    12This permits finite constructions to be checked before enumerating and
    13removing unreachable vertices.
    14-/
    15
    16namespace Lax369799.PresentationCovers
    17open RankedSystems Morphisms
    18
    19structure Cover {A : RankedSet} {n : ℕ} {V W : Type}
    20 (S : Presentation A n V) (T : Presentation A n W) where
    21 toFun : V → W
    22 label : ∀ v, T.label (toFun v) = S.label v
    23 initial : ∀ v, v ∈ S.initial → toFun v ∈ T.initial
    24 root : ∀ v, v ∈ S.root → toFun v ∈ T.root
    25 edge : ∀ v d t, S.edge v d t → T.edge (toFun v) d (Sum.map toFun id t)
    26 initial_lift : ∀ w, w ∈ T.initial → ∃ v, v ∈ S.initial ∧ toFun v = w
    27 root_lift : ∀ w, w ∈ T.root → ∃ v, v ∈ S.root ∧ toFun v = w
    28 edge_lift : ∀ v d t, T.edge (toFun v) d t →
    29 ∃ s, S.edge v d s ∧ Sum.map toFun id s = t
    30
    31axiom surjective_of_reachable {A : RankedSet} {n : ℕ} {V W : Type}
    32 {S : Presentation A n V} {T : Presentation A n W} (f : Cover S T)
    33 (hT : ∀ w, T.Reachable w) : Function.Surjective f.toFun
    34
    35axiom trim_cover {A : RankedSet} {n : ℕ} {V : Type} [Fintype V]
    36 (S : Presentation A n V) (T : SetSystem A n) (f : Cover S T.graph) :
    37 UnfoldsTo T (trim S)
    38
    39end Lax369799.PresentationCovers
    40
    Show ProofShow Proof

    Discussion

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

    Loading discussion…