Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.7 — hyperplane intersections of a maximum h-scattered subspace of dimension rn/(h + 1)

Proved
HScattered.Delsarte.theorem_2_7

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

finite-geometryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scattered-subspaces

Let VVV be an rrr-dimensional Fqn\mathbb F_{q^n}Fqn​-vector space and let UUU be a maximum hhh-scattered Fq\mathbb F_qFq​-subspace of VVV of dimension rn/(h+1)rn/(h+1)rn/(h+1). Then every (r−1)(r-1)(r−1)-dimensional Fqn\mathbb F_{q^n}Fqn​-subspace HHH of VVV satisfies

rnh+1−n ≤ dim⁡Fq(U∩H) ≤ rnh+1−n+h.\frac{rn}{h+1}-n\ \le\ \dim_{\mathbb F_q}(U\cap H)\ \le\ \frac{rn}{h+1}-n+h .h+1rn​−n ≤ dimFq​​(U∩H) ≤ h+1rn​−n+h.

The upper bound is what makes the Delsarte dual well defined in Theorem 3.3: since h<n−2h<n-2h<n−2 when n≥h+3n\ge h+3n≥h+3, it gives condition (⋄\diamond⋄) of Proposition 3.1, and it is the bound contradicted at the end of the proof of Theorem 3.3.

Formalization Note "Of dimension rn/(h+1)rn/(h+1)rn/(h+1)" is (h+1)dim⁡FqU=rn(h+1)\dim_{\mathbb F_q}U=rn(h+1)dimFq​​U=rn. Both bounds are written with nnn moved to the other side, dim⁡U≤dim⁡(U∩H)+n≤dim⁡U+h\dim U\le\dim(U\cap H)+n\le\dim U+hdimU≤dim(U∩H)+n≤dimU+h, so no natural-number subtraction or division occurs. The paper calls the hyperplane WWW; it is H here because WWW is used in §3 for another object. This duplicates the goal of the companion mission on hyperplane intersections.

Preamble
import Mathlib
import Definitions.Def_HScattered_Delsarte_IsHScattered
Formal statement
namespace HScattered.Delsarte

/-- Theorem 2.7 (arXiv:1906.10590v2, p. 8): if `U` is a maximum h-scattered `𝔽_q`-subspace of
`V = V(r, qⁿ)` of dimension `rn/(h + 1)`, then every hyperplane `H` of `V` satisfies
`rn/(h + 1) − n ≤ dim_{𝔽_q}(U ∩ H) ≤ rn/(h + 1) − n + h`.
The dimension hypothesis is `(h + 1) · dim U = r · n`, and both bounds are written with `n`
moved to the other side, so no natural-number subtraction or division occurs. -/
theorem theorem_2_7 {F K V : Type*} [Field F] [Field K] [Algebra F K]
    [AddCommGroup V] [Module K V] [Module F V] [IsScalarTower F K V]
    [Fintype F] [Fintype K] [FiniteDimensional K V]
    (h : ℕ) (U : Submodule F V) (hU : IsMaximumHScattered F K h U)
    (hdim : (h + 1) * Module.finrank F U = Module.finrank K V * Module.finrank F K)
    (H : Submodule K V) (hH : Module.finrank K H + 1 = Module.finrank K V) :
    Module.finrank F U ≤ Module.finrank F ↥(H.restrictScalars F ⊓ U) + Module.finrank F K ∧
      Module.finrank F ↥(H.restrictScalars F ⊓ U) + Module.finrank F K ≤
        Module.finrank F U + h := by sorry

end HScattered.Delsarte
Source
B. Csajbók, G. Marino, O. Polverino, F. Zullo, Generalising the scattered property of subspaces, arXiv:1906.10590v2, p. 8, Theorem 2.7 (restated p. 18)
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