Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 26 — |{h ∈ 𝔽_{q^n} : h^{q^t+1} = −1}| = q^t + 1

Proved
ScatPoly.Inequiv.card_H

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

finite-fieldp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ppp be an odd prime, r≥1r \ge 1r≥1, q=prq = p^rq=pr, t≥1t \ge 1t≥1, and let F=Fq2tF = \mathbb F_{q^{2t}}F=Fq2t​. Then the set H={h∈F:hqt+1=−1}H = \{h \in F : h^{q^t+1} = -1\}H={h∈F:hqt+1=−1} has exactly qt+1q^t + 1qt+1 elements:

∣{h∈Fq2t:hqt+1=−1}∣=qt+1.\bigl|\{h \in \mathbb F_{q^{2t}} : h^{q^t+1} = -1\}\bigr| = q^t + 1.​{h∈Fq2t​:hqt+1=−1}​=qt+1.

HHH indexes the family Lh,tL_{h,t}Lh,t​; its size is the numerator of the lower bound in Theorem 5.1, whose proof divides it by the sizes of the equivalence classes.

Formalization Note. The cardinality is Nat.card of the subtype of FFF cut out by hqt+1=−1h^{q^t+1} = -1hqt+1=−1.

Preamble
import Mathlib
import Definitions.Def_ScatPoly_Inequiv_Model
Formal statement
namespace ScatPoly.Inequiv

theorem card_H (F : Type*) [Field F] [Fintype F] (p r t q : ℕ) [Fact p.Prime] [CharP F p]
    (hp : Odd p) (hr : 0 < r) (hq : q = p ^ r) (ht : 1 ≤ t)
    (hcard : Fintype.card F = q ^ (2 * t)) :
    Nat.card (hSet F q t) = q ^ t + 1 := by sorry

end ScatPoly.Inequiv
Source
Longobardi, Marino, Trombetti & Zhou, A large family of maximum scattered linear sets of PG(1, q^n) and their associated MRD codes, arXiv:2102.08287v3, p. 26, §5, proof of Theorem 5.1
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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