AFTD Auto-Formalizing Theoretical Domains

wild_joint_expected_ID

def

E[I*D]: the expectation of I(σ)*D(σ) over the uniform distribution on all vertex permutations σ of Fin (3q), i.e. (1/n!) * sum over σ of I*D.

Statement

noncomputable def wild_joint_expected_ID (q : ℕ) (A : Fin (3*q) → Fin (3*q) → Fin (3*q)) : ℝ
Source
step towards wild_one_bad_color_mixed_moment_formula_with_context
Verified
29 Oct 2026
Axioms
none listed
Built on 2
  • wild_joint_invalid_countI(σ): the number of colours i that invalidate a triple block, i.e. there exist distinct x,y in a single σ-block with A x y = i and i in…
  • wild_joint_bad_color_countD(σ): the number of colours i that are whole-bad, i.e. some proper union of σ-blocks has no colour-i edge crossing it (block graph of the…
Used by 1
  • wild_joint_expected_ID_eq_alpha_sumCore reduction: E[I*D] = q/C(n,3) * sum over 3-sets T of mu(T) * sum_i alpha_of_color_type(T,i), where alpha_of_color_type is the alpha of…

Lean source view module on GitHub

/-- E[I*D] under the uniform distribution on vertex permutations. -/
noncomputable def wild_joint_expected_ID (q : ℕ) (A : Fin (3*q) → Fin (3*q) → Fin (3*q)) : ℝ := (1 / ((Nat.factorial (3*q) : ℕ) : ℝ)) * (Finset.univ.sum (fun σ : Equiv.Perm (Fin (3*q)) => (wild_joint_invalid_count q A σ : ℝ) * (wild_joint_bad_color_count q A σ : ℝ)))
See it in the graphDiscuss this resultChallenge it