Rank Band Entrance mathematical objects (continued)
DefinitionAnalyticCombinatorics_Ch8_Partitions_RankBandEntrance_x1analytic-combinatoricsinteger-partitionslean4
Further source definitions of this module, published separately from its first definition file (which this one builds on).
def ceilBand (R A : ℕ) : Finset ℕ :=
Finset.filter (fun k => rnk k < R + A) (Finset.range ((R + A + 2) ^ 2))
Definition code
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_PartitionRenewal
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# TASK 11: the first-entrance (run-until-hit) rank-band Doeblin engine
The fixed-step-count overlap reductions (`ErdosAlignment`, `DoeblinWalls`) are *false* for far-apart
high ranks (rank drops by `O(1)` per step, so a rank-`1000R` chain and a rank-`1001R` chain have
disjoint `L`-step laws for any fixed `L`). This file builds the correct
device: the **first-entrance kernel** `enterBandKer P B`, which runs the chain *until* it enters a
finite rank band `B` — variable hitting time, not a fixed step count. Two chains starting from very
different heights both descend *through* the band, and their first-entrance laws overlap.
Steps A–D (this file) are deterministic and reuse the banked Doeblin contraction
(`doeblin_average_diff_bound`) and the banked tail-oscillation engine (`tailOsc`,
`tendsto_zero_of_step_contraction`, `tendsto_of_tail_osc_to_zero`); they do **not** depend on the
hard analytic overlap sublemma (Step E). Opus-authored.
-/
noncomputable section
open Filter Topology
namespace AnalyticCombinatorics.Ch8.Partitions.Erdos
/-! ## Step A — the first-entrance kernel -/
variable {P : ℕ → ℕ → ℝ} {B : Finset ℕ}
/-! ## Step B — the entrance decomposition for `hitVal` -/
/-! ## Step C — Doeblin contraction of the entrance average (wires `doeblin_average_diff_bound`) -/
/-! ## Step D — the descending-ceiling band and the abstract engine
The *band* used by the engine is the **finite ceiling down-set** `ceilBand R A` = all states of rank
`< R + A` (truncated to the recursion's finite range). This set is **unskippable on the way down**
(the chain can only enter it, never jump over it from above), so the first-entrance decomposition
holds with the harmonic hypothesis discharged at every off-band point (rank `≥ R + A ≥ J`). The
landed point's rank is `< R + A`; the engine then splits the band into the in-band overlap part
`[R, R+A)` and the **overshoot** part `[0, R)`, which carries an escape mass driving the residual
oscillation. A *fixed* band width `A` leaves a non-vanishing
escape floor (the genuine obstruction). -/
/-- The finite ceiling down-set `{k | rnk k < R + A}`, truncated to the enumeration window
`range ((R+A+2)^2)` (which contains every state of rank `< R+A`, since `rnk k < R+A ⟹ 3√k < R+A ⟹
k < (R+A)²/9 < (R+A+2)²`). -/
def ceilBand (R A : ℕ) : Finset ℕ :=
Finset.filter (fun k => rnk k < R + A) (Finset.range ((R + A + 2) ^ 2))
end AnalyticCombinatorics.Ch8.Partitions.Erdos
Source