Supported yields, contextual order, and substitution congruence
Lax369799.SupportedYieldComparison · concepts/Lax369799/SupportedYieldComparison.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Yields with explicit variable maps agree with the reachable presentation interface after unused outputs are compacted. The comparison preserves both initial and root yields. Yield inclusion is stable under contexts and simultaneous substitution, and reverses the yield-syntactic order.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 context_mono proven
2 flatten_congruence proven
3 flatten_mono proven
4 initial_yield proven
5 legacy_below proven
6 root_yield proven
7 yield_order proven
Lean source view on GitHub
| 1 | import Lax369799.SupportedYields |
| 2 | import Lax369799.FiniteYieldContinuity |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Supported yields, contextual order, and substitution congruence |
| 7 | type: theorem |
| 8 | --- |
| 9 | Yields with explicit variable maps agree with the reachable presentation |
| 10 | interface after unused outputs are compacted. The comparison preserves |
| 11 | both initial and root yields. Yield inclusion is stable under contexts |
| 12 | and simultaneous substitution, and reverses the yield-syntactic order. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.SupportedYieldComparison |
| 16 | open RankedSystems FinitePresentations FiniteContexts |
| 17 | open SupportedMorphisms FiniteRenaming SupportedYields |
| 18 | |
| 19 | axiom initial_yield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n) |
| 20 | (U : SupportedSystems.System A m) (σ : Fin m → Fin n) : |
| 21 | InitialYield S U σ ↔ Morphisms.InitYield (trim S.graph) (Renaming.renameSystem σ U.val) |
| 22 | |
| 23 | axiom root_yield {A : RankedSet} {m n : ℕ} (S : FiniteSystem A n) |
| 24 | (U : SupportedSystems.System A m) (σ : Fin m → Fin n) : |
| 25 | RootYield S U σ ↔ Morphisms.InitYield (RankedSystems.uproot (trim S.graph)) (Renaming.renameSystem σ U.val) |
| 26 | |
| 27 | axiom legacy_below {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) : |
| 28 | YieldBelow S T ↔ Morphisms.YieldBelow (trim S.graph) (trim T.graph) |
| 29 | |
| 30 | axiom context_mono {A : RankedSet} {k n : ℕ} (C : Context A k n) |
| 31 | (S T : FiniteSystem A k) (h : YieldBelow S T) : YieldBelow (plug C S) (plug C T) |
| 32 | |
| 33 | axiom yield_order {A : RankedSet} (L : Algebras.Language A) {n : ℕ} |
| 34 | (S T : FiniteSystem A n) (h : YieldBelow S T) : |
| 35 | FiniteContextualOrder.Below (FiniteAcceptance.Accepting L) T S |
| 36 | |
| 37 | axiom flatten_mono {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n) |
| 38 | (Q : ∀ v, FiniteSystem A (P.graph.label v).1) (h : ∀ v, YieldBelow (Inner P.graph v) (Q v)) : |
| 39 | YieldBelow (flatten P) (flatten (withLabels P Q)) |
| 40 | |
| 41 | axiom flatten_congruence {A : RankedSet} {n : ℕ} (P : FiniteSystem (FiniteSystem A) n) |
| 42 | (Q : ∀ v, FiniteSystem A (P.graph.label v).1) (h : ∀ v, YieldEquivalent (Inner P.graph v) (Q v)) : |
| 43 | YieldEquivalent (flatten P) (flatten (withLabels P Q)) |
| 44 | |
| 45 | end Lax369799.SupportedYieldComparison |
| 46 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments