Proof of `Hadamard automata and Hadamard-finite series` (1st statement)
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 Hadamard anti-derivative closure (paper §5): over a finite alphabet, if is a left anti-derivative of a tuple of Hadamard-finite series ( for all ), then is Hadamard-finite. The witnessing tuple for is itself followed by the concatenation of the witnessing tuples of the 's: is trivially a Hadamard polynomial in a tuple containing it (its own variable), and the tuple is closed under left derivatives because is a Hadamard polynomial in the (closed) witnessing tuple for , and each 's witnessing tuple is itself closed. The finiteness of the alphabet is what makes the combined tuple finite.