Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 10 — a knockout tournament T on GF(2^k) with v_T(x, y) = 1 + d(x − y)

Proved
StableSKC.Galois.lemma_3_1

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

finite-fieldsknockout-tournamentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tournament-design

Let GF(2k)\mathrm{GF}(2^k)GF(2k) be presented as Z2[X]/(q)\mathbb Z_2[X]/(q)Z2​[X]/(q) for an irreducible qqq of degree kkk with root α\alphaα, and let d(x)=max⁡{i:xi≠0}d(x) = \max\{i : x_i \ne 0\}d(x)=max{i:xi​=0} be the degree of x=∑i=0k−1xiαix = \sum_{i=0}^{k-1} x_i\alpha^ix=∑i=0k−1​xi​αi. Then there is a knockout tournament TTT whose 2k2^k2k players are the elements of GF(2k)\mathrm{GF}(2^k)GF(2k) such that, for all distinct x,y∈GF(2k)x, y \in \mathrm{GF}(2^k)x,y∈GF(2k),

vT(x,y)=1+d(x−y),v_T(x, y) = 1 + d(x - y),vT​(x,y)=1+d(x−y),

that is, xxx and yyy can meet in round 1+d(x−y)1 + d(x-y)1+d(x−y) of TTT.

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 TTT 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 kkk.

Formalization Note The field is a type F with a power basis pb over ZMod 2 of dimension kkk = pb.dim; the tournament is a seeding Seeding pb.dim F. The identity is required only for x≠yx \ne yx=y, since the page leaves d(0)d(0)d(0), and hence vT(x,x)v_T(x, x)vT​(x,x), undefined.

Preamble
import Mathlib
import Definitions.Def_StableSKC_Galois_Model
Formal statement
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
Source
Lambers, Pendavingh & Spieksma, How to Design a Stable Serial Knockout Competition, arXiv:2211.02513v1, p. 10, Lemma 3.1
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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