Logarithmic growth of restricted partition counts
ProvedAnalyticCombinatorics.Ch8.Partitions.Glaisher.glaisher_log_asymptoticanalytic-combinatoricslean4partitions-remainderrestricted
Fix an integer . Let be the number of partitions of whose parts are not divisible by , defined by the source restricted-partition finite type. Then
This is logarithmic growth, without a multiplicative asymptotic or an error rate.
The local source models, scales or predicates are defined exactly by:
noncomputable def rpart (m n : ℕ) : ℝ :=
((Nat.Partition.restricted n (fun k => ¬ m ∣ k)).card : ℝ)
noncomputable def cpart (m n : ℕ) : ℝ :=
(Fintype.card {p : Nat.Partition n // ∀ k ∈ p.parts, p.parts.count k < m} : ℝ)
noncomputable def Kglaisher (m : ℕ) : ℝ :=
(1 - 1 / (m : ℝ)) * A
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_GlaisherAsymptotic import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Glaisher open Filter open scoped BigOperators Topology Asymptotics -- This file reuses the partition Tauberian pipeline with a finite `Fin m` -- multiplicity model; the terminal finite-product and constant algebra proofs -- need the same local heartbeat headroom as the distinct-parts file. set_option maxHeartbeats 800000 /-! ### Finite count-restricted products -/ /-! ### Log-Laplace asymptotic -/ /-! ### Monotone transfer from cumulative sums to coefficients -/
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Glaisher.glaisher_log_asymptotic (m : ℕ) (hm : 2 ≤ m) :
Tendsto (fun n : ℕ => Real.log (rpart m n) / Real.sqrt n) atTop
(𝓝 (Real.pi * Real.sqrt (2 * (1 - 1 / (m : ℝ)) / 3))) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).