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

Unary continuations of deterministic contexts

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

    In a closed deterministic context, an outgoing direction of the hole leads either straight back to the hole or into a deterministic unary piece. In the former case the corresponding cut piece is empty; the continuation is the identity and is retained by the boundary loop flag.

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

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

    Lean source view on GitHub

    1import Lax369799.AlgebraicDecomposition
    2import Lax369799.VariableCompression
    3
    4/-!
    5---
    6title: Unary continuations of deterministic contexts
    7type: theorem
    8---
    9In a closed deterministic context, an outgoing direction of the hole
    10leads either straight back to the hole or into a deterministic unary
    11piece. In the former case the corresponding cut piece is empty; the
    12continuation is the identity and is retained by the boundary loop flag.
    13-/
    14namespace Lax369799.DeterministicPieces
    15open RankedSystems Flattening ContextDecomposition AlgebraicDecomposition
    16
    17axiom direction_piece {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    18 (hC : C.system.Deterministic) (i : Fin k) :
    19 (i ∈ (boundary C).loops ∧ (trim (ordinaryPiece C i.succ)).size = 0) ∨
    20 (i ∉ (boundary C).loops ∧ (trim (ordinaryPiece C i.succ)).Deterministic)
    21
    22axiom entry_piece {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    23 (hC : C.system.Deterministic) :
    24 ((boundary C).initial ∧ (trim (ordinaryPiece C 0)).size = 0) ∨
    25 (¬ (boundary C).initial ∧ (trim (ordinaryPiece C 0)).Deterministic)
    26
    27/-- `none` is the identity continuation, represented by a direct boundary connection. -/
    28noncomputable def continuation {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    29 (i : Fin (k + 1)) : Option (System A 1) := by
    30 classical
    31 exact if h : (trim (ordinaryPiece C i)).Deterministic then
    32 some ⟨trim (ordinaryPiece C i), h⟩ else none
    33
    34axiom continuation_boundary {A : RankedSet} {k : ℕ} (C : SetContext A k 0)
    35 (hC : C.system.Deterministic) :
    36 (continuation C 0 = none ↔ (boundary C).initial) ∧
    37 ∀ i : Fin k, continuation C i.succ = none ↔ i ∈ (boundary C).loops
    38
    39axiom compress_continuations {A : RankedSet} {V : Type} [Finite V] {m n : ℕ}
    40 (C : SetContext A m 0) (hC : C.system.Deterministic)
    41 (σ : Fin m → Fin n) (ρ : System A 1 → V) :
    42 ∃ (m' : ℕ) (τ : Fin m → Fin m') (sectionMap : Fin m' → Fin m),
    43 (∀ j, τ (sectionMap j) = j) ∧
    44 (∀ i, σ (sectionMap (τ i)) = σ i) ∧
    45 (∀ i, (continuation C (sectionMap (τ i)).succ).map ρ =
    46 (continuation C i.succ).map ρ) ∧
    47 (∀ i, sectionMap (τ i) ∈ (boundary C).loops ↔ i ∈ (boundary C).loops) ∧
    48 (∀ j, Nat.card {i // σ (sectionMap i) = j} ≤ Nat.card V + 1)
    49
    50end Lax369799.DeterministicPieces
    51
    Show ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…