Contextual preorders on finite presentations
Lax369799.FiniteContextualOrder · concepts/Lax369799/FiniteContextualOrder.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For an isomorphism-invariant property of closed finite presentations, comparison by all one-hole contexts is preserved by substitution. This construction does not assume a continuity axiom for algebra values.
Concept map
Evidence
This concept declares 5 statements. Each proof establishes one of them relative to its assumptions.
1 class_order proven
2 contextual_acceptance proven
3 contextual_congruence proven
4 contextual_iso proven
5 flatten_monotone proven
Lean source view on GitHub
| 1 | import Lax369799.FiniteContexts |
| 2 | import Mathlib.Data.Quot |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Contextual preorders on finite presentations |
| 7 | type: theorem |
| 8 | --- |
| 9 | For an isomorphism-invariant property of closed finite presentations, |
| 10 | comparison by all one-hole contexts is preserved by substitution. |
| 11 | This construction does not assume a continuity axiom for algebra values. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.FiniteContextualOrder |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FinitePresentations FiniteContexts |
| 17 | |
| 18 | abbrev ClosedProperty (A : RankedSet) := Set (FiniteSystem A 0) |
| 19 | |
| 20 | def IsoInvariant {A : RankedSet} (F : ClosedProperty A) : Prop := |
| 21 | ∀ S T, Isomorphic S T → (S ∈ F ↔ T ∈ F) |
| 22 | |
| 23 | def Below {A : RankedSet} (F : ClosedProperty A) {n : ℕ} |
| 24 | (S T : FiniteSystem A n) : Prop := |
| 25 | ∀ C : Context A n 0, plug C S ∈ F → plug C T ∈ F |
| 26 | |
| 27 | def Equivalent {A : RankedSet} (F : ClosedProperty A) {n : ℕ} |
| 28 | (S T : FiniteSystem A n) : Prop := Below F S T ∧ Below F T S |
| 29 | |
| 30 | abbrev Carrier {A : RankedSet} (F : ClosedProperty A) : RankedSet := |
| 31 | fun n => Quot (@Equivalent A F n) |
| 32 | |
| 33 | def quotientMap {A : RankedSet} (F : ClosedProperty A) : |
| 34 | RankedSystems.RankedMap (FiniteSystem A) (Carrier F) := fun _ => Quot.mk _ |
| 35 | |
| 36 | def ClassBelow {A : RankedSet} (F : ClosedProperty A) {n : ℕ} |
| 37 | (a b : Carrier F n) : Prop := |
| 38 | Quot.liftOn₂ a b (Below F) |
| 39 | (fun _ _ _ h => propext ⟨fun g C hc => h.1 C (g C hc), fun g C hc => h.2 C (g C hc)⟩) |
| 40 | (fun _ _ _ h => propext ⟨fun g C hc => g C (h.2 C hc), fun g C hc => g C (h.1 C hc)⟩) |
| 41 | |
| 42 | axiom class_order {A : RankedSet} (F : ClosedProperty A) (n : ℕ) : |
| 43 | (∀ a : Carrier F n, ClassBelow F a a) ∧ |
| 44 | (∀ a b : Carrier F n, ClassBelow F a b → ClassBelow F b a → a = b) ∧ |
| 45 | (∀ a b c : Carrier F n, ClassBelow F a b → ClassBelow F b c → ClassBelow F a c) |
| 46 | |
| 47 | axiom contextual_congruence {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 48 | {k n : ℕ} (C : Context A k n) (S T : FiniteSystem A k) (h : Below F S T) : |
| 49 | Below F (plug C S) (plug C T) |
| 50 | |
| 51 | axiom contextual_acceptance {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 52 | (S T : FiniteSystem A 0) (h : Below F S T) : S ∈ F → T ∈ F |
| 53 | |
| 54 | axiom contextual_iso {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 55 | {n : ℕ} (S T : FiniteSystem A n) (h : Isomorphic S T) : Equivalent F S T |
| 56 | |
| 57 | axiom flatten_monotone {A B : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 58 | {n : ℕ} (P : FiniteSystem B n) |
| 59 | (q r : ∀ v : P.Vertex, FiniteSystem A (P.graph.label v).1) |
| 60 | (h : ∀ v, Below F (q v) (r v)) : |
| 61 | Below F (flatten (withLabels P q)) (flatten (withLabels P r)) |
| 62 | |
| 63 | end Lax369799.FiniteContextualOrder |
| 64 |
Builds on
From Mathlib
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments