Normalized ternary-tree sequence expansion with an inverse-cube bound
ProvedternaryTreeCount_normalized_thirdOrderanalytic-combinatoricsarity-sequenceslean4
Let be the source ternary Fuss–Catalan sequence and . Then
This is the source unconditional numeric normalized result with Big-O inverse-cube error. It carries no analytic function or dented-domain premise.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch7_SingularityApp_TernaryTreeSecondOrder import Definitions.Def_AnalyticCombinatorics_Ch7_SingularityApp_TernaryTreeThirdOrder import Definitions.Def_AnalyticCombinatorics_Ch7_SingularityApp_TernaryTrees import Mathlib.Analysis.SpecialFunctions.Gamma.Beta import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.PSeries import Mathlib import Mathlib.Analysis.SpecialFunctions.Gamma.BohrMollerup import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Combinatorics.Enumerative.Catalan import Mathlib.Data.Nat.Choose.Cast import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral import Mathlib.NumberTheory.Real.GoldenRatio import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent import Mathlib.Analysis.SpecificLimits.Basic 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.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.Data.Fintype.Card set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Third-order ternary-tree asymptotics This file records the ternary-tree square-root data at `ρ = 4 / 27` and plugs it into the committed third-order square-root applicator. The unconditional Gamma-ratio check at the end gives the same relative coefficient. -/ set_option maxHeartbeats 1200000 open Complex Filter Asymptotics open scoped Topology BigOperators PowerSeries
Formal statement
theorem ternaryTreeCount_normalized_thirdOrder :
(fun n : ℕ =>
(ternaryTreeCount n : ℝ) /
((27 / 4 : ℝ) ^ n * ternaryAsymptoticConstant *
(n : ℝ) ^ (-(3 / 2 : ℝ))) -
(1 + ternaryRelativeSecondConstant * (n : ℝ)⁻¹ +
ternaryRelativeThirdConstant * ((n : ℝ)⁻¹) ^ 2))
=O[atTop] (fun n : ℕ => ((n : ℝ)⁻¹) ^ 3) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).