AFTD Auto-Formalizing Theoretical Domains

Ug

def

Good-ordering event for group g: in the ordering e, player 2g appears immediately before player 2g+1, and every member of every earlier group h < g appears before 2g.

Statement

noncomputable def Ug {n : ℕ} (e : Fin (Fintype.card (Fin n)) ≃ Fin n) (g : ℕ) : Prop
Source
step towards two_thirds_convex_random_marginal_core_logarithmic_lower_bound
Verified
13 Nov 2026
Axioms
none listed
Used by 1
  • UgCountThe number of player orderings that satisfy the good-ordering event Ug for at least one group index g.

Lean source view module on GitHub

/-- Event that group g is a contiguous block 2g,2g+1 placed after all earlier groups; each such ordering yields a non-core marginal vector. -/
noncomputable def Ug {n : ℕ} (e : Fin (Fintype.card (Fin n)) ≃ Fin n) (g : ℕ) : Prop := ∃ (ha : 2 * g < n) (hb : 2 * g + 1 < n),
    (e.symm ⟨2 * g, ha⟩).val + 1 = (e.symm ⟨2 * g + 1, hb⟩).val ∧
    (∀ i : Fin n, i.val / 2 < g → (e.symm i).val < (e.symm ⟨2 * g, ha⟩).val)
See it in the graphDiscuss this resultChallenge it