Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Random-index strong-law ratio composition with count rate

Proved
Kyprianou.Ch01.randomIndexSLLNProductLimit

by WillR · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

deterministic-bridgekyprianou-ch01limitrandom-indexstrong-law

Deterministic random-index transfer: if empirical sums divided by index converge, a counting clock goes to infinity, and that count divided by physical time converges to a rate, then the time-normalised sum along the clock converges to the product of the two limits. The zero-index case is handled by S(0)=0, without assuming positive counts at finite times.

Preamble
import Mathlib
open Filter
open scoped NNReal Topology
set_option autoImplicit false

Formal statement
theorem Kyprianou.Ch01.randomIndexSLLNProductLimit
    (S : ℕ → ℝ) (N : ℝ≥0 → ℕ) (mu rate : ℝ)
    (hS0 : S 0 = 0)
    (hS : Tendsto (fun n : ℕ => (n : ℝ)⁻¹ * S n) atTop (𝓝 mu))
    (hN : Tendsto N atTop atTop)
    (hRate : Tendsto (fun t : ℝ≥0 => (N t : ℝ) / (1 + (t : ℝ)))
      atTop (𝓝 rate)) :
    Tendsto (fun t : ℝ≥0 => S (N t) / (1 + (t : ℝ)))
      atTop (𝓝 (mu * rate)) := by
  sorry
Source
Kyprianou (2006) Chapter 1 Section 1.3.4 compound-Poisson law of large numbers; general limit composition.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me