Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stage-one frames are transported from the high code at dimension less than 23

Proved
IntMul.Kappa.R8.Bit.Oppbank.move1_high_of_dim

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

bitnbformalokintmulkappamove1r8

Stage-one frame transport from the high code

Let SSS and S−1S^{-1}S−1 be 529×529529\times 529529×529 rational matrices satisfying S−1S=IS^{-1}S=IS−1S=I, and let Φ1(b,c)\Phi_1(b,c)Φ1​(b,c) be the stage-one frame of the published pack Lab\mathrm{Lab}Lab as above. The high code is 111, with Pc(1)=I\mathrm{Pc}(1)=IPc(1)=I and dimCF(1)=23\mathrm{dimCF}(1)=23dimCF(1)=23.

For every code c<64251c<64251c<64251 and slot b<1771b<1771b<1771, if either c=1c=1c=1 or dimCF(c)<23\mathrm{dimCF}(c)<23dimCF(c)<23, a move that starts at the high code transports the incoming frame to the target:

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

When c=1c=1c=1 the difference projector vanishes and the identity is tautological. When dimCF(c)<23\mathrm{dimCF}(c)<23dimCF(c)<23 one has Dm(1,c)=I−Pc(c)\mathrm{Dm}(1,c)=I-\mathrm{Pc}(c)Dm(1,c)=I−Pc(c), and the partial-swap composition law together with multiplicativity of KKK and idempotence of Pl(b)\mathrm{Pl}(b)Pl(b) yield the transport. This is the o=1o=1o=1 case of the R6 identity move1\mathrm{move}_1move1​, under the dimension hypothesis that avoids a comparison dimCF(1)≤dimCF(c)\mathrm{dimCF}(1)\le\mathrm{dimCF}(c)dimCF(1)≤dimCF(c) (which would require a rank computation for a general ND code). Point codes and all densified nodes of dimCF≤22\mathrm{dimCF}\le 22dimCF≤22 are included.

Formalization Note. The Lean name is move1_high_of_dim. Imports Pnd and Lab1 only in the problem preamble; no QHNet or QHNetRec. The general nestOK move_1 for arbitrary ND pairs remains blocked on Pc\mathrm{Pc}Pc-rank.

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 high code, when the target has `dimCF < 23`
    (or is itself the high code). -/
theorem move1_high_of_dim (S : Matrix (Fin 529) Pr23 ℚ) (Si : Matrix Pr23 (Fin 529) ℚ)
    (hSi : Si * S = 1) {c b : ℕ} (hc : c < codeBound) (hb : b < 1771)
    (hd : c = 1 ∨ dimCF c < 23) :
    pswQ (K S Si (Dm 1 c) (Pl b)) * Φ₁ S Si b 1 = Φ₁ S Si b c := by sorry
end IntMul.Kappa.R8.Bit.Oppbank
Source
IntMul Kappa R8 Bit Oppbank FormalOK: move1 from the high code on Pnd/Lab at codeBound 64251, when dimCF(c)<23 or c=1.

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