Proof of `Infiltration automata and infiltration-finite series` (3rd statement)
groundedproofs/Lax619925Proofs/Infiltration.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.
Description
The infiltration coincidence theorem (paper §7): a series is infiltration-finite (an infiltration polynomial in a finite tuple of series closed under the left derivatives) if and only if it is recognised by an infiltration automaton. The "finite implies recognisable" direction extends the witnessing tuple by the series itself and builds the automaton from the closure under left derivatives; the "recognisable implies finite" direction reads off the generator tuple , closed under left derivatives by the derivation property.