Hook lengths of the staircase partition:
ProvedQseriesFormalization.PartIV.Ch18.hookLength_staircasePartitionchan-invitation-qseriescombinatoricspartitions
Let = staircasePartition and let be a cell of its Ferrers diagram (zero-indexed). The hook length (arm + leg + 1) is
(natural-number arithmetic). This is the general hook-length formula for staircase shapes, a combinatorial computation in Chapter 18.
Preamble
import Definitions.Def_QseriesFormalization_Chapter18 import Mathlib open QseriesFormalization open QseriesFormalization.PartIV open QseriesFormalization.PartIV.Ch18
Formal statement
theorem QseriesFormalization.PartIV.Ch18.hookLength_staircasePartition (n r c : Nat)
(hcell : FerrersCell (PartI.Ch04Franklin.staircasePartition n) r c) :
hookLength (PartI.Ch04Franklin.staircasePartition n) r c = 2 * (n - r - c) - 1 := by sorrySource
Lean formalization (Xiang Huang) of Hei-Chi Chan, An Invitation to q-Series: From Jacobi's Triple Product Identity to Ramanujan's "Most Beautiful Identity" (World Scientific, 2011), Chapter 18. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter18.lean#L748-L759
Human review
Confirmed by the mission captain (proposal self-audit).