Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stage-one frames are transported from the low code

Proved
IntMul.Kappa.R8.Bit.Oppbank.move1_low

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

bitnbformalokintmulkappamove1r8

Stage-one frame transport from the low code

Let SSS and S−1S^{-1}S−1 be 529×529529\times 529529×529 rational matrices, and let Φ1(b,c)=pswQ(K(S,S−1;Pc(c),Pl(b)))\Phi_1(b,c)=\mathrm{pswQ}\bigl(K(S,S^{-1};\mathrm{Pc}(c),\mathrm{Pl}(b))\bigr)Φ1​(b,c)=pswQ(K(S,S−1;Pc(c),Pl(b))) be the stage-one frame of the published pack Lab\mathrm{Lab}Lab at slot bbb and code ccc. Write Dm(o,c)\mathrm{Dm}(o,c)Dm(o,c) for the difference of the two named projectors, oriented by the comparison of dimCF\mathrm{dimCF}dimCF. The densified code bound is 642516425164251.

For every code c<64251c<64251c<64251 and every slot b<1771b<1771b<1771, a move that starts at the low code 000 transports the incoming frame to the target:

pswQ(K(S,S−1;Dm(0,c),Pl(b))) Φ1(b,0)=Φ1(b,c).\mathrm{pswQ}\bigl(K(S,S^{-1};\mathrm{Dm}(0,c),\mathrm{Pl}(b))\bigr)\,\Phi_1(b,0)=\Phi_1(b,c).pswQ(K(S,S−1;Dm(0,c),Pl(b)))Φ1​(b,0)=Φ1​(b,c).

The identity needs no nesting hypothesis: the low projector is zero, dimCF(0)=0\mathrm{dimCF}(0)=0dimCF(0)=0 is minimal so Dm(0,c)=Pc(c)\mathrm{Dm}(0,c)=\mathrm{Pc}(c)Dm(0,c)=Pc(c), and the incoming frame Φ1(b,0)\Phi_1(b,0)Φ1​(b,0) is the identity. This is the first (and algebraically simplest) case of the R6 move identity move1\mathrm{move}_1move1​, retargeted to the densified R8 packs Pnd\mathrm{Pnd}Pnd and Lab\mathrm{Lab}Lab. It covers in particular every start from the zero code, including the copyo overwrites 0↦cND(t+1)0\mapsto\mathrm{cND}(t+1)0↦cND(t+1). The general nestOK case for arbitrary ND codes remains a separate lemma (it still uses Pc\mathrm{Pc}Pc-rank).

Formalization Note. The Lean name is move1_low (ASCII). Imports Pnd and Lab1 only; no QHNet or QHNetRec. The bound hypotheses c<64251c<64251c<64251 and b<1771b<1771b<1771 are recorded to match the intended domain of move1\mathrm{move}_1move1​, even though the algebraic cancellation does not use them.

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankLab1
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.Lab
open IntMul.Kappa.R8.Bit.Oppbank.SupG
open IntMul.Kappa.R6.Bit
open IntMul.Kappa.R6.Bit.NB
open Matrix
/-- A stage-one move from the low code: `pswQ(K(Dm 0 c, Pl b)) * Φ₁ b 0 = Φ₁ b c`. -/
theorem move1_low (S : Matrix (Fin 529) Pr23 ℚ) (Si : Matrix Pr23 (Fin 529) ℚ)
    {c b : ℕ} (hc : c < codeBound) (hb : b < 1771) :
    pswQ (K S Si (Dm 0 c) (Pl b)) * Φ₁ S Si b 0 = Φ₁ S Si b c := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: move1 from the low code on Pnd/Lab at codeBound 64251, the o=0 case of the R6 move1 identity.

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