Factorial-normalized ordered nonempty-block counts
ProvedAnalyticCombinatorics.Ch5.Meromorphic.Surjections.surjectionsCount_div_factorial_isEquivalentanalytic-combinatoricslean4meromorphic-counts
Let be the source labelled sequence of the class with one object in every positive size and none in size zero (CombClass.posInt.lseq), with its literal finite fibre model. Then, after rational normalization and embedding into ,
No additional bijection with a separately defined surjection datatype is asserted.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch5_Meromorphic_Surjections import Mathlib import Mathlib.Analysis.Analytic.Composition import Mathlib.RingTheory.PowerSeries.Substitution import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent import Mathlib.RingTheory.PowerSeries.Exp 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.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.WellKnown import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.Meromorphic.Order import Mathlib.Analysis.Complex.Basic import Mathlib.Order.Partition.Finpartition import Mathlib.RingTheory.PowerSeries.Derivative import Mathlib.Data.Fintype.EquivFin 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 open Complex Filter Asymptotics open scoped ENNReal NNReal PowerSeries Topology open AnalyticCombinatorics open AnalyticCombinatorics.Ch5 open AnalyticCombinatorics.Ch5.Meromorphic open AnalyticCombinatorics.Ch5.Meromorphic.Surjections open AnalyticCombinatorics.Ch1 open AnalyticCombinatorics.Ch5.Meromorphic.Surjections.PowerSeries
Formal statement
theorem AnalyticCombinatorics.Ch5.Meromorphic.Surjections.surjectionsCount_div_factorial_isEquivalent :
(fun n : ℕ =>
algebraMap ℚ ℂ ((surjectionsCount n : ℚ) / (n.factorial : ℚ)))
~[atTop]
(fun n : ℕ => (1 : ℂ) / (2 * (((Real.log 2 : ℝ) : ℂ) ^ (n + 1)))) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).