Count of bounded normal-form indices
ProvedQAlgorithms.Papers.Independent.Intake100.P06.bounded_normal_form_index_countLet and be integers. Pair the boundary vertices in unordered pairs and assign to each pair one label in , using the orientation from its smaller numbered endpoint to its larger numbered endpoint. Let be this set of labelled pairings, which indexes the bounded normal-form words in Section 3.4. Then
The empty pairing has exactly one empty labelling, so the value at is .
This counts the indexed words independently of their possibly coincident images in a specialized algebra; it makes no independence assertion before admissibility.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P06
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every positive natural number , consider the set of pairs consisting of a fixed-point-free involution of , meaning and for every , and a function assigning a label from to each with . The cardinality of this set is
The statement includes : the involution and labeling function then have empty domains, there is exactly one such pair, and both the empty product and equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.