Lax314295.KTypesCongruence
k-types are a congruence for concatenation
concepts/Lax314295/KTypesCongruence.lean · lax-314295
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
In the paper
- page 133 of the paper of lax-157538, Transducers
Theorem
The -type of a concatenation depends only on the -types of and of (Lemma C.4.15 of Transducers, congruence): the relation "same -type" is a congruence of the free monoid.
Lean source view on GitHub
| 1 | import Lax314295.KTypes |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: k-types are a congruence for concatenation |
| 6 | type: theorem |
| 7 | --- |
| 8 | The -type of a concatenation depends only on the -types of |
| 9 | and of (Lemma C.4.15 of *Transducers*, congruence): the relation "same |
| 10 | -type" is a congruence of the free monoid. |
| 11 | |
| 12 | # Formalization notes |
| 13 | |
| 14 | Stated over any alphabet; no finiteness is needed. |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax314295.KTypesCongruence |
| 18 | |
| 19 | open Lax314295.KTypes |
| 20 | |
| 21 | /-- The `k`-type of a concatenation is determined by the `k`-types of the parts. -/ |
| 22 | axiom tp_append_congr {A : Type} (k : ℕ) (w w' v v' : List A) |
| 23 | (hw : tp k w = tp k w') (hv : tp k v = tp k v') : tp k (w ++ v) = tp k (w' ++ v') |
| 24 | |
| 25 | end Lax314295.KTypesCongruence |
| 26 |
Formalization notes
Stated over any alphabet; no finiteness is needed.
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments