Round-eight bit histogram child widths are at most 529
ProvedIntMul.Kappa.R8.bitR8_widths_lecomplexity-theoryinteger-multiplicationround-eight
Let bitR8 be S. Jain's round-eight bit-side child-width histogram (pairs from lean/Round8.lean). The underlying QH-network has width . This theorem asserts the finite inspection
It is the bit-side width guard used by moment comparisons and by any QH-network whose child widths are required to be at most .
Preamble
import Definitions.Def_IntMul_KappaJainData set_option autoImplicit false set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R8 open IntMul.Kappa.Jain /-- Every child width appearing in `Jain.bitR8` is at most the bit-network width $m = 529$. -/ theorem bitR8_widths_le : ∀ p ∈ bitR8, p.1 ≤ 529 := by sorry end IntMul.Kappa.R8
Source
S. Jain, integer-mult-kappa, lean/Round8.lean bitHist; Def_IntMul_KappaJainData Jain.bitR8