Flattening, resolutions, and yield congruence
Lax369799.FlatteningTheorems · concepts/Lax369799/FlatteningTheorems.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Flattening preserves systems. Flatten-resolutions give direct resolutions of a flattening; conversely, every direct resolution has an unfolding obtained by flattening a flatten-resolution. Yield inclusion is preserved by substitution into contexts. These are the central compositional results of Sections 2.6–2.9.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 atomic_flatten_cover proven
2 flatten_resolution_sound proven
3 flatten_system proven
4 outer_atomic_cover proven
5 resolution_to_flatten_resolution proven
6 unfold_context_congruence proven
7 yield_context_congruence proven
Lean source view on GitHub
| 1 | import Lax369799.Resolutions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Flattening, resolutions, and yield congruence |
| 6 | type: theorem |
| 7 | --- |
| 8 | Flattening preserves systems. Flatten-resolutions give direct resolutions |
| 9 | of a flattening; conversely, every direct resolution has an unfolding |
| 10 | obtained by flattening a flatten-resolution. Yield inclusion is preserved |
| 11 | by substitution into contexts. These are the central compositional results |
| 12 | of Sections 2.6–2.9. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.FlatteningTheorems |
| 16 | open RankedSystems Morphisms Flattening Resolutions |
| 17 | |
| 18 | axiom atomic_flatten_cover {A : RankedSet} {n : ℕ} (S : SetSystem A n) : |
| 19 | UnfoldsTo S (flatten (relabel (fun _ a => atomic a) S)) |
| 20 | |
| 21 | axiom outer_atomic_cover {A : RankedSet} {n : ℕ} (S : SetSystem A n) : |
| 22 | UnfoldsTo S (flatten (atomic S)) |
| 23 | |
| 24 | axiom flatten_system {A : RankedSet} {n : ℕ} (S : System (System A) n) : |
| 25 | ∃ T : System A n, SystemFlattening S T |
| 26 | |
| 27 | axiom flatten_resolution_sound {A : RankedSet} {n : ℕ} |
| 28 | (S : SetSystem (SetSystem A) n) (T : System (System A) n) |
| 29 | (h : FlattenResolution S T) (U : System A n) (hU : SystemFlattening T U) : |
| 30 | DirectResolution (flatten S) U |
| 31 | |
| 32 | axiom resolution_to_flatten_resolution {A : RankedSet} {n : ℕ} |
| 33 | (S : SetSystem (SetSystem A) n) (R : System A n) |
| 34 | (hR : DirectResolution (flatten S) R) : |
| 35 | ∃ (T : System (System A) n) (U : System A n), |
| 36 | Nonempty (FlattenResolution S T) ∧ SystemFlattening T U ∧ UnfoldsTo R.val U.val |
| 37 | |
| 38 | axiom yield_context_congruence {A : RankedSet} {k n : ℕ} |
| 39 | (C : SetContext A k n) (S T : SetSystem A k) (h : YieldBelow S T) : |
| 40 | YieldBelow (plug C S) (plug C T) |
| 41 | |
| 42 | axiom unfold_context_congruence {A : RankedSet} {k n : ℕ} |
| 43 | (C : SetContext A k n) (S T : SetSystem A k) (h : UnfoldEquivalent S T) : |
| 44 | UnfoldEquivalent (plug C S) (plug C T) |
| 45 | |
| 46 | end Lax369799.FlatteningTheorems |
| 47 |
Builds on
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments