argRel implies dimF a ≤ dimF n on published Pnd
ProvedIntMul.Kappa.R8.Bit.Oppbank.argRel_dim_leargdimlebitnbcomplexity-theoryinteger-multiplicationoppbankpndr8round-eight
implies
On published (non-Fix) Pnd, if are densified nodes and holds (that is, is one of the two packed argument slots of ), then
Empirically there are no argument-related pairs with . The equality case includes the 1770 leaf pairs where land-mono fails; this lemma only claims the weak inequality, not land-mono.
Formalization note. The proof consolidates the five already-proved range lemmas argRel_dim_le_R0--R4 and unfolds argRel.
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
/-- If `argRel a n`, then `dimF a ≤ dimF n`. Empirically true on published Pnd
(zero argRel pairs have dimF a > dimF n). -/
theorem argRel_dim_le {a n : ℕ} (ha : a < nNodes) (hn : n < nNodes)
(h : argRel a n = true) : dimF a ≤ dimF n := by
sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: argRel_dim_le on published Pnd, for strict-dim nest_Le.