Renewal Hit Pot mathematical objects
DefinitionAnalyticCombinatorics_Ch8_Partitions_RenewalHitPotanalytic-combinatoricsinteger-partitionslean4
Given a kernel , a rank function, a cutoff and boundary values , hitVal P rank J φ is defined by well-founded recursion on : if its value is , and otherwise it is , the -weighted sum of its values at smaller arguments. It is the value at first entry below the rank cutoff.
Definition code
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# R7 renewal route: well-founded `Hit`/`Pot` potentials
The banked spine lemmas (`rec_iter_bound`, `pot_le_block_sum_of_leave`) take the `Hit`/`Pot`
fixed-point equations as hypotheses. This file constructs the actual functions by well-founded
recursion on `n` (the kernel `P n k` is summed over `Finset.range n`, so every recursive call is on
`k < n`). We sum over `(Finset.range n).attach` so each summand carries the membership proof
`k ∈ range n` (hence `k < n`) needed for termination, then recover the plain-`range` defining
equations via `Finset.sum_attach`. Opus-authored.
-/
noncomputable section
open Filter Topology
namespace AnalyticCombinatorics.Ch8.Partitions.Erdos
/-- Harmonic extension to the cutoff: `Hit J φ n = φ n` below the cutoff `rank n < J`, else the
`P`-average of `Hit` over predecessors. -/
noncomputable def hitVal (P : ℕ → ℕ → ℝ) (rank : ℕ → ℕ) (J : ℕ) (φ : ℕ → ℝ) : ℕ → ℝ
| n =>
if rank n < J then φ n
else ∑ k ∈ (Finset.range n).attach, P n k.1 * hitVal P rank J φ k.1
termination_by n => n
decreasing_by exact Finset.mem_range.mp k.2
end AnalyticCombinatorics.Ch8.Partitions.Erdos
Source