While this submission is a draft, it cannot be used by other submissions.

Unfolding through polynomial contexts

Lax369799.PolynomialUnfolding · concepts/Lax369799/PolynomialUnfolding.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    8 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.PolynomialQuotient
    2import Lax369799.SystemSubstitution
    3
    4/-!
    5---
    6title: Unfolding through polynomial contexts
    7type: theorem
    8---
    9A polynomial applied to a system value can be realized by an actual system.
    10For unfold-equivalent inputs, choose unfold-equivalent realizations. Thus
    11closed acceptance invariance under unfolding makes the polynomial quotient
    12an unfolding-invariant algebra in every rank.
    13-/
    14namespace Lax369799.PolynomialUnfolding
    15open RankedSystems Algebras Morphisms PolynomialContexts
    16
    17def 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
    20axiom 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
    25axiom 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
    30end Lax369799.PolynomialUnfolding
    31
    Show ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…