Convergence from comparable contraction and carried summability
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.tendsto_of_comparable_contractionanalytic-combinatoricscontraction-recordslean4partitions-support
Abstract center-tracking convergence packaging with summability carried; no construction of partition center links.
The full literal source contract is:
theorem tendsto_of_comparable_contraction {h c V : ℕ → ℝ} {rank : ℕ → ℕ}
(hrank : Tendsto rank atTop atTop)
(hVtend : Tendsto V atTop (𝓝 0))
(hVsum : Summable V)
(htrack : ∀ n, |h n - c (rank n)| ≤ V (rank n))
(hlink : ∀ R, |c (R + 1) - c R| ≤ V R) :
∃ L : ℝ, Tendsto h atTop (𝓝 L)
Preamble
import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # R7 Fact B via Doeblin: comparable-pair contraction ⟹ convergence (center-tracking packaging) The far-pair obstruction is resolved by center-tracking: it suffices to control *comparable*-rank oscillation (block centers `c` and a block-oscillation bound `V`), with far pairs handled by the summable center links. This lemma packages `tendsto_of_center_tracking` into the form produced by the windowed-coupling ITER: a summable block-oscillation bound `V → 0` with `|h n − c(rank n)| ≤ V(rank n)` (tracking) and adjacent centers `|c(R+1) − c R| ≤ V R` forces `h` to converge. Opus-authored. -/ open Filter Topology
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.tendsto_of_comparable_contraction {h c V : ℕ → ℝ} {rank : ℕ → ℕ}
(hrank : Tendsto rank atTop atTop)
(hVtend : Tendsto V atTop (𝓝 0))
(hVsum : Summable V)
(htrack : ∀ n, |h n - c (rank n)| ≤ V (rank n))
(hlink : ∀ R, |c (R + 1) - c R| ≤ V R) :
∃ L : ℝ, Tendsto h atTop (𝓝 L) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).