Support of successor predecessor-kernel powers
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.KPow_succ_supportanalytic-combinatoricskernel-algebralean4partitions-support
Let be arbitrary. Define the predecessor-truncated powers by
Every sum is finite, with the empty sum interpreted as zero. For all with ,
Thus every positive power is strictly lower triangular. No sign or stochasticity assumption on is required.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_KernelPow
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# R7 Fact B via Doeblin (File B): kernel composition and powers
Composition `KComp P Q n k = ∑_{j<n} P n j · Q j k` and the `L`-fold power `KPow L P` of a predecessor
kernel. Proves nonnegativity and (strict) predecessor-support preservation by induction on `L` — the
algebraic foundation for the finite-time Doeblin overlap and the `P^L`-harmonic identity for `hitVal`.
The identity kernel `KPow 0 = δ(k=n)` forces the *strict* support `n < k → · = 0`. Opus-authored.
-/
open AnalyticCombinatorics AnalyticCombinatorics.Ch8 AnalyticCombinatorics.Ch8.Partitions AnalyticCombinatorics.Ch8.Partitions.Erdos
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.KPow_succ_support {P : ℕ → ℕ → ℝ} (L : ℕ) {n k : ℕ} (hnk : n ≤ k) :
KPow (L + 1) P n k = 0 := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).