§3.3, p. 11 — v_{T(z)}(x, y) = v_{T(z)}(0, x − y) and v_{T(z)}(0, y) = 1 + d(z^{−1}y)
ProvedStableSKC.Galois.scale_round_formulaLet be presented with a root of an irreducible polynomial of degree over , with degree function , and let be a knockout tournament on the elements of satisfying Lemma 3.1, i.e. for all distinct . Let be nonzero and let be obtained from by replacing each player with . Then:
- for all distinct ,
- for all nonzero ,
So in every relabelled tournament the meeting round of two players depends only on their difference, and is computed explicitly by the degree. Theorem 3.1 follows from these identities by counting.
Formalization Note Item 1 is stated as CanMeetIn (scale T z) x y i ↔ CanMeetIn (scale T z) 0 (x - y) i for every , and item 2 as CanMeetIn (scale T z) 0 y i ↔ i = 1 + deg pb (z⁻¹ * y) for every : the round in which two distinct players can meet is unique, so this is the meaning of "". The identities are stated for distinct players (, ), since the page leaves and undefined.
import Mathlib import Definitions.Def_StableSKC_Galois_Model
namespace StableSKC.Galois
theorem scale_round_formula {F : Type*} [Field 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))) (z : Fˣ) :
(∀ x y : F, x ≠ y → ∀ i : ℕ,
(CanMeetIn (scale T z) x y i ↔ CanMeetIn (scale T z) 0 (x - y) i)) ∧
(∀ y : F, y ≠ 0 → ∀ i : ℕ,
(CanMeetIn (scale T z) 0 y i ↔ i = 1 + deg pb ((↑z⁻¹ : F) * y))) := by sorry
end StableSKC.Galois
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.