Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ND–PT nestOK + dim order ⇒ Le Pc

Proved
IntMul.Kappa.R8.Bit.Oppbank.nest_Le_ND_NDpt

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

bitnbnestoppbankr8

If densified code ooo is ND and ccc is PT, nest-ok, and dimCF o≤dimCF c\mathrm{dimCF}\,o\le\mathrm{dimCF}\,cdimCFo≤dimCFc, then

Le(Pc o,Pc c).\mathrm{Le}(\mathrm{Pc}\,o,\mathrm{Pc}\,c).Le(Pco,Pcc).

Uses densified orthOK\mathrm{orthOK}orthOK to place the node projector under the complementary triple projector 1−Pl1-\mathrm{Pl}1−Pl.

Formal statement
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

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

theorem nest_Le_ND_NDpt :
    ∀ o c, o < codeBound → c < codeBound → nestOK o c = true →
      isND o = true → isPT c = true → dimCF o ≤ dimCF c → Le (Pc o) (Pc c) := by
  sorry

end IntMul.Kappa.R8.Bit.Oppbank
Source
R8 densified ND-PT half of nest_Le_ND

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