Language invariance, closure, and syntactic finiteness for supported algebras
Lax369799.SupportedRecognition · concepts/Lax369799/SupportedRecognition.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Lemmas 56, 62, and 75 with revised Definition 6 as the algebra domain. The completion bridge transfers finite recognition, while invariance of a recognized language follows directly from invariance of its evaluation.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 complement proven
2 intersection proven
3 inverse_relabel proven
4 language_invariant proven
5 projection proven
6 syntactic_rankwise_finite proven
7 union proven
Lean source view on GitHub
Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof
Builds on
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments