wild_joint_multiplicity
def
mu(T): the number of unordered vertex pairs {x,y} (x != y) whose witness support {x,y,A x y} equals T. Equals half the ordered count because A is symmetric; equals #{i in T : T contains a colour-i edge} when |T|=3.
Statement
noncomputable def wild_joint_multiplicity (q : ℕ) (A : Fin (3*q) → Fin (3*q) → Fin (3*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
- Used by 4
- wild_joint_first_block_mixed_reductionFor q>=3 and a normalized array, summing I times the whole-bad count D over all permutations equals q times the sum of first-block witness…
- 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…
- wild_joint_invalid_count_eq_sum_multiplicityFor every vertex permutation σ, the invalid-colour count I(σ) equals the sum, over the q blocks, of the witness-support multiplicity mu of…
- wild_joint_type_weightThe total mu-weight sum_T mu(T) * #{i : colour_type(T,i) = X} of triples whose colours have orbit type X relative to that triple. Its four…
Lean source view module on GitHub
/-- Multiplicity mu(T) of the witness support T (unordered-pair count). -/ noncomputable def wild_joint_multiplicity (q : ℕ) (A : Fin (3*q) → Fin (3*q) → Fin (3*q)) (T : Finset (Fin (3*q))) : ℕ := (Finset.univ.filter (fun p : Fin (3*q) × Fin (3*q) => p.1 ≠ p.2 ∧ ({p.1, p.2, A p.1 p.2} : Finset (Fin (3*q))) = T)).card / 2