dimCF of an ND code is dimF of the underlying node
ProvedIntMul.Kappa.R8.Bit.Oppbank.dimCF_of_NDbitnbcomplexity-theoryinteger-multiplicationoppbankpndr8round-eight
on ND codes
For every densified node with strictly below ,
This is the unfolding of on the ND branch (codes ): the , , and point-code cases are excluded by the arithmetic of .
Preamble
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankSupG import Mathlib set_option autoImplicit false set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
open IntMul.Kappa.R8.Bit.Oppbank.Pnd
open IntMul.Kappa.R8.Bit.Oppbank.SupG
/-- On an ND code, `dimCF` is the node dimension `dimF`. -/
theorem dimCF_of_ND {n : ℕ} (hn : 1773 + n < codeBound) :
dimCF (1773 + n) = dimF n := by
sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: dimCF↔dimF on ND codes, for dim-strict nest_Le.