Kernel-checked Spโ(๐ฝโ) normal-subgroup certificate #
This module isolates an exhaustive Boolean-matrix certificate showing that the finite symplectic factor has no nontrivial normal abelian subgroup. The search is split into kernel-checked chunks and decoded back to Mathlib's symplectic-matrix carrier for the public theorem used in Zhou ยง6.
A four-by-four Boolean matrix packed into sixteen bits.
Equations
Instances For
A four-by-four matrix with Boolean entries.
Equations
- Connes.Sp4.BMatrix = (Fin 4 โ Fin 4 โ Bool)
Instances For
Decode a packed matrix in row-major order.
Equations
- Connes.Sp4.bvEntry x i j = BitVec.getLsbD x (4 * โi + โj)
Instances For
Multiply Boolean matrices over the field with two elements.
Equations
- Connes.Sp4.boolMul a b = Connes.Sp4.boolDot a b
Instances For
Decide entrywise equality of Boolean matrices.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The identity matrix in the Boolean representation.
Equations
- Connes.Sp4.boolOne = Connes.Sp4.bvEntry 33825#16
Instances For
The standard symplectic form in the Boolean representation.
Equations
- Connes.Sp4.boolJ = Connes.Sp4.bvEntry 8580#16
Instances For
The first chosen symplectic generator in the Boolean representation.
Equations
Instances For
The inverse of the first chosen symplectic generator.
Equations
- Connes.Sp4.boolG1Inv = Connes.Sp4.bvEntry 24520#16
Instances For
The second chosen symplectic generator in the Boolean representation.
Equations
Instances For
The inverse of the second chosen symplectic generator.
Equations
- Connes.Sp4.boolG2Inv = Connes.Sp4.bvEntry 60804#16
Instances For
Conjugate a Boolean matrix using a supplied matrix and its inverse.
Equations
- Connes.Sp4.boolConj g gi x = Connes.Sp4.boolMul (Connes.Sp4.boolMul g x) gi
Instances For
Decide whether two Boolean matrices commute.
Equations
Instances For
Check preservation of the symplectic form using its six independent row pairings.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The six-pairing test agrees with the full symplectic matrix equation.
Boolean certificate predicate used by the kernel-checked finite search.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A complete detector certificate implies that the finite symplectic factor has no nontrivial normal abelian subgroup.