`AxBudget6` from its three halves (round six, `axBudget6_of`)
ProvedJ6Seg.ChB.axBudget6_ofcomplexity-theoryinteger-multiplicationkappa-improvement
AxBudget6 from its three halves.
The following holds (Lean statement, in the scope of module Solutions.J6SegAxBud8):
theorem J6Seg.ChB.axBudget6_of (P : Prm) (hP : P.Ok) (ap : AxPlan6) (hS : SideCost6 P ap)
(hJ : JBudget6 P ap) (hC : ChunkBudget6 P ap) : AxBudget6 P ap
Context. B-line axis budget 8: axBudget6_of (assembly of AxBudget6)
copy_facts: the copy / swap descriptor facts atBs = axBcp6(every value≤ 2T);axBudget6_of P hP ap : SideCost6 P ap → JBudget6 P ap → ChunkBudget6 P ap → AxBudget6 P ap(constants added, exponents maximised).
Formalization Note. Part of the Lean formalization of the round-six κ-improvement (integer-multiplication-kappa campaign, target IntMul.Kappa.jain_round6_framework). The statement is copied verbatim from the Lean development; the platform node carries the same declaration name. Definitions it mentions live in the IntMul_Kappa_R6_Defs* bundles (on top of the published κ bundles IntMul_Kappa_K_Defs*).
Preamble
-- Round-six κ development (integer-multiplication-kappa), generated by skeleton subtraction. import Definitions.Def_IntMul_Kappa_R6_Defs70 set_option autoImplicit false set_option relaxedAutoImplicit false set_option maxHeartbeats 1000000 open J6Seg J6Seg.ChB open IntMul NLogN NLogN.KIL NLogN.KFB IntMul.Kappa.R6 J6Seg J6Seg.KR
Formal statement
theorem J6Seg.ChB.axBudget6_of (P : Prm) (hP : P.Ok) (ap : AxPlan6) (hS : SideCost6 P ap)
(hJ : JBudget6 P ap) (hC : ChunkBudget6 P ap) : AxBudget6 P ap := by sorrySource
S. Jain, round-six networks for the integer-multiplication κ-improvement campaign (https://github.com/Swapnil-jain/integer-mult-kappa, commit 5868dc7) and D. Colkitt, integer-mult-bounds (https://github.com/CrocSwap/integer-mult-bounds); target `IntMul.Kappa.jain_round6_framework`. Lean declaration `J6Seg.ChB.axBudget6_of`, Solutions/J6SegAxBud8.lean (lines 92–140) of the round-six development.