Unary continuations of deterministic contexts
Lax369799.DeterministicPieces · concepts/Lax369799/DeterministicPieces.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural 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
Evidence
Lean source view on GitHub
| 1 | import Lax369799.AlgebraicDecomposition |
| 2 | import Lax369799.VariableCompression |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Unary continuations of deterministic contexts |
| 7 | type: theorem |
| 8 | --- |
| 9 | In a closed deterministic context, an outgoing direction of the hole |
| 10 | leads either straight back to the hole or into a deterministic unary |
| 11 | piece. In the former case the corresponding cut piece is empty; the |
| 12 | continuation is the identity and is retained by the boundary loop flag. |
| 13 | -/ |
| 14 | namespace Lax369799.DeterministicPieces |
| 15 | open RankedSystems Flattening ContextDecomposition AlgebraicDecomposition |
| 16 | |
| 17 | axiom 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 | |
| 22 | axiom 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. -/ |
| 28 | noncomputable 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 | |
| 34 | axiom 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 | |
| 39 | axiom 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 | |
| 50 | end Lax369799.DeterministicPieces |
| 51 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments