Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict-dim ND–ND nest implies Le (Pc o) (Pc c)

Proved
IntMul.Kappa.R8.Bit.Oppbank.nest_Le_ND_ND_of_dim

by Ethan Cheung Wang · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

bitnbcomplexity-theoryinteger-multiplicationnestleoppbankpndr8round-eight

Strict-dimension ND–ND nest implies Le(Pc(o),Pc(c))\mathrm{Le}(P_c(o),P_c(c))Le(Pc​(o),Pc​(c))

Let o,co,co,c be codes strictly below codeBound=64251\mathrm{codeBound}=64251codeBound=64251, both ND, with nestOK(o,c)\mathrm{nestOK}(o,c)nestOK(o,c). If the dimensions are strictly ordered,

dim⁡CF(o)<dim⁡CF(c),\dim_{\mathrm{CF}}(o)<\dim_{\mathrm{CF}}(c),dimCF​(o)<dimCF​(c),

then Le(Pc(o),Pc(c))\mathrm{Le}(P_c(o),P_c(c))Le(Pc​(o),Pc​(c)), i.e. Pc(c) Pc(o)=Pc(o)P_c(c)\,P_c(o)=P_c(o)Pc​(c)Pc​(o)=Pc​(o) and Pc(o) Pc(c)=Pc(o)P_c(o)\,P_c(c)=P_c(o)Pc​(o)Pc​(c)=Pc​(o).

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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me