Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.10 — over Fq\mathbb F_qFq​ there are at least qr(2k−r)−2kq^{r(2k-r)-2k}qr(2k−r)−2k matrices of size k×kk\times kk×k and rank exactly rrr

Proved
GroupIsoDepth.LowerBounds.lemma_5_10

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

countingfinite-fieldslinear-algebrap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Fq\mathbb F_qFq​ be a finite field with qqq elements and 0≤r≤k0\le r\le k0≤r≤k. Then there are at least qr(2k−r)−2kq^{r(2k-r)-2k}qr(2k−r)−2k matrices of size k×kk\times kk×k over Fq\mathbb F_qFq​ of rank exactly rrr.

Differences from the source:

  • encoding: k × k matrices of rank exactly r → hypothesis r ≤ k; reason: a k × k matrix has rank ≤ k; for r > k the count is 0 and the statement has no content in the paper
  • encoding: F_q → any finite field F with q = Fintype.card F; reason: every finite field is some F_q
  • encoding: q^{r(2k−r)−2k} → real zpow with exponent r(2k − r) − 2k computed in ℤ; reason: the exponent can be negative
Preamble
import Mathlib
Formal statement
namespace GroupIsoDepth.LowerBounds

/-- Lemma 5.10 (printed p. 39, PDF 40). Over a finite field `F_q`, there are at least
`q^{r(2k−r)−2k}` matrices of size `k × k` and rank exactly `r` (for every rank `0 ≤ r ≤ k`). -/
theorem lemma_5_10 {F : Type*} [Field F] [Fintype F] (k r : ℕ) (hr : r ≤ k) :
    (Fintype.card F : ℝ) ^ ((r : ℤ) * (2 * k - r) - 2 * k) ≤
      (Nat.card {M : Matrix (Fin k) (Fin k) F // M.rank = r} : ℝ) := by sorry

end GroupIsoDepth.LowerBounds
Source
Grochow, Kardeş, Levet, Group Isomorphism: Depth-2½ Circuits and Lower Bounds, STOC 2027 submission (manuscript sha256 cd6cacd4…), Lemma 5.10 (p. 39, PDF 40)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

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