Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 11 — {T(z) : z ∈ GF(2^k) ∖ {0}} is a stable SKC: each pair of players can meet in round i in exactly 2^{i−1} tournaments

Proved
StableSKC.Galois.theorem_3_1

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

combinatorial-designfinite-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α, let ddd be the degree function with respect to the basis 1,α,…,αk−11, \alpha, \dots, \alpha^{k-1}1,α,…,αk−1, and let TTT be a knockout tournament whose 2k2^k2k players are the elements of GF(2k)\mathrm{GF}(2^k)GF(2k) and which satisfies Lemma 3.1:

vT(x,y)=1+d(x−y)for all distinct x,y∈GF(2k).v_T(x, y) = 1 + d(x - y) \quad \text{for all distinct } x, y \in \mathrm{GF}(2^k).vT​(x,y)=1+d(x−y)for all distinct x,y∈GF(2k).

For nonzero zzz let T(z)T(z)T(z) be the tournament obtained from TTT by replacing each player xxx with zxzxzx. Then

T:={T(z):z a nonzero element of GF(2k)}\mathcal T := \{T(z) : z \text{ a nonzero element of } \mathrm{GF}(2^k)\}T:={T(z):z a nonzero element of GF(2k)}

is a stable serial knockout competition:

  1. T\mathcal TT consists of 2k−12^k - 12k−1 knockout tournaments on the 2k2^k2k players;
  2. for every pair of distinct players x,x′x, x'x,x′ and every round i=1,…,ki = 1, \dots, ki=1,…,k,
#{T∈T:vT(x,x′)=i}=2i−1.\#\{T \in \mathcal T : v_T(x, x') = i\} = 2^{i-1}.#{T∈T:vT​(x,x′)=i}=2i−1.

This is the paper's main result: stable serial knockout competitions exist for every number of players n=2kn = 2^kn=2k, and they are obtained explicitly from the multiplicative group of GF(2k)\mathrm{GF}(2^k)GF(2k). The count 2i−12^{i-1}2i−1 is the only possible stable value, since a player can meet 2i−12^{i-1}2i−1 opponents in round iii of any single tournament.

Formalization Note The family is indexed by the units z : Fˣ of a field F with a power basis pb over ZMod 2 of dimension kkk = pb.dim. IsStableSKC includes that the index set has 2k−12^k - 12k−1 elements; the explicit count 2i−12^{i-1}2i−1 is stated as a second conclusion (the proof on p. 11 prints 2i2^i2i, a misprint; p. 4 gives ci=2i−1c_i = 2^{i-1}ci​=2i−1). The hypothesis on TTT is required for distinct players only, since d(0)d(0)d(0) is undefined on the page; Lemma 3.1 shows it is satisfiable. No assumption k≥2k \ge 2k≥2 is made, as Theorem 3.1 does not need it.

Preamble
import Mathlib
import Definitions.Def_StableSKC_Galois_Model
Formal statement
namespace StableSKC.Galois
theorem theorem_3_1 {F : Type*} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F]
    (pb : PowerBasis (ZMod 2) F) (T : Seeding pb.dim F)
    (hT : ∀ x y : F, x ≠ y → CanMeetIn T x y (1 + deg pb (x - y))) :
    IsStableSKC (fun z : Fˣ => scale T z) ∧
    ∀ x x' : F, x ≠ x' → ∀ i : ℕ, 1 ≤ i → i ≤ pb.dim →
      meetCount (fun z : Fˣ => scale T z) x x' i = 2 ^ (i - 1) := by sorry
end StableSKC.Galois
Source
Lambers, Pendavingh & Spieksma, How to Design a Stable Serial Knockout Competition, arXiv:2211.02513v1, p. 11, Theorem 3.1 (with the standing hypothesis of §3.3, p. 11, and Definitions 1.1–1.3, pp. 3–4)
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