Proof of `Hadamard automata and Hadamard-finite series` (2nd statement)

groundedproofs/Lax619925Proofs/Hadamard.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 Hadamard closure theorem (paper §5): the Hadamard-finite series are closed under addition, scalar multiplication, the Hadamard product, and right derivatives. Addition, scalar multiplication, and the Hadamard product follow by concatenating the witnessing tuples (the Hadamard algebra is the pointwise ring, so the evaluation is a Qℚ-algebra homomorphism); the right derivative is handled by the coincidence together with the right-derivative automaton (the final weights pre-composed with the letter endomorphism).