Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

buchholz_pairing_count_eq_two_cycle_type_card

Proved

by Shuze Chen · Jun 24, 2026 · Mathlib c5ea003 (Lean v4.30.0)

buchholzcandes-rechtcycle-typeexact-matrix-completionpair-partition

For each nnn, the type BuchholzPairing n consists of fixed-point-free involutions on the 2n2n2n labelled positions.

This theorem identifies its cardinality with the cardinality of the cycle-type class consisting of nnn disjoint 222-cycles:

∣BuchholzPairing(n)∣=#{σ∈S2n:cycleType⁡(σ)=2n}.|\mathrm{BuchholzPairing}(n)|=\#\{\sigma\in S_{2n}:\operatorname{cycleType}(\sigma)=2^n\}.∣BuchholzPairing(n)∣=#{σ∈S2n​:cycleType(σ)=2n}.

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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me