wild_joint_canonical_type_values
The four concrete triples have canonical orbit types 0,1,2,3 respectively.
Statement
theorem wild_joint_canonical_type_values (q : ℕ) (hq : 3 ≤ q) : wild_joint_canonical_type q hq (wild_joint_type_A q hq) = 0 ∧ wild_joint_canonical_type q hq (wild_joint_type_B q hq) = 1 ∧ wild_joint_canonical_type q hq (wild_joint_type_C q hq) = 2 ∧ wild_joint_canonical_type q hq (wild_joint_type_D q hq) = 3- Source
- step towards wild_one_bad_color_mixed_moment_formula_with_context
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- 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_type_AType-A triple {0,1,2}: contains the isolated vertex 0 and the canonical edge {1,2}; immediately whole-bad, so alpha at it is 1.
- wild_joint_type_BType-B triple {0,1,3}: contains the isolated vertex 0 but no canonical edge.
- wild_joint_type_CType-C triple {1,2,3}: contains the canonical edge {1,2} but not the isolated vertex 0.
- wild_joint_type_DType-D triple {1,3,5}: contains neither the isolated vertex 0 nor a canonical edge (three vertices from distinct pairs).
- 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 2
- 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…
The proof, explained
The canonical orbit type of a triple of indices is determined by two boolean criteria: whether it contains a pair matched under the canonical matching (adjacent pairs {2k-1, 2k}), and whether it contains the base index 0. The proof unfolds the definitions of the canonical type and the four representative triples A = {0, 1, 2}, B = {0, 1, 3}, C = {1, 2, 3}, and D = {1, 3, 5}, expanding the quantifiers into finite disjunctions over pairs. Finally, norm_num performs the elementary arithmetic to verify that the four triples have canonical types 0, 1, 2, and 3, respectively.
The definition of canonical type and the four candidate triples are unfolded, expanding the existential matching conditions into finite disjunctions over all pairs of elements.
After enabling classical reasoning, the simplifier unfolds the definitions of `wild_joint_canonical_type` and the four representative triples A = {0, 1, 2}, B = {0, 1, 3}, C = {1, 2, 3}, and D = {1, 3, 5}. It rewrites the nested existential quantifiers over these finite sets using `exists_mem_insert`, `mem_singleton`, and `exists_eq_left`, producing an explicit finite disjunction of matching checks for all pairs in each triple.
uses
exists_mem_insert,mem_singleton,exists_eq_leftclassical simp only [wild_joint_canonical_type,wild_joint_type_A,wild_joint_type_B, wild_joint_type_C,wild_joint_type_D,exists_mem_insert,mem_singleton,exists_eq_left]Each representative triple evaluates to its expected canonical orbit type: 0 for A, 1 for B, 2 for C, and 3 for D. automation
`norm_num` evaluates each branch of the conditionals by unfolding the definition of `wild_joint_canonical_matching` and translating equality of `Fin` terms to equality of natural numbers via `Fin.ext_iff`. It computes that {1, 2} is a canonical matching pair while no other pair from these triples is matched, and checks membership of 0 in each set, concluding that the four triples have canonical types 0, 1, 2, and 3, respectively.
uses
Fin.ext_iffnorm_num [wild_joint_canonical_matching,Fin.ext_iff]
exists_mem_insert- An existential quantifier over an inserted element and a set, (∃ x ∈ insert a s, p x), is equivalent to p a ∨ ∃ x ∈ s, p x.
mem_singleton- An element b belongs to the singleton set {a} if and only if b = a.
exists_eq_left- An existential statement (∃ a, a = a' ∧ p a) simplifies directly to p a'.
Fin.ext_iff- Two elements of Fin n are equal if and only if their underlying natural numbers are equal.
- The arithmetic evaluation of the matching condition on all pairs in each triple and the simplification of the nested conditionals are performed by norm_num without producing an explicit paper-style calculation.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finsetopen scoped BigOperators Classicalset_option maxHeartbeats 6000000set_option maxRecDepth 20000set_option synthInstance.maxSize 10000/-- canonical_type of the four representative triples = 0,1,2,3. -/theorem wild_joint_canonical_type_values (q : ℕ) (hq : 3 ≤ q) : wild_joint_canonical_type q hq (wild_joint_type_A q hq) = 0 ∧ wild_joint_canonical_type q hq (wild_joint_type_B q hq) = 1 ∧ wild_joint_canonical_type q hq (wild_joint_type_C q hq) = 2 ∧ wild_joint_canonical_type q hq (wild_joint_type_D q hq) = 3 := by classical simp only [wild_joint_canonical_type,wild_joint_type_A,wild_joint_type_B, wild_joint_type_C,wild_joint_type_D,exists_mem_insert,mem_singleton,exists_eq_left] norm_num [wild_joint_canonical_matching,Fin.ext_iff]