Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

buchholz_pairing_equiv_two_cycle_type

Proved

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

buchholzcandes-rechtcycle-typeexact-matrix-completion

For each integer nnn, the type BuchholzPairing n represents pair partitions of 2n2n2n labelled positions as fixed-point-free involutions.

This theorem asserts that such pairings are equivalent to the subtype of permutations of Fin (2 * n) whose cycle type is exactly 2n2^n2n, i.e. nnn disjoint cycles of length 222:

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

This is the structural reason the Buchholz pair-count constant is the usual count of fixed-point-free involutions.

Preamble
import Definitions.Def_buchholz_pairing
import Mathlib.GroupTheory.Perm.Centralizer
open MatrixCompletion
Formal statement
theorem buchholz_pairing_equiv_two_cycle_type (n : Nat) :
    Nonempty (BuchholzPairing n ≃
      {g : Equiv.Perm (Fin (2 * n)) //
        g.cycleType = Multiset.replicate n 2}) := 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