Cluster k0412
Finite-field counts and kernel sum bounds
This small, mixed cluster has no single theme in the sample. One statement counts matrices over a finite field in a special subgroup (the "mirabolic" matrices) and relates it to a product of terms like q to the i minus one. Another bounds the total of a list of complex numbers when a symmetric weight matrix has row sums near one and nearly acts on the list as a scaling. Other files carry step names with no visible statement. The work is spread across several formalism areas, so the files do two or more unrelated jobs: finite-group counting and a general inequality. I am not sure how they connect.
4 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Linear algebraFinite sets and countingComplex numbersGroups as matrices: representations and characters
Uses
Used by
18 Lean files, main folder Formalism.SobolevGaussianKernels.