Poisson limit for a fixed positive permutation-cycle length
ProvedAnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS.Complete.rCycles_tendstoInDistribution_poissonanalytic-combinatoricslean4limit-lawsprobability
Fix a positive natural cycle length . For each , choose a permutation uniformly from the permutations of . Let be its number of cycles of length exactly , explicitly counting fixed points when . Then
The selected statement compares these random variables on their varying finite permutation spaces with the identity variable on under the Poisson measure of nonnegative-real rate . Only is a public premise. The genuine PMF/counting and factorial-moment inputs are supplied by source theorems. The length remains fixed as ; no growing-length limit, rate, finite- Poisson identity or independence of different cycle lengths is claimed. The unique empty permutation at has count zero.
Preamble
import Definitions.Def_AnalyticCombinatorics_Compatibility_TendstoInDistribution import Definitions.Def_AnalyticCombinatorics_Ch9_LimitLaws_RCyclesPoisson import Mathlib import Mathlib.MeasureTheory.Function.ConvergenceInDistribution import Mathlib.Combinatorics.Derangements.Exponential import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Completion of the fixed-length cycle Poisson limit This file proves the finite Bonferroni/factorial-moment inversion needed to identify the genuine `r`-cycle pmf with the closed inclusion-exclusion formula. -/ open Filter MeasureTheory open scoped Topology ENNReal NNReal open AnalyticCombinatorics open AnalyticCombinatorics.Ch9 open AnalyticCombinatorics.Ch9.LimitLaws open AnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS
Formal statement
theorem AnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS.Complete.rCycles_tendstoInDistribution_poisson {r : ℕ} (hr : 0 < r) :
AnalyticCombinatorics.Compatibility.TendstoInDistribution
(fun n (ω : Equiv.Perm (Fin n)) => rCycleCount n r ω)
atTop
(fun x : ℕ => x)
uniformPermMeasure
(ProbabilityTheory.poissonMeasure (poissonRate r)) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).