Killed Kernel Pow mathematical objects
DefinitionAnalyticCombinatorics_Ch8_Partitions_KilledKernelPowanalytic-combinatoricsinteger-partitionslean4
Finite downward-kernel composition and its natural iterates are defined explicitly, with the zeroth power equal to the identity kernel.
Definition code
import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # R7 Fact B via Doeblin (killed kernel): boundary-absorbing kernel powers The killed kernel `P̃` (predecessor steps above the cutoff, identity-absorb on the boundary) has support `k ≤ n` (predecessor OR diagonal), so its composition sums over `range (n+1)`. This file builds `KCompK`/`KPowK` and proves nonnegativity and the support `n < k → · = 0`. The `L`-fold killed power is the law used in the Doeblin pairwise contraction for the exactly-harmonic `hitVal`. Opus-authored. -/ noncomputable section namespace AnalyticCombinatorics.Ch8.Partitions.Erdos /-- Killed-kernel composition (sum over `range (n+1)`, allowing the diagonal). -/ def KCompK (P Q : ℕ → ℕ → ℝ) : ℕ → ℕ → ℝ := fun n k => ∑ j ∈ Finset.range (n + 1), P n j * Q j k /-- `L`-fold killed-kernel power; `KPowK 0` is the identity kernel `δ(k=n)`. -/ def KPowK : ℕ → (ℕ → ℕ → ℝ) → ℕ → ℕ → ℝ | 0, _ => fun n k => if k = n then 1 else 0 | L + 1, P => KCompK P (KPowK L P) end AnalyticCombinatorics.Ch8.Partitions.Erdos
Source