One distinguished permutation cycle has logarithmic normalized counts
ProvedAnalyticCombinatorics.cycleMarkedPermClass_counts_div_factorial_isEquivalentanalytic-combinatoricscycle-productslean4
The source labelled product allocates disjoint blocks of a label set to its factors. Let be the actual finite permutation type and , so one cycle is distinguished. Let be the source cycle class formed from single-cycle permutations modulo reversal, restricted to lengths at least three. For the class ,
This is the exact source labelled-product model, without adding a transport to another permutation datatype.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch1_OGF_Defs import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_Defs import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledProduct import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledSet import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledPower import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledSetOde import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledSeq import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledCyc import Definitions.Def_AnalyticCombinatorics_Ch7_SingularityApp_CycleMarkedPermPairs import Mathlib import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent import Mathlib.Data.Finset.Powerset import Mathlib.Tactic import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Data.Fintype.Powerset import Mathlib.RingTheory.PowerSeries.Derivative import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.RingTheory.PowerSeries.Exp import Mathlib.GroupTheory.Perm.Basic import Mathlib.Data.Fintype.Perm import Mathlib.Analysis.Analytic.Composition import Mathlib.RingTheory.PowerSeries.Substitution import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Analysis.Analytic.Binomial 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.Data.Fintype.Card import Mathlib.Order.Partition.Finpartition import Mathlib.Data.Fintype.EquivFin import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.RingTheory.PowerSeries.NoZeroDivisors import Mathlib.RingTheory.PowerSeries.PiTopology import Mathlib.Analysis.SpecialFunctions.Gamma.Beta import Mathlib.Analysis.SpecificLimits.Basic 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.SpecialFunctions.Choose import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Analysis.Meromorphic.Order import Mathlib.Analysis.Complex.Basic import Mathlib.Data.Nat.Fib.Basic import Mathlib.Combinatorics.Enumerative.Composition import Mathlib.Analysis.Complex.Liouville namespace AnalyticCombinatorics.Ch5.Meromorphic.Alignments end AnalyticCombinatorics.Ch5.Meromorphic.Alignments set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open Complex Filter Asymptotics open scoped Topology BigOperators PowerSeries open AnalyticCombinatorics open AnalyticCombinatorics.Ch1 open AnalyticCombinatorics.Ch5.Meromorphic.Alignments
Formal statement
theorem AnalyticCombinatorics.cycleMarkedPermClass_counts_div_factorial_isEquivalent :
(fun n : ℕ => (cycleMarkedPermClass.counts n : ℝ) / (n.factorial : ℝ)) ~[atTop]
(fun n : ℕ => Real.log n) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).