Bell coefficient ratio with explicit saddle corrections
Provedbell_number_over_factorial_thirdOrderanalytic-combinatoricscoefficient-asymptoticslean4saddle-point
Let be the source's set-partition count and . Let be the chosen real solution of . Put
Define
Using the corrections
and the actual robust scale
the source proves
There are no public hypotheses: the named Bell constructions supply the admissibility and local/tail estimates. Factorial normalization is retained. In this theorem exactly; the additional correction does not assert a sharper third-order error scale. The statement uses the actual decorated-partition class, with no invented bridge to a separate symbol. It is an eventual asymptotic, not a finite-index ratio formula at .
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_SaddlePoint_BellThirdOrder import Mathlib.Analysis.Real.Pi.Bounds import Mathlib import Mathlib.Analysis.SpecialFunctions.Stirling import Mathlib.Probability.Distributions.Gaussian.Real import Mathlib.RingTheory.PowerSeries.Exp import Mathlib.Analysis.SpecialFunctions.ExpDeriv import Mathlib.Analysis.SpecialFunctions.Exponential import Mathlib.Analysis.Analytic.Composition import Mathlib.RingTheory.PowerSeries.Substitution import Mathlib.Analysis.Analytic.Basic import Mathlib.Analysis.Analytic.OfScalars import Mathlib.Analysis.Analytic.RadiusLiminf import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Algebra.Algebra.Rat import Mathlib.Data.Complex.Basic import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.RingTheory.PowerSeries.NoZeroDivisors import Mathlib.RingTheory.PowerSeries.PiTopology import Mathlib.Combinatorics.Enumerative.Composition import Mathlib.Data.Nat.Fib.Basic import Mathlib.Order.Partition.Finpartition import Mathlib.RingTheory.PowerSeries.Derivative import Mathlib.Data.Fintype.EquivFin import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.GroupTheory.Perm.Basic import Mathlib.Data.Fintype.Perm import Mathlib.Data.Fintype.Card import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Data.Fintype.Powerset set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Third-order saddle data for Bell numbers This file instantiates the third-order Hayman wrapper for `exp (exp z - 1)`. The fifth and sixth logarithmic saddle derivatives are the next two Touchard polynomials evaluated at the Bell saddle. -/ open Complex Filter Asymptotics MeasureTheory open scoped Topology Real NNReal ENNReal Interval PowerSeries set_option maxHeartbeats 1400000 set_option linter.unusedSimpArgs false set_option linter.unnecessarySimpa false
Formal statement
theorem bell_number_over_factorial_thirdOrder :
(fun n : ℕ =>
(((AnalyticCombinatorics.Ch1.CombClass.posInt.set.counts n : ℝ) /
n.factorial : ℝ) : ℂ) / bellSecondOrderSaddleScale n -
(1 + (saddleCorrection bellSaddleBReal bellSaddleB3Real bellSaddleB4Real
(bellSaddleRadius n) : ℂ) +
(saddleThirdCorrection bellSaddleBReal bellSaddleB3Real bellSaddleB4Real
bellSaddleB5Real bellSaddleB6Real (bellSaddleRadius n) : ℂ)))
=o[atTop]
(fun n : ℕ => (bellThirdCorrScale (bellSaddleRadius n) : ℂ)) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).