AFTD Auto-Formalizing Theoretical Domains

wild_joint_alpha

def

alpha(T): the conditional probability, under the uniform distribution on all vertex permutations σ, that the fixed canonical matching is whole-bad for the block map of σ, given that the first block equals T. Defined as an explicit ratio of finite cardinalities (the conditioning event has 6*(n-3)! elements when |T|=3).

Statement

noncomputable def wild_joint_alpha (q : ℕ) (T : Finset (Fin (3*q))) : ℝ
Source
step towards wild_one_bad_color_mixed_moment_formula_with_context
Verified
29 Oct 2026
Axioms
none listed
Built on 4
  • wild_joint_first_blockThe first block: the set of vertices placed in positions 0,1,2 by σ (= {σ 0, σ 1, σ 2}).
  • wild_joint_blockBlock (index of the consecutive triple) containing vertex v under the permutation σ, where σ p is the vertex at position p; blocks are…
  • wild_joint_bad_relationA symmetric relation R is whole-bad for the block map p if some nonempty proper union of blocks (a nonempty proper set of block indices B,…
  • wild_joint_canonical_matchingThe fixed matching on Fin (3q) with isolated vertex 0 and pairs {2k-1, 2k} for k >= 1: (1,2),(3,4),(5,6),...
Used by 8

Lean source view module on GitHub

/-- alpha(T) = P(canonical matching whole-bad | first block = T), as a cardinality ratio. -/
noncomputable def wild_joint_alpha (q : ℕ) (T : Finset (Fin (3*q))) : ℝ := by classical exact ((Finset.univ.filter (fun σ : Equiv.Perm (Fin (3*q)) => wild_joint_first_block q σ = T ∧ wild_joint_bad_relation q (wild_joint_block q σ) (wild_joint_canonical_matching q))).card : ℝ) / ((Finset.univ.filter (fun σ : Equiv.Perm (Fin (3*q)) => wild_joint_first_block q σ = T)).card : ℝ)
See it in the graphDiscuss this resultChallenge it