Number of staircase rows longer than is
ProvedQseriesFormalization.PartIV.Ch18.filter_staircasePartition_lengthchan-invitation-qseriescombinatoricspartitions
The staircase partition staircasePartition is the list of row lengths . For all natural numbers , the number of rows whose length exceeds is (natural-number subtraction, so if ). This counting lemma is an input for hook-length computations on staircase Ferrers diagrams in Chapter 18.
Preamble
import Definitions.Def_QseriesFormalization_Chapter04_FranklinPentagonal import Mathlib open QseriesFormalization
Formal statement
theorem QseriesFormalization.PartIV.Ch18.filter_staircasePartition_length (n c : Nat) :
((PartI.Ch04Franklin.staircasePartition n).filter (fun rowLength => c < rowLength)).length =
n - c := 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#L706-L719