Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Standard words into high-multiplicity words` (8th statement)

groundedproofs/Lax434175Proofs/HighMultiplicityTransfer.lean · lax-434175

What this proof establishes

thm✓Lax434175.HighMultiplicity (8th statement)

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 word map is an fpt-reduction: polynomial, with the parameter bounded through the bound.