Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Result 4.6 — Delsarte's Singleton-like bound |C| ≤ q^{m(n − d + 1)} for rank distance codes

Proved
HScattered.Bound.result_4_6

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryfinite-fieldsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1rank-metric-codes

Let XXX and YYY be Fq\mathbb F_qFq​-vector spaces with dim⁡FqX=m\dim_{\mathbb F_q} X = mdimFq​​X=m and dim⁡FqY=n\dim_{\mathbb F_q} Y = ndimFq​​Y=n, where n≤mn \le mn≤m. A rank distance code of Fqn×m\mathbb F_q^{n\times m}Fqn×m​ is a set C\mathcal CC of Fq\mathbb F_qFq​-linear maps X→YX \to YX→Y, with the rank distance d(f,g)=rk⁡(f−g)d(f,g) = \operatorname{rk}(f-g)d(f,g)=rk(f−g). Suppose 1≤d≤n1 \le d \le n1≤d≤n and any two distinct elements of C\mathcal CC have rank distance at least ddd. Then

∣C∣≤q m(n−d+1).|\mathcal C| \le q^{\,m(n-d+1)} .∣C∣≤qm(n−d+1).

Codes attaining this bound are the maximum rank distance (MRD) codes. The bound is due to Delsarte (1978); in the paper it is the counting step of the case h=r−1h = r-1h=r−1 of Theorem 2.3.

Formalization Note The paper's hypothesis is that ddd is the minimum distance min⁡{d(f,g):f,g∈C, f≠g}\min\{d(f,g): f,g\in\mathcal C,\ f\ne g\}min{d(f,g):f,g∈C, f=g}. The Lean statement only asks that ddd be a lower bound for the distances, which implies the minimum-distance version and is how the paper applies it. The range 1≤d≤n1 \le d \le n1≤d≤n (automatic for a minimum distance of a code with two or more elements) keeps n−d+1n-d+1n−d+1 free of natural-number truncation. C\mathcal CC is a Finset of linear maps, qqq is Fintype.card F, and the rank of f−gf-gf−g is the dimension of its range.

Preamble
import Mathlib
Formal statement
namespace HScattered.Bound

/-- Result 4.6 (Delsarte's Singleton-like bound, as stated in arXiv:1906.10590v2, p. 14).
A rank distance code `C` of `𝔽_q^{n×m}`, `n ≤ m`, is a set of `𝔽_q`-linear maps `X → Y` with
`dim X = m`, `dim Y = n`; the distance of `f, g` is `rk(f − g)`. If any two distinct elements of
`C` are at rank distance at least `d` (`1 ≤ d ≤ n`), then `|C| ≤ q^{m(n − d + 1)}`. -/
theorem result_4_6 {F X Y : Type*} [Field F] [Fintype F]
    [AddCommGroup X] [Module F X] [FiniteDimensional F X]
    [AddCommGroup Y] [Module F Y] [FiniteDimensional F Y]
    (m n d : ℕ) (hm : Module.finrank F X = m) (hn : Module.finrank F Y = n) (hnm : n ≤ m)
    (C : Finset (X →ₗ[F] Y)) (hd1 : 1 ≤ d) (hdn : d ≤ n)
    (hC : ∀ f ∈ C, ∀ g ∈ C, f ≠ g → d ≤ Module.finrank F (LinearMap.range (f - g))) :
    C.card ≤ Fintype.card F ^ (m * (n - d + 1)) := by sorry

end HScattered.Bound
Source
B. Csajbók, G. Marino, O. Polverino, F. Zullo, Generalising the scattered property of subspaces, arXiv:1906.10590v2, p. 14, §4.1, Result 4.6, eq. (12) (citing P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, J. Combin. Theory Ser. A 25 (1978))
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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