Acceptance certificates retaining expanded resolutions
Lax369799.ExpandedCertificates · concepts/Lax369799/ExpandedCertificates.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A certificate chooses a deterministic value below each vertex label and representatives for the chosen values. It requires acceptance of all yields of the expanded presentation. This is a characterization of acceptance, not yet a finite-state branch condition.
Concept map
Evidence
This concept declares 3 statements. Each proof establishes one of them relative to its assumptions.
1 acceptance_iff_certificate proven
2 input_evaluation proven
3 language_iff_certificate proven
Lean source view on GitHub
| 1 | import Lax369799.FiniteVertexReplacement |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Acceptance certificates retaining expanded resolutions |
| 6 | type: theorem |
| 7 | --- |
| 8 | A certificate chooses a deterministic value below each vertex label and |
| 9 | representatives for the chosen values. It requires acceptance of all yields |
| 10 | of the expanded presentation. This is a characterization of acceptance, |
| 11 | not yet a finite-state branch condition. |
| 12 | -/ |
| 13 | namespace Lax369799.ExpandedCertificates |
| 14 | open RankedSystems (RankedSet System trim) |
| 15 | open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra |
| 16 | open ExpandedSyntacticAlgebra ExpandedContinuity |
| 17 | |
| 18 | structure Certificate {A B : RankedSet} (L : Algebras.Language A) |
| 19 | (E : SyntacticAlgebra L) (P : FiniteSystem B 0) |
| 20 | (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1) where |
| 21 | labels : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1 |
| 22 | local_choice : ∀ v, FiniteExtremal.Deterministic E.algebra (labels v) ∧ |
| 23 | ClassBelow (Accepting L) (labels v) (q v) |
| 24 | representatives : Representatives L (withLabels P labels) |
| 25 | represents : Represents L (withLabels P labels) representatives |
| 26 | accepts : ∀ T, Morphisms.Yield (trim (expansion L (withLabels P labels) representatives).graph) T → |
| 27 | Admissible L T |
| 28 | |
| 29 | axiom acceptance_iff_certificate {A B : RankedSet} (L : Algebras.Language A) |
| 30 | (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L) |
| 31 | (E : SyntacticAlgebra L) (P : FiniteSystem B 0) |
| 32 | (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1) : |
| 33 | AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P q)) ↔ |
| 34 | Nonempty (Certificate L E P q) |
| 35 | |
| 36 | axiom input_evaluation {A : RankedSet} (L : Algebras.Language A) |
| 37 | (E : SyntacticAlgebra L) {n : ℕ} (S : FiniteSystem A n) : |
| 38 | E.algebra.eval n (relabel (fun k a => quotientMap (Accepting L) k (atomic a)) S) = |
| 39 | quotientMap (Accepting L) n S |
| 40 | |
| 41 | axiom language_iff_certificate {A : RankedSet} (L : Algebras.Language A) |
| 42 | (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L) |
| 43 | (E : SyntacticAlgebra L) (S : System A 0) : |
| 44 | S ∈ L ↔ Nonempty (Certificate L E (ofSetSystem S.val) |
| 45 | (fun v => quotientMap (Accepting L) _ (atomic (S.val.graph.label v).2))) |
| 46 | |
| 47 | end Lax369799.ExpandedCertificates |
| 48 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments