Lemma 3.1, p. 10 — a knockout tournament T on GF(2^k) with v_T(x, y) = 1 + d(x − y)
ProvedStableSKC.Galois.lemma_3_1Let be presented as for an irreducible of degree with root , and let be the degree of . Then there is a knockout tournament whose players are the elements of such that, for all distinct ,
that is, and can meet in round of .
In such a tournament the round in which two players can meet depends only on their difference. This is the starting point of the construction: relabelling by the nonzero field elements produces a stable serial knockout competition (Theorem 3.1). In particular, the lemma shows that the hypothesis of the formalized Theorem 3.1 is satisfiable for every .
Formalization Note The field is a type F with a power basis pb over ZMod 2 of dimension = pb.dim; the tournament is a seeding Seeding pb.dim F. The identity is required only for , since the page leaves , and hence , undefined.
import Mathlib import Definitions.Def_StableSKC_Galois_Model
namespace StableSKC.Galois
theorem lemma_3_1 {F : Type*} [Field F] [Algebra (ZMod 2) F] (pb : PowerBasis (ZMod 2) F) :
∃ T : Seeding pb.dim F, ∀ x y : F, x ≠ y → CanMeetIn T x y (1 + deg pb (x - y)) := by sorry
end StableSKC.Galois
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.