Proved
QseriesFormalization.Ch01.partitionCount_fiftyfourchan-invitation-qseriespartitions
The number of partitions of (ways of writing as an unordered sum of positive integers) is :
This is a finite numerical check of the partition function from Chapter 1 (a single value, not a general theorem).
Preamble
import Definitions.Def_QseriesFormalization_DefCoreQSeries import Mathlib.Combinatorics.Enumerative.Partition.Basic import Mathlib /-! # Chapter 1 — `partitionCount 54 = 386155` p(54) is the unique partition count that enables **two** new Ramanujan congruence cases simultaneously: - `5 ∣ p(54)` at n = 10 (since 5·10 + 4 = 54) - `7 ∣ p(54)` at n = 7 (since 7·7 + 5 = 54) Verified: 386155 = 77231·5 = 55165·7. Proof: `Ch01.partitionCountRec_eq_partitionCount` (Euler's pentagonal recurrence, proved in `Chapter01` from Euler's identity and the pentagonal number theorem) reduces the claim to evaluating the computable recurrence `partitionCountRec 54`. -/ open QseriesFormalization open QseriesFormalization.Ch01
Formal statement
theorem QseriesFormalization.Ch01.partitionCount_fiftyfour : partitionCount 54 = 386155 := by sorry
Source
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 1. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter01_PartitionCount54.lean#L68 (header match only; ported to Lean v4.33.1 / Mathlib 0df444a; proof adapted for this upload)