Documentation

LeanPool.RareSubtreePatterns.Stable.WalkCF

Characteristic function of the walk and Fourier inversion on ℤ #

For the step law X = K - 1 (PoissonDeclumping.stepLaw) and the walk law PoissonDeclumping.walkLaw μ n (an n-fold convolution, source lines 174–181, 842–845):

Compatibility name for the common step-law probability instance, without a new instance.

Compatibility name for the common walk-law probability instance, without a new instance.

noncomputable def PoissonDeclumping.Stable.stepCF (μ : PMF ℕ) (θ : ℝ) :

The characteristic function φ(θ) = E e^{iθX} of one step.

Equations
Instances For
    noncomputable def PoissonDeclumping.Stable.walkCF (μ : PMF ℕ) (n : ℕ) (θ : ℝ) :

    The characteristic function E e^{iθ S_n} of the walk at time n.

    Equations
    Instances For
      theorem PoissonDeclumping.Stable.integral_conv_int {W P : MeasureTheory.Measure ℤ} (F : ℤ → ℂ) :
      ∫ (z : ℤ), F z ∂W.conv P = ∫ (p : ℤ × ℤ), F (p.1 + p.2) ∂W.prod P
      theorem PoissonDeclumping.Stable.walkCF_eq_pow (μ : PMF ℕ) (n : ℕ) (θ : ℝ) :
      walkCF μ n θ = stepCF μ θ ^ n
      theorem PoissonDeclumping.Stable.charFun_walkLaw_map_div (μ : PMF ℕ) (n : ℕ) (c t : ℝ) :
      MeasureTheory.charFun (MeasureTheory.Measure.map (fun (z : ℤ) => ↑z / c) (walkLaw μ n)) t = stepCF μ (t / c) ^ n

      The characteristic function of S_n / c is φ(θ/c)^n.

      theorem PoissonDeclumping.Stable.walkLaw_real_singleton (μ : PMF ℕ) (n : ℕ) (k : ℤ) :
      ↑((walkLaw μ n).real {k}) = 1 / (2 * ↑Real.pi) * ∫ (θ : ℝ) in -Real.pi..Real.pi, stepCF μ θ ^ n * Complex.exp (-(↑θ * ↑k * Complex.I))

      Fourier inversion on ℤ: P(S_n = k) = (1/2π) ∫_{-π}^{π} φ(θ)^n e^{-ikθ} dθ.