§5, p. 26 — |{h ∈ 𝔽_{q^n} : h^{q^t+1} = −1}| = q^t + 1
ProvedScatPoly.Inequiv.card_Hfinite-fieldp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an odd prime, , , , and let . Then the set has exactly elements:
indexes the family ; 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 cut out by .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.