Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dim-strict densSup land-mono on published argRel

Proved
IntMul.Kappa.R8.Bit.Oppbank.densSup_land_mono_of_argRel_of_dim

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

bitnbcomplexity-theoryinteger-multiplicationlandmonooppbankpndr8round-eight

Dim-strict bitwise support nesting on published argRel

On the published (non-Fix) packing, argRel a n is the disjunction arg0n=a∨arg1n=a\mathrm{arg}_0 n=a\lor\mathrm{arg}_1 n=aarg0​n=a∨arg1​n=a and does not itself contain a dimension test. Nevertheless, whenever argRel a n\mathrm{argRel}\,a\,nargRelan holds and dim⁡F(a)<dim⁡F(n)\dim F(a)<\dim F(n)dimF(a)<dimF(n), the bitwise supports nest:

densSupG(a)&densSupG(n)=densSupG(a).\mathrm{densSupG}(a)\mathbin{\&}\mathrm{densSupG}(n)=\mathrm{densSupG}(a).densSupG(a)&densSupG(n)=densSupG(a).

The argument uses the dim-gated window certificates LandMonoA0--LandMonoA24 (published Pnd, not PndFix) covering every node n<62478=nNodesn<62478=\mathrm{nNodes}n<62478=nNodes. This is the published-Pnd analogue of densSup_land_mono_of_argRelFix, but it is deliberately dim-strict: the unrestricted claim (no dim⁡F\dim FdimF hypothesis) is not asserted.

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
/-- Dim-strict bitwise support nesting on the published (non-Fix) `argRel`. -/
theorem densSup_land_mono_of_argRel_of_dim (a n : ℕ)
    (ha : a < SupG.nNodes) (hn : n < SupG.nNodes)
    (h : argRel a n = true) (hd : dimF a < dimF n) :
    Nat.land (densSupG a) (densSupG n) = densSupG a := by
  sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: dim-strict densSup_land_mono on published (non-Fix) Pnd.argRel, via LandMonoA0–A24.

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