Logarithmic growth of integer partition counts
ProvedAnalyticCombinatorics.Ch8.Partitions.partition_log_isEquivalentanalytic-combinatoricsasymptoticshardy-ramanujaninteger-partitionslean4
For a natural number , let be the cardinality of the finite type of unordered partitions of into positive integer parts, viewed as a real number. Thus and . Then
The logarithm is the real natural logarithm and the square root is the nonnegative real square root. The displayed asymptotic equivalence means that the quotient tends to ; its comparison is eventually positive. Equivalently, the logarithmic error is . No smaller error rate or multiplicative asymptotic for is asserted by this target alone. The selected source theorem has no public parameters or assumptions, with its Laplace and Tauberian inputs supplied by earlier source theorems. The claim is eventual and is not a quotient identity at .
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_UpperBound import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions open Filter open scoped BigOperators Topology Asymptotics -- The final transfer combines real logarithm/square-root limits with field -- simplification; this keeps those terminal proofs within the local file. set_option maxHeartbeats 400000
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.partition_log_isEquivalent :
(fun n : ℕ => Real.log (part n)) ~[atTop]
(fun n : ℕ => Real.pi * Real.sqrt (2 * (n : ℝ) / 3)) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).