Three-term asymptotics of the Catalan numbers
Provedcatalan_complex_thirdOrderanalytic-combinatoricscatalan-numberscoefficient-asymptoticslean4three-term-expansion
Let be the natural Catalan number, with . As the natural index ,
The formal statement casts into , forms the displayed powers of in and then embeds them in . Its real error scale is the norm of . There are no public parameters or assumptions. This is an eventual expansion, not a finite-index identity at . It concerns the actual Catalan sequence; no additional tree-type cardinality equivalence is asserted.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch7_SingularityApp_CatalanThirdOrder import Mathlib.Combinatorics.Enumerative.Catalan import Mathlib.Data.Nat.Choose.Cast import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.PSeries import Mathlib.RingTheory.PowerSeries.Catalan import Mathlib.Analysis.SpecialFunctions.Gamma.Beta import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Analysis.SpecialFunctions.Gamma.BohrMollerup import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.Analytic.Basic import Mathlib.Analysis.Analytic.OfScalars import Mathlib.Analysis.Analytic.RadiusLiminf import Mathlib.Algebra.Algebra.Rat import Mathlib.Data.Complex.Basic import Mathlib.NumberTheory.Real.GoldenRatio import Mathlib.Analysis.SpecialFunctions.Choose import Mathlib.Data.Nat.Fib.Basic import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Analysis.Meromorphic.Order import Mathlib.Analysis.Complex.Basic import Mathlib.RingTheory.PowerSeries.NoZeroDivisors import Mathlib.Analysis.Complex.Liouville import Mathlib.Combinatorics.Enumerative.Composition import Mathlib.Data.Fintype.Card set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Third-order Catalan asymptotics This file proves the three-term Catalan asymptotic by combining the committed third-order model coefficient estimate with the exact central-binomial bridge. -/ set_option maxHeartbeats 1200000 open Complex Filter Asymptotics open scoped Topology BigOperators PowerSeries
Formal statement
theorem catalan_complex_thirdOrder :
(fun n : ℕ =>
(catalan n : ℂ) -
(4 : ℂ) ^ n *
(((catalanAsymptoticConstant * (n : ℝ) ^ (-(3 / 2 : ℝ)) +
catalanSecondAsymptoticConstant * (n : ℝ) ^ (-(5 / 2 : ℝ)) +
catalanThirdAsymptoticConstant * (n : ℝ) ^ (-(7 / 2 : ℝ)) : ℝ) : ℂ)))
=o[atTop]
(fun n : ℕ =>
‖(4 : ℂ) ^ n *
(((n : ℝ) ^ (-(7 / 2 : ℝ)) : ℝ) : ℂ)‖) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).