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

Algebraic decomposition with boundary data

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

    Remove the hole symbol from each unary piece and evaluate its reachable part. The resulting unary values, together with the planted hole mark and its self-loop directions, give the planted normal context used in the extremal construction. Its evaluation agrees with the planted original context for every atomic argument.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ContextDecomposition
    2import Lax369799.ExtremalContexts
    3
    4/-!
    5---
    6title: Algebraic decomposition with boundary data
    7type: theorem
    8---
    9Remove the hole symbol from each unary piece and evaluate its reachable
    10part. The resulting unary values, together with the planted hole mark
    11and its self-loop directions, give the planted normal context used in
    12the extremal construction. Its evaluation agrees with the planted
    13original context for every atomic argument.
    14-/
    15
    16namespace Lax369799.AlgebraicDecomposition
    17open RankedSystems Flattening SetAlgebras ContextDecomposition
    18
    19/-- The label of a non-hole vertex is an ordinary letter of the same rank. -/
    20noncomputable def ordinaryLetter {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    21 (v : BodyVertex C) :
    22 {a : A (C.system.graph.label v.val).1 // (C.system.graph.label v.val).2 = Sum.inl a} := by
    23 cases h : (C.system.graph.label v.val).2 with
    24 | inl a => exact ⟨a, rfl⟩
    25 | inr hkr =>
    26 have hv : IsHole (C.system.graph.label v.val) := ⟨hkr, h⟩
    27 exact False.elim (v.property ((Classical.choose_spec C.one_hole).2 v.val hv))
    28
    29noncomputable def ordinaryPiece {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    30 (i : Fin (k + 1)) : Presentation A 1 (BodyVertex C) where
    31 label := fun v => ⟨(C.system.graph.label v.val).1, (ordinaryLetter C v).val⟩
    32 initial := (piece C i).initial
    33 root := (piece C i).root
    34 edge := (piece C i).edge
    35 direction_valid := (piece C i).direction_valid
    36
    37noncomputable def pieceValue {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    38 (C : SetContext A k 0) (i : Fin (k + 1)) : A 1 := by
    39 classical
    40 exact E.eval 1 (trim (ordinaryPiece C i))
    41
    42noncomputable def plantedBoundary {A : RankedSet} {k : ℕ} (C : SetContext A k 0) :
    43 ExtremalContexts.Boundary k where
    44 root := (boundary C).initial ∨ (boundary C).root
    45 loops := (boundary C).loops
    46
    47axiom algebraic_decomposition {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    48 (C : SetContext A k 0) (a : A k) :
    49 E.eval 0 (plug (ExtremalContexts.normalContext (plantedBoundary C) (pieceValue E C)) (atomic a)) =
    50 E.eval 0 (plant (plug C (atomic a)))
    51
    52end Lax369799.AlgebraicDecomposition
    53
    Show Proof

    Discussion

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

    Loading discussion…