Stage-one frame transport under a matching Le of projectors
ProvedIntMul.Kappa.R8.Bit.Oppbank.move1_of_Le_dimStage-one frame transport under a matching nesting of projectors
Let and be rational matrices satisfying . Write for the densified code projector, for the point projector at slot , and for their difference, oriented by the comparison of recorded dimensions : when , and otherwise. Let be the stage-one frame of the published pack . Write for the nesting relation of idempotents.
For every pair of codes and every slot , if the orientation of is compatible with a nesting of the two projectors — that is, either
or the opposite dimension comparison together with — then a move from to transports the incoming frame:
The identity is purely algebraic: it uses the composition law for partial swaps, the multiplicativity of under , and the idempotence of and . It does not use the rank of , nor the soundness of the boolean predicate . In this sense it is the general form of the move identity , under the hypothesis that is already aligned with . The two previously established special cases (a move from the zero code, and a move from the high code when ) are instances. Closing the remaining gap from to a matching is a separate soundness lemma; the mismatched-dimension equal-projector case continues to use a rank comparison.
Formalization Note. The Lean name is move1_of_Le_dim. Imports Pnd, Lab1, and MoveFacts2 (for ) in the problem preamble; the solution additionally uses MoveFacts3 for -idempotence and NetFB/ProjB for -idempotence. No QHNet or QHNetRec.
import Definitions.Def_IntMul_Kappa_R6_Defs4 import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankLab1 import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankMoveFacts2 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.MoveFacts2
open IntMul.Kappa.R8.Bit.Oppbank.SupG
open IntMul.Kappa.R6.Bit
open IntMul.Kappa.R6.Bit.NB
open Matrix
/-- Stage-one move when `Dm` is oriented with a matching `Le` hypothesis
(no `Pc`-rank and no `nestOK` soundness). -/
theorem move1_of_Le_dim (S : Matrix (Fin 529) Pr23 ℚ) (Si : Matrix Pr23 (Fin 529) ℚ)
(hSi : Si * S = 1) {o c b : ℕ} (ho : o < codeBound) (hc : c < codeBound)
(hb : b < 1771)
(h : (dimCF o ≤ dimCF c ∧ Le (Pc o) (Pc c)) ∨
(¬ dimCF o ≤ dimCF c ∧ Le (Pc c) (Pc o))) :
pswQ (K S Si (Dm o c) (Pl b)) * Φ₁ S Si b o = Φ₁ S Si b c := by sorry
end IntMul.Kappa.R8.Bit.Oppbank