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

Context evaluation in finite-presentation algebras

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

    Associativity makes context evaluation depend only on the value of the inserted presentation. Testing quotient values in all algebra contexts recovers their contextual order.

    Concept map
    7 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.FiniteSyntacticAlgebra
    2
    3/-!
    4---
    5title: Context evaluation in finite-presentation algebras
    6type: theorem
    7---
    8Associativity makes context evaluation depend only on the value of the
    9inserted presentation. Testing quotient values in all algebra contexts
    10recovers their contextual order.
    11-/
    12namespace Lax369799.FiniteEvaluation
    13open RankedSystems (RankedSet RankedMap)
    14open FinitePresentations FiniteContexts FiniteContextualOrder FiniteSyntacticAlgebra
    15
    16axiom context_evaluation {A : RankedSet} (E : Algebra A) {k n : ℕ}
    17 (C : Context A k n) (S : FiniteSystem A k) :
    18 E.eval n (plug C S) = E.eval n (plug C (atomic (E.eval k S)))
    19
    20def quotientContext {A : RankedSet} (F : ClosedProperty A) {k n : ℕ}
    21 (C : Context A k n) : Context (Carrier F) k n where
    22 system := relabel (fun r => Sum.map (fun a => quotientMap F r (atomic a)) id) C.system
    23 one_hole := by
    24 have hh (v : C.system.Vertex) :
    25 Lax369799.Flattening.IsHole
    26 ((relabel (fun r => Sum.map (fun a => quotientMap F r (atomic a)) id) C.system).graph.label v) ↔
    27 Lax369799.Flattening.IsHole (C.system.graph.label v) := by
    28 change (∃ h, Sum.map (fun a => quotientMap F (C.system.graph.label v).1 (atomic a)) id
    29 (C.system.graph.label v).2 = Sum.inr h) ↔
    30 (∃ h, (C.system.graph.label v).2 = Sum.inr h)
    31 generalize C.system.graph.label v = t
    32 obtain ⟨r, a⟩ := t
    33 cases a <;> simp
    34 obtain ⟨v, hv, hu⟩ := C.one_hole
    35 exact ⟨v, (hh v).mpr hv, fun w hw => hu w ((hh w).mp hw)⟩
    36
    37axiom quotient_context {A : RankedSet} (F : ClosedProperty A)
    38 (E : Algebra (Carrier F))
    39 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    40 E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S))
    41 {k n : ℕ} (C : Context A k n) (S : FiniteSystem A k) :
    42 E.eval n (plug (quotientContext F C) (atomic (quotientMap F k S))) =
    43 quotientMap F n (plug C S)
    44
    45axiom order_separating {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F)
    46 (E : Algebra (Carrier F))
    47 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    48 E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S))
    49 {n : ℕ} (a b : Carrier F n)
    50 (h : ∀ C : Context (Carrier F) n 0,
    51 AcceptingClass F (E.eval 0 (plug C (atomic a))) →
    52 AcceptingClass F (E.eval 0 (plug C (atomic b)))) : ClassBelow F a b
    53
    54end Lax369799.FiniteEvaluation
    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…