Cost of Lemma 16 (30)

Cost of Lemma 16 (30).

The following holds (Lean statement, in the scope of module Solutions.SynthCost):

theorem Synth.lemma16_cost {V d K p ℓ Cℓ τ lam cmv c12 Clay nmv nx nr : ℝ}
    (hV : 0 ≤ V) (hd : 0 ≤ d) (hK : 0 < K) (hp : 0 ≤ p) (hℓ : 0 ≤ ℓ)
    (hcmv : 0 ≤ cmv) (hc12 : 0 ≤ c12) (hClay : 0 ≤ Clay) (hCℓ : 0 ≤ Cℓ)
    (hnmv0 : 0 ≤ nmv) (hnmv : nmv ≤ d * K) (hnx0 : 0 ≤ nx) (hnx : nx * K ≤ Cℓ * p)
    (hnr0 : 0 ≤ nr) (hnr : nr ≤ ℓ) :
    nmv * (cmv * V) + nx * (c12 * V * K ^ τ) + nr * (Clay * V * d ^ lam) ≤
      (cmv + c12 * Cℓ + Clay) * V * (d * K + p * K ^ (τ - 1) + ℓ * d ^ lam)

Context. The lemma belongs to the part §6.2 / §7.1: cost sums, the descriptor bound, and error accumulation.

Formalization Note. This lemma belongs to the Lean formalization (integer-multiplication-kappa campaign) of the OpenAI preprint Integer multiplication below $n\log n$: the array model of tape data (mixed-radix arrays and pull maps), the interchange networks of §3–4 (Propositions 7, 8, 11, Lemmas 9–12), the butterfly layers of §5 (Lemma 13, Proposition 14), the synthesis of §6–7 (Lemma 16, Proposition 18), the resampling and parameter choices of §8–9, and the final glue IntMul.OpenAI.Glue.kappaBound_of_machine, which derives the platform bound KappaBound (1/2^182) (from Def_IntMul_MultitapeModel) for any correct multitape machine meeting the paper's time recurrence. All names refer to the definition bundles IntMul_Kappa_K_Defs1–IntMul_Kappa_K_Defs9.