Proposition 3.2, p. 7 — h^{q^t+1} = −1 implies h^{q²+1} ≠ 1 and h^{q^{t−2}} ≠ −h
ProvedScatPoly.Inequiv.proposition_3_2finite-fieldp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scattered-polynomial
Let be an odd prime, , , , and let be the finite field of order (characteristic ). If satisfies , then
Both inequalities are used in the classification of the -equivalences between the sets (proof of Theorem 4.2) and in Case (iii) of the proof of Lemma 5.3.
Formalization Note. The page states but is undefined at ; the exponent is read as , which gives the same element for because , and is defined at . The hypothesis " odd", which the page's proof uses ("as is odd") but the statement omits, is added; for even and the claim fails. This is the same statement, with the same Lean shape, as ScatPoly.Construction.proposition_3_2 of the companion mission.
Preamble
import Mathlib import Definitions.Def_ScatPoly_Inequiv_Model
Formal statement
namespace ScatPoly.Inequiv
theorem proposition_3_2 (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))
(h : F) (hh : h ^ (q ^ t + 1) = -1) :
h ^ (q ^ 2 + 1) ≠ 1 ∧ h ^ q ^ (3 * t - 2) ≠ -h := 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. 7, Proposition 3.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.