Context tests and simultaneous substitution
Lax369799.FiniteContextCongruence · concepts/Lax369799/FiniteContextCongruence.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The set-system clause of Lemma 42. Relations are stated on enumerated presentations, so compatibility with the manuscript's identification up to isomorphism is explicit. A reflexive local relation is preserved by all contexts exactly when it is preserved by simultaneous substitution into every finite outer shape, for a reflexive transitive target relation.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax369799.FiniteContexts |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Context tests and simultaneous substitution |
| 6 | type: theorem |
| 7 | --- |
| 8 | The set-system clause of Lemma 42. Relations are stated on enumerated |
| 9 | presentations, so compatibility with the manuscript's identification up |
| 10 | to isomorphism is explicit. A reflexive local relation is preserved by |
| 11 | all contexts exactly when it is preserved by simultaneous substitution |
| 12 | into every finite outer shape, for a reflexive transitive target relation. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.FiniteContextCongruence |
| 16 | open RankedSystems FinitePresentations FiniteContexts |
| 17 | |
| 18 | abbrev RelationFamily (A : RankedSet) := ∀ n, FiniteSystem A n → FiniteSystem A n → Prop |
| 19 | |
| 20 | def InContexts {A : RankedSet} (R R' : RelationFamily A) : Prop := |
| 21 | ∀ (k n : ℕ) (C : Context A k n) (S T : FiniteSystem A k), |
| 22 | R k S T → R' n (plug C S) (plug C T) |
| 23 | |
| 24 | def InSubstitutions {A : RankedSet} (R R' : RelationFamily A) : Prop := |
| 25 | ∀ (B : RankedSet) (n : ℕ) (P : FiniteSystem B n) |
| 26 | (q r : ∀ v : P.Vertex, FiniteSystem A (P.graph.label v).1), |
| 27 | (∀ v, R _ (q v) (r v)) → R' n (flatten (withLabels P q)) (flatten (withLabels P r)) |
| 28 | |
| 29 | axiom context_iff_substitution {A : RankedSet} (R R' : RelationFamily A) |
| 30 | (hR : ∀ n (S : FiniteSystem A n), R n S S) (hR' : ∀ n (S : FiniteSystem A n), R' n S S) |
| 31 | (htrans : ∀ n (S T U : FiniteSystem A n), R' n S T → R' n T U → R' n S U) |
| 32 | (hiso : ∀ n (S T : FiniteSystem A n), Isomorphic S T → R' n S T) : |
| 33 | InContexts R R' ↔ InSubstitutions R R' |
| 34 | |
| 35 | end Lax369799.FiniteContextCongruence |
| 36 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments