Proof of `Shuffle automata and shuffle-finite series` (2nd statement)
What this proof establishes
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 shuffle closure theorem (paper §6): the shuffle-finite series are closed under addition, scalar multiplication, the shuffle product, and right derivatives. The proof proceeds at the semantic level (shuffle polynomials in a tuple closed under left derivatives), where the shuffle-algebra evaluation makes the first three parts immediate and the right derivative is the extended tuple .