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

Proof of `The running times of FF(1,m)||ΣwjZj` (1st statement)

groundedproofs/Lax434175Proofs/JitTimes.lean · lax-434175

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.

Read the Lean proof on GitHub

Description

The program of Theorem 2 of lax-496464 after the word map: its main term (W−D+1)(n+1)min(m−1,n)(W - D + 1) (n + 1)^min(m-1, n) is at most 6Wnm6 W n^m.