Unfolding through polynomial contexts
Lax369799.PolynomialUnfolding · concepts/Lax369799/PolynomialUnfolding.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A polynomial applied to a system value can be realized by an actual system. For unfold-equivalent inputs, choose unfold-equivalent realizations. Thus closed acceptance invariance under unfolding makes the polynomial quotient an unfolding-invariant algebra in every rank.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 quotient_unfold_invariant proven
2 realization proven
Lean source view on GitHub
| 1 | import Lax369799.PolynomialQuotient |
| 2 | import Lax369799.SystemSubstitution |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Unfolding through polynomial contexts |
| 7 | type: theorem |
| 8 | --- |
| 9 | A polynomial applied to a system value can be realized by an actual system. |
| 10 | For unfold-equivalent inputs, choose unfold-equivalent realizations. Thus |
| 11 | closed acceptance invariance under unfolding makes the polynomial quotient |
| 12 | an unfolding-invariant algebra in every rank. |
| 13 | -/ |
| 14 | namespace Lax369799.PolynomialUnfolding |
| 15 | open RankedSystems Algebras Morphisms PolynomialContexts |
| 16 | |
| 17 | def ClosedInvariant {B : RankedSet} (E : Algebra B) (F : Set (B 0)) : Prop := |
| 18 | ∀ S T : System B 0, UnfoldEquivalent S.val T.val → (E.eval 0 S ∈ F ↔ E.eval 0 T ∈ F) |
| 19 | |
| 20 | axiom realization {B : RankedSet} (E : Algebra B) {k n : ℕ} {p : B k → B n} |
| 21 | (hp : Polynomial E k n p) (S T : System B k) (h : UnfoldEquivalent S.val T.val) : |
| 22 | ∃ U V : System B n, E.eval n U = p (E.eval k S) ∧ E.eval n V = p (E.eval k T) ∧ |
| 23 | UnfoldEquivalent U.val V.val |
| 24 | |
| 25 | axiom quotient_unfold_invariant {B : RankedSet} (E : Algebra B) (F : Set (B 0)) |
| 26 | (hF : ClosedInvariant E F) (Q : Algebra (PolynomialQuotient.Carrier E F)) |
| 27 | (hQ : ∀ n (S : System B n), Q.eval n (relabelSystem (PolynomialQuotient.classMap E F) S) = |
| 28 | PolynomialQuotient.classMap E F n (E.eval n S)) : UnfoldInvariant Q |
| 29 | |
| 30 | end Lax369799.PolynomialUnfolding |
| 31 |
Used by
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments