Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Count of bounded normal-form indices

Proved
QAlgorithms.Papers.Independent.Intake100.P06.bounded_normal_form_index_count

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n≥0n\ge0n≥0 and r≥1r\ge1r≥1 be integers. Pair the 2n2n2n boundary vertices in unordered pairs and assign to each pair one label in {0,…,r−1}\{0,\ldots,r-1\}{0,…,r−1}, using the orientation from its smaller numbered endpoint to its larger numbered endpoint. Let In,rI_{n,r}In,r​ be this set of labelled pairings, which indexes the bounded normal-form words in Section 3.4. Then

∣In,r∣=rn∏k=0n−1(2k+1)=rn(2n−1)!!.|I_{n,r}|=r^n\prod_{k=0}^{n-1}(2k+1)=r^n(2n-1)!!.∣In,r​∣=rnk=0∏n−1​(2k+1)=rn(2n−1)!!.

The empty pairing has exactly one empty labelling, so the value at n=0n=0n=0 is 111.

This counts the indexed words independently of their possibly coincident images in a specialized algebra; it makes no independence assertion before admissibility.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P06
Formal statement
noncomputable section

open scoped BigOperators Classical TensorProduct

namespace QAlgorithms.Papers.Independent.Intake100.P06

open QAlgorithms.Papers.Independent.Support21.P14

/-- Section 3.4, PDF p.30: bounded normal-form INDEX count, independently of
possibly coincident specialized images. Label each strand once; n=0 gives 1. -/
theorem bounded_normal_form_index_count (n r : ℕ) (hr : 0 < r) :
    Nat.card (LabelledBrauerDiagram n r) = r ^ n * oddPairingCount n := by sorry

end QAlgorithms.Papers.Independent.Intake100.P06

end
Source
Cyclotomic Birman--Wenzl--Murakami algebras, I: Freeness and realization as tangle algebras, arXiv:math/0612064v5, PDF p. 30, Section 3.4: size of the bounded normal-form index family
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn and every positive natural number rrr, consider the set of pairs consisting of a fixed-point-free involution ppp of {0,…,2n−1}\{0,\ldots,2n-1\}{0,…,2n−1}, meaning p(p(i))=ip(p(i))=ip(p(i))=i and p(i)≠ip(i)\ne ip(i)=i for every iii, and a function assigning a label from {0,…,r−1}\{0,\ldots,r-1\}{0,…,r−1} to each iii with i<p(i)i<p(i)i<p(i). The cardinality of this set is

rn∏k=0n−1(2k+1).r^n\prod_{k=0}^{n-1}(2k+1).rnk=0∏n−1​(2k+1).

The statement includes n=0n=0n=0: the involution and labeling function then have empty domains, there is exactly one such pair, and both the empty product and r0r^0r0 equal 111.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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