UgCount
def
The number of player orderings that satisfy the good-ordering event Ug for at least one group index g.
Statement
noncomputable def UgCount (n : ℕ) : ℕ
- Source
- step towards two_thirds_convex_random_marginal_core_logarithmic_lower_bound
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- UgGood-ordering event for group g: in the ordering e, player 2g appears immediately before player 2g+1, and every member of every earlier…
Lean source view module on GitHub
/-- Number of orderings satisfying Ug for some group; its ratio to n! lower-bounds the non-core ordering fraction. -/ noncomputable def UgCount (n : ℕ) : ℕ := by classical exact (Finset.univ.filter (fun e : Fin (Fintype.card (Fin n)) ≃ Fin n => ∃ g, Ug e g)).card