Finite support for initial observations
Lax369799.InitialResolutionApproximation · concepts/Lax369799/InitialResolutionApproximation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Initial observations of a substitution depend on finitely many initial resolutions of its labels, including when the outer presentation retains unreachable vertices. Removing root marks before factoring preserves these observations.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax369799.RootResolutionApproximation |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite support for initial observations |
| 6 | type: theorem |
| 7 | --- |
| 8 | Initial observations of a substitution depend on finitely many initial |
| 9 | resolutions of its labels, including when the outer presentation retains |
| 10 | unreachable vertices. Removing root marks before factoring preserves |
| 11 | these observations. |
| 12 | -/ |
| 13 | namespace Lax369799.InitialResolutionApproximation |
| 14 | open RankedSystems Morphisms FiniteResolutionNormalForms ObservedSubstitution |
| 15 | |
| 16 | axiom finite_support {A : RankedSet} {n : ℕ} {V : Type} [Fintype V] |
| 17 | (P : Presentation (SetSystem A) n V) (R : System A n) |
| 18 | (hR : InitYield (trim (FinitePresentations.flattenPresentation (finiteLabels P))) R) : |
| 19 | ∃ (m : ℕ) (v : Fin m → V) (c : ∀ i, Component (P.label (v i)).2), |
| 20 | (∀ i, (c i).rooted = false) ∧ |
| 21 | ∀ (Q : ∀ v, SetSystem A (P.label v).1), |
| 22 | (∀ i, DirectResolution (Q (v i)) (c i).system) → |
| 23 | InitYield (trim (FinitePresentations.flattenPresentation |
| 24 | (finiteLabels (replaceLabels P Q)))) R |
| 25 | |
| 26 | end Lax369799.InitialResolutionApproximation |
| 27 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments