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

Smallification preserving identity continuations

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

    Variables can be grouped by their target and their optional unary continuation value. The grouping preserves evaluation in a closed deterministic context and has at most |A₁|+1 representatives over each target. The additional observation represents a direct return to the hole, whose cut piece is empty.

    Concept map
    19 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.

    Lean source view on GitHub

    1import Lax369799.DeterministicNormalForms
    2import Lax369799.ContextRelabelling
    3
    4/-!
    5---
    6title: Smallification preserving identity continuations
    7type: theorem
    8---
    9Variables can be grouped by their target and their optional unary
    10continuation value. The grouping preserves evaluation in a closed
    11deterministic context and has at most |A₁|+1 representatives over each
    12target. The additional observation represents a direct return to the
    13hole, whose cut piece is empty.
    14-/
    15namespace Lax369799.ContextSmallification
    16open RankedSystems Flattening Algebras Renaming
    17
    18axiom context_smallification {A : RankedSet} (E : Algebra A) (hE : UnfoldInvariant E)
    19 [Finite (A 1)] {m n : ℕ} (C : SetContext A m 0) (hC : C.system.Deterministic)
    20 (S : System A m) (σ : Fin m → Fin n) :
    21 ∃ (m' : ℕ) (τ : Fin m → Fin m') (sectionMap : Fin m' → Fin m),
    22 (∀ j, τ (sectionMap j) = j) ∧
    23 (∀ i, σ (sectionMap (τ i)) = σ i) ∧
    24 (∀ j, Nat.card {i // σ (sectionMap i) = j} ≤ Nat.card (A 1) + 1) ∧
    25 ∃ U V : System A 0,
    26 U.val = plug C S.val ∧
    27 V.val = plug C (renameSystem (sectionMap ∘ τ) S).val ∧
    28 E.eval 0 U = E.eval 0 V
    29
    30axiom mapped_context_smallification {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    31 [Finite (B 1)] (η : RankedMap A B) {m n : ℕ}
    32 (C : SetContext A m 0) (hC : C.system.Deterministic) (S : System A m) (σ : Fin m → Fin n) :
    33 ∃ (m' : ℕ) (τ : Fin m → Fin m') (sectionMap : Fin m' → Fin m),
    34 (∀ j, τ (sectionMap j) = j) ∧
    35 (∀ i, σ (sectionMap (τ i)) = σ i) ∧
    36 (∀ j, Nat.card {i // σ (sectionMap i) = j} ≤ Nat.card (B 1) + 1) ∧
    37 ∃ U V : System A 0,
    38 U.val = plug C S.val ∧
    39 V.val = plug C (renameSystem (sectionMap ∘ τ) S).val ∧
    40 E.eval 0 (relabelSystem η U) = E.eval 0 (relabelSystem η V)
    41
    42end Lax369799.ContextSmallification
    43
    Show ProofShow Proof

    Discussion

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

    Loading discussion…