Proof of `Linearly-finite and recognisable series` (6th statement)

groundedproofs/Lax619925Proofs/Recognisable.lean · lax-619925

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The classical coincidence lemma (paper §4): a series is recognisable if and only if it is linearly finite. The forward direction (LFofrecognisableLF_of_recognisable) takes the finite-dimensional range of the representation's semLinsemLin map as the finite generator space; the reverse direction (recognisableoflinearlyfiniterecognisable_of_linearly_finite) builds a representation from a left-derivative-closed finite generator space, reading off the matrices, initial vector, and final vector from a basis of that space.