Independent Poisson limit for fixed distinct permutation-cycle lengths
ProvedAnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS.Multivariate.multivariateLaw_tendsto_poissonPiFix a natural dimension and an injective map with for every . For each , choose one uniform permutation of and form its simultaneous cycle-count vector
Its pushforward probability measure on converges in the weak topology to
The positive cycle lengths are pairwise distinct, and both the dimension and every length remain fixed in the limit. Independence describes the finite product limit, not the finite- coordinates, which all come from the same permutation. Fixed points are included when a chosen length is . The case is the well-defined empty-vector/product law. No infinite-dimensional or process convergence, varying dimension/lengths, rate or total-variation conclusion is asserted. Positivity and injectivity are the only public hypotheses; the exact joint-count and mixed-moment formulas are proved source inputs.
import Definitions.Def_AnalyticCombinatorics_Ch9_LimitLaws_MultivariateCyclePoisson 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 /-! # Multivariate Poisson limits for finitely many cycle counts This file contains the finite-product discrete bridge and the basic singleton mass identities for vectors of cycle counts. -/ open Filter MeasureTheory open scoped Topology ENNReal NNReal open AnalyticCombinatorics open AnalyticCombinatorics.Ch9 open AnalyticCombinatorics.Ch9.LimitLaws open AnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS open AnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS.Multivariate -- The finite-product `HasSum` induction combines a dependent tail series with -- `HasSum.mul`; the local heartbeat bump prevents a deterministic timeout in -- the summability witness elaboration.
theorem AnalyticCombinatorics.Ch9.LimitLaws.RCyclesPoissonNS.Multivariate.multivariateLaw_tendsto_poissonPi {m : ℕ} (lengths : Fin m → ℕ)
(hpos : ∀ i : Fin m, 0 < lengths i) (hinj : Function.Injective lengths) :
Tendsto (fun n : ℕ => multivariateLaw n lengths) atTop
(𝓝 (poissonPiMeasure lengths)) := by sorry
Confirmed by the mission captain (proposal self-audit).