§3.3, p. 11 — relabelling by z: v_{T(z)}(x, y) = v_T(z^{−1}x, z^{−1}y)
ProvedStableSKC.Galois.scale_canMeetInfinite-fieldsknockout-tournamentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tournament-design
Let be a knockout tournament on players whose players are the elements of a field , let be nonzero, and let be the tournament obtained from by replacing each player with . Then for all players and every round ,
In words: and can meet in round of exactly when and can meet in round of , because sits in at the leaf where sits in .
This transports the meeting rounds of to every relabelled tournament and is the first step of the computation in §3.3.
Formalization Note is the predicate CanMeetIn T x y i, and the identity of the page is stated as an equivalence of these predicates for every .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.