buchholz_pairing_count_eq_two_cycle_type_card
Provedbuchholzcandes-rechtcycle-typeexact-matrix-completionpair-partition
For each , the type BuchholzPairing n consists of fixed-point-free involutions on the labelled positions.
This theorem identifies its cardinality with the cardinality of the cycle-type class consisting of disjoint -cycles:
It is the structural bridge between pair partitions and Mathlib's permutation cycle-type counting theorem.
Preamble
import Definitions.Def_buchholz_pairing import Mathlib.GroupTheory.Perm.Centralizer open MatrixCompletion
Formal statement
theorem buchholz_pairing_count_eq_two_cycle_type_card (n : Nat) :
Fintype.card (BuchholzPairing n) =
({g | g.cycleType = Multiset.replicate n 2} :
Finset (Equiv.Perm (Fin (2 * n)))).card := by
sorry
Source
Candes, Emmanuel, and Benjamin Recht. "Exact matrix completion via convex optimization." Communications of the ACM 55.6 (2012): 111-119.