wild_joint_canonical_matching
def
The fixed matching on Fin (3q) with isolated vertex 0 and pairs {2k-1, 2k} for k >= 1: (1,2),(3,4),(5,6),...
Statement
def wild_joint_canonical_matching (q : ℕ) : Fin (3*q) → Fin (3*q) → Prop
- Source
- step towards wild_one_bad_color_mixed_moment_formula_with_context
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 10
- wild_joint_canonical_matching_is_involutionFor odd q>=3, the canonical matching on Fin(3q) is precisely the off-diagonal part of an involution whose unique fixed point is0. The…
- wild_normalized_color_canonical_isomorphismFor odd q>=3, every chosen color of a symmetric idempotent row-injective array on Fin(3q) is carried to the canonical matching by a vertex…
- wild_joint_alpha_type_well_defined_oddFor odd q>=3, any two three-element subsets of the same canonical type have equal conditional whole-bad probabilities alpha. This…
- wild_joint_canonical_typeThe orbit type in {0,1,2,3} of a triple T relative to the fixed canonical matching: 0 (=A) if T contains a canonical edge and 0; 1 (=B) if…
- wild_joint_canonical_type_valuesThe four concrete triples have canonical orbit types 0,1,2,3 respectively.
- wild_joint_conditional_bad_eq_alpha_of_color_typeFor odd q>=3 and a normalized symmetric row-injective array, the conditional probability that a chosen WHOLE color is bad, given a…
- 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_even_canonical_orbit_obstructionAt q=4, the canonical triples {1,2,11} and {1,2,3} have the same declared type, but their conditional whole-bad matching probabilities are…
- wild_joint_alpha_eq_of_matching_isomorphismA permutation preserving the canonical matching and carrying one conditioning set to another preserves its conditional whole-bad…
- wild_joint_alphaalpha(T): the conditional probability, under the uniform distribution on all vertex permutations σ, that the fixed canonical matching is…
Lean source view module on GitHub
/-- Canonical matching: 0 isolated, pairs {2k-1,2k}. -/ def wild_joint_canonical_matching (q : ℕ) : Fin (3*q) → Fin (3*q) → Prop := fun a b => a ≠ b ∧ 1 ≤ min a.val b.val ∧ min a.val b.val % 2 = 1 ∧ max a.val b.val = min a.val b.val + 1