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

Contexts obtained by marking a vertex

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

    Replacing the label of a selected vertex by the hole preserves its rank, marks, edges, and reachability. Filling the hole by the original letter recovers the system. This permits local changes to an outer deterministic system before flattening its labels.

    Concept map
    20 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.ContextRelabelling
    2import Lax369799.ContextSmallification
    3
    4/-!
    5---
    6title: Contexts obtained by marking a vertex
    7type: theorem
    8---
    9Replacing the label of a selected vertex by the hole preserves its rank,
    10marks, edges, and reachability. Filling the hole by the original letter
    11recovers the system. This permits local changes to an outer deterministic
    12system before flattening its labels.
    13-/
    14namespace Lax369799.VertexContexts
    15open RankedSystems Flattening SystemEvaluation
    16
    17noncomputable def atVertex {A : RankedSet} {n : ℕ} (S : System A n) (v : S.val.Vertex) :
    18 SetContext A (S.val.graph.label v).1 n := by
    19 classical
    20 let G : Presentation (WithHole A (S.val.graph.label v).1) n S.val.Vertex := {
    21 label := fun w => ⟨(S.val.graph.label w).1,
    22 if h : w = v then Sum.inr ⟨by rw [h]⟩ else Sum.inl (S.val.graph.label w).2⟩
    23 initial := S.val.graph.initial
    24 root := S.val.graph.root
    25 edge := S.val.graph.edge
    26 direction_valid := S.val.graph.direction_valid }
    27 refine ⟨⟨S.val.size, G, S.val.reachable⟩, v, ?_, ?_⟩
    28 · exact ⟨⟨rfl⟩, by simp [G]⟩
    29 · intro w hw
    30 by_contra h
    31 obtain ⟨p, hp⟩ := hw
    32 simp only [G, dif_neg h] at hp
    33 cases hp
    34
    35axiom deterministic {A : RankedSet} {n : ℕ} (S : System A n) (v : S.val.Vertex) :
    36 (atVertex S v).system.Deterministic
    37
    38axiom fill_vertex {A : RankedSet} {n : ℕ} (S : System A n) (v : S.val.Vertex) :
    39 relabel (fillLetter (S.val.graph.label v).2) (atVertex S v).system = S.val
    40
    41axiom smallification {A : RankedSet} (E : Algebras.Algebra A) (hE : Algebras.UnfoldInvariant E)
    42 [Finite (A 1)] (S : System A 0) (v : S.val.Vertex) {n : ℕ}
    43 (σ : Fin (S.val.graph.label v).1 → Fin n) :
    44 ∃ (m' : ℕ) (τ : Fin (S.val.graph.label v).1 → Fin m')
    45 (sectionMap : Fin m' → Fin (S.val.graph.label v).1),
    46 (∀ j, τ (sectionMap j) = j) ∧
    47 (∀ i, σ (sectionMap (τ i)) = σ i) ∧
    48 (∀ j, Nat.card {i // σ (sectionMap i) = j} ≤ Nat.card (A 1) + 1) ∧
    49 ∃ T : System A 0,
    50 T.val = relabel (fillLetter (E.eval _
    51 (Renaming.renameSystem (sectionMap ∘ τ) (atomicSystem (S.val.graph.label v).2))))
    52 (atVertex S v).system ∧ E.eval 0 S = E.eval 0 T
    53
    54end Lax369799.VertexContexts
    55
    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…