Cluster k0601
Counting subspaces over finite fields and densities
The main thread is counting. Given a finite field with q elements, the files count subspaces of a vector space that contain a given image, using Gaussian binomial coefficients (the q-version of "n choose k"). Related files give closed products for a density, and algebra over a field with a twisted p-th-power map. Another part treats the Smith normal form, a way to bring a matrix to diagonal form, over a ring with one prime. A third part states probability bounds for randomly choosing sets, stated as conditional probabilities. These jobs look loosely related.
3 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
Finite sets and countingLinear algebraRings, fields and algebrasDiscrete valuation rings: numbers with one prime, and reducing mod itLattices in n dimensions, covolume and counting points
References
Stanley, Enumerative Combinatorics, Volume 1 · ch. 1 (q-analogues, subspace counts)Background reading suggested by the AI namer · unchecked
Uses
Used by
48 Lean files, main folder Formalism.SubspaceCounting.SubspaceCountingProofs.