Stage-one frames are transported from the low code
ProvedIntMul.Kappa.R8.Bit.Oppbank.move1_lowStage-one frame transport from the low code
Let and be rational matrices, and let be the stage-one frame of the published pack at slot and code . Write for the difference of the two named projectors, oriented by the comparison of . The densified code bound is .
For every code and every slot , a move that starts at the low code transports the incoming frame to the target:
The identity needs no nesting hypothesis: the low projector is zero, is minimal so , and the incoming frame is the identity. This is the first (and algebraically simplest) case of the R6 move identity , retargeted to the densified R8 packs and . It covers in particular every start from the zero code, including the copyo overwrites . The general nestOK case for arbitrary ND codes remains a separate lemma (it still uses -rank).
Formalization Note. The Lean name is move1_low (ASCII). Imports Pnd and Lab1 only; no QHNet or QHNetRec. The bound hypotheses and are recorded to match the intended domain of , even though the algebraic cancellation does not use them.
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
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