Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

dimCF of an ND code is dimF of the underlying node

Proved
IntMul.Kappa.R8.Bit.Oppbank.dimCF_of_ND

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

bitnbcomplexity-theoryinteger-multiplicationoppbankpndr8round-eight

dimCF\mathrm{dimCF}dimCF on ND codes

For every densified node nnn with 1773+n1773+n1773+n strictly below codeBound=64251\mathrm{codeBound}=64251codeBound=64251,

dimCF(1773+n)=dimF(n).\mathrm{dimCF}(1773+n)=\mathrm{dimF}(n).dimCF(1773+n)=dimF(n).

This is the unfolding of dimCF\mathrm{dimCF}dimCF on the ND branch (codes ≥1773\ge 1773≥1773): the c=0c=0c=0, c=1c=1c=1, and point-code (c<1773)(c<1773)(c<1773) cases are excluded by the arithmetic of 1773+n1773+n1773+n.

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.

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