Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

K(S,Si,Pl a, Pl s) has pivot at (0,0) under FB0

Disproved
IntMul.Kappa.R8.Bit.Oppbank.IsPiv_00_of_K_Pl_Pl

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

intmulispivkappa

Let S,SiS,S_iS,Si​ be reciprocal frames (SSi=SiS=ISS_i=S_iS=ISSi​=Si​S=I) and let Pl a,Pl s\mathrm{Pl}\,a,\mathrm{Pl}\,sPla,Pls be the densified projectors for banks a,s<1771a,s<1771a,s<1771. Then the corner matrix K(S,Si,Pl a,Pl s)K(S,S_i,\mathrm{Pl}\,a,\mathrm{Pl}\,s)K(S,Si​,Pla,Pls) has a rank-pivot at position (0,0)(0,0)(0,0):

IsPiv(K(S,Si,Pl a,Pl s),0,0).\mathrm{IsPiv}\bigl(K(S,S_i,\mathrm{Pl}\,a,\mathrm{Pl}\,s),0,0\bigr).IsPiv(K(S,Si​,Pla,Pls),0,0).

This replaces the unsound general claim that every rank-one matrix is pivoted at (0,0)(0,0)(0,0).

Preamble
import Definitions.Def_IntMul_Kappa_R6_Defs4
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankPnd
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankKAlgebra
import Mathlib
set_option autoImplicit false
set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank
open Matrix
open IntMul.Kappa.R6.Bit.NB (IsPiv)
open IntMul.Kappa.R8.Bit.Oppbank.Pnd
theorem IsPiv_00_of_K_Pl_Pl (S : Matrix (Fin 529) Pr23 ℚ) (Si : Matrix Pr23 (Fin 529) ℚ)
    (hS : S * Si = 1) (hSi : Si * S = 1) {a s : ℕ} (ha : a < 1771) (hs : s < 1771) :
    IsPiv (K S Si (Pl a) (Pl s)) 0 0 := by sorry
end IntMul.Kappa.R8.Bit.Oppbank

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