Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3, p. 11 — relabelling by z: v_{T(z)}(x, y) = v_T(z^{−1}x, z^{−1}y)

Proved
StableSKC.Galois.scale_canMeetIn

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

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

Let TTT be a knockout tournament on 2k2^k2k players whose players are the elements of a field FFF, let z∈Fz \in Fz∈F be nonzero, and let T(z)T(z)T(z) be the tournament obtained from TTT by replacing each player xxx with zxzxzx. Then for all players x,yx, yx,y and every round iii,

vT(z)(x,y)=i  ⟺  vT(z−1x,z−1y)=i.v_{T(z)}(x, y) = i \iff v_T(z^{-1}x, z^{-1}y) = i .vT(z)​(x,y)=i⟺vT​(z−1x,z−1y)=i.

In words: xxx and yyy can meet in round iii of T(z)T(z)T(z) exactly when z−1xz^{-1}xz−1x and z−1yz^{-1}yz−1y can meet in round iii of TTT, because xxx sits in T(z)T(z)T(z) at the leaf where z−1xz^{-1}xz−1x sits in TTT.

This transports the meeting rounds of TTT to every relabelled tournament T(z)T(z)T(z) and is the first step of the computation in §3.3.

Formalization Note vT(x,y)=iv_{T}(x,y) = ivT​(x,y)=i is the predicate CanMeetIn T x y i, and the identity of the page is stated as an equivalence of these predicates for every iii.

Preamble
import Mathlib
import Definitions.Def_StableSKC_Galois_Model
Formal statement
namespace StableSKC.Galois
theorem scale_canMeetIn {k : ℕ} {F : Type*} [Field F] (T : Seeding k F) (z : Fˣ) (x y : F)
    (i : ℕ) :
    CanMeetIn (scale T z) x y i ↔ CanMeetIn T ((↑z⁻¹ : F) * x) ((↑z⁻¹ : F) * y) i := by sorry
end StableSKC.Galois
Source
Lambers, Pendavingh & Spieksma, How to Design a Stable Serial Knockout Competition, arXiv:2211.02513v1, p. 11, §3.3
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