Strict-dim ND–ND nest implies the stage-one move
ProvedIntMul.Kappa.R8.Bit.Oppbank.move1_of_nest_ND_ND_of_dimbitnbcomplexity-theoryinteger-multiplicationmove1oppbankpndr8round-eight
Strict-dimension ND–ND nest implies the stage-one move
Let be mutually inverse encodings, and let be ND codes with and . If
then
The strict dimension hypothesis excludes the 1770 equal-dimension leaf counterexamples that block a universal nestOK move on published Pnd.
Formalization note. The proof composes the already-proved lemmas nest_Le_ND_ND_of_dim and move1_of_Le_dim (left disjunct).
Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4 import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankLab1 import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankMoveFacts2 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.Lab
open IntMul.Kappa.R8.Bit.Oppbank.MoveFacts2
open IntMul.Kappa.R8.Bit.Oppbank.SupG
open IntMul.Kappa.R6.Bit
open IntMul.Kappa.R6.Bit.NB
open Matrix
/-- Stage-one move on an ND–ND nest with *strict* `dimCF o < dimCF c`.
Excludes the 1770 equal-dim leaf counterexamples. -/
theorem move1_of_nest_ND_ND_of_dim
(S : Matrix (Fin 529) Pr23 ℚ) (Si : Matrix Pr23 (Fin 529) ℚ)
(hSi : Si * S = 1) {o c b : ℕ} (ho : o < codeBound) (hc : c < codeBound)
(hb : b < 1771)
(hok : nestOK o c = true)
(hNDo : isND o = true) (hNDc : isND c = true)
(hdim : dimCF o < dimCF c) :
pswQ (K S Si (Dm o c) (Pl b)) * Φ₁ S Si b o = Φ₁ S Si b c := by
sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: strict-dim ND-ND nestOK move1 on published Pnd.