Strict-dim ND–ND nest implies Le (Pc o) (Pc c)
ProvedIntMul.Kappa.R8.Bit.Oppbank.nest_Le_ND_ND_of_dimbitnbcomplexity-theoryinteger-multiplicationnestleoppbankpndr8round-eight
Strict-dimension ND–ND nest implies
Let be codes strictly below , both ND, with . If the dimensions are strictly ordered,
then , i.e. and .
The strict dimension hypothesis excludes the 1770 equal-dimension leaf counterexamples of the non-strict form, which is false on published Pnd.
Formalization note. The proof composes the already-proved lemmas dimCF_of_ND, densSup_land_mono_of_argRel_of_dim, argRel_dim_le, Le_Pnd_of_land, and AllDensCentred on published (non-Fix) Pnd. Le is the projector-order relation from MoveFacts2.
Preamble
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd 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 Matrix
open IntMul.Kappa.R8.Bit.Oppbank.Pnd
open IntMul.Kappa.R8.Bit.Oppbank.MoveFacts2
open IntMul.Kappa.R8.Bit.Oppbank.SupG
/-- Strict-dim ND–ND nest: if `dimCF o < dimCF c`, then `Le (Pc o) (Pc c)`.
Excludes the 1770 equal-dim leaf counterexamples of the non-strict form. -/
theorem nest_Le_ND_ND_of_dim :
∀ o c, o < codeBound → c < codeBound → nestOK o c = true →
isND o = true → isND c = true → dimCF o < dimCF c → Le (Pc o) (Pc c) := by
sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: strict-dim nest_Le_ND_ND on published Pnd.