Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 11 — #{r ∈ GF(2^k) : r ≠ 0, 1 + d(r) = i} = 2^{i−1}

Proved
StableSKC.Galois.degree_count

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

combinatoricscountingfinite-fieldsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GF(2k)\mathrm{GF}(2^k)GF(2k) be presented with a root α\alphaα of an irreducible polynomial of degree kkk over Z2\mathbb Z_2Z2​, and let d(r)=max⁡{j:rj≠0}d(r) = \max\{j : r_j \ne 0\}d(r)=max{j:rj​=0} be the degree of r=∑j=0k−1rjαjr = \sum_{j=0}^{k-1} r_j \alpha^jr=∑j=0k−1​rj​αj. Then for every round i=1,…,ki = 1, \dots, ki=1,…,k,

#{r∈GF(2k):r≠0, 1+d(r)=i}=2i−1.\#\{r \in \mathrm{GF}(2^k) : r \ne 0,\ 1 + d(r) = i\} = 2^{i-1}.#{r∈GF(2k):r=0, 1+d(r)=i}=2i−1.

This is the counting step of the proof of Theorem 3.1: the number of tournaments T(z)T(z)T(z) in which two given distinct players can meet in round iii equals the number of nonzero field elements of degree i−1i - 1i−1.

Formalization Note The proof of Theorem 3.1 on p. 11 prints the value as 2i2^i2i. That is a misprint: the elements of degree exactly i−1i-1i−1 are those with ri−1=1r_{i-1} = 1ri−1​=1, rj=0r_j = 0rj​=0 for j≥ij \ge ij≥i and r0,…,ri−2r_0, \dots, r_{i-2}r0​,…,ri−2​ arbitrary, which gives 2i−12^{i-1}2i−1, in agreement with the stability count ci=2i−1c_i = 2^{i-1}ci​=2i−1 stated on p. 4. The formal statement uses 2i−12^{i-1}2i−1.

Preamble
import Mathlib
import Definitions.Def_StableSKC_Galois_Model
Formal statement
namespace StableSKC.Galois
theorem degree_count {F : Type*} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F]
    (pb : PowerBasis (ZMod 2) F) (i : ℕ) (hi1 : 1 ≤ i) (hik : i ≤ pb.dim) :
    (Finset.univ.filter fun r : F => r ≠ 0 ∧ 1 + deg pb r = i).card = 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, proof of Theorem 3.1 (printed as 2^i; corrected to 2^{i−1}, cf. p. 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