Tail-sup summability in the globally forced zero regime
ProvedAnalyticCombinatorics.Ch8.Partitions.Erdos.tailsup_summableanalytic-combinatoricscontraction-recordslean4partitions-support
Let W:Nat→Real be nonnegative and globally bounded above, and let0<=q<1. Assume the displayed contraction for every natural R, with arbitrary B:Nat. These global hypotheses force W≡0, so every displayed tail supremum is0 and the resulting series is summable. This is the zero-sequence regime; it is not a summability producer for a nonzero oscillation sequence.
The full literal source contract is:
lemma tailsup_summable {W : ℕ → ℝ} {q M : ℝ} {B : ℕ}
(hWnn : ∀ R, 0 ≤ W R) (hWbd : ∀ R, W R ≤ M)
(hq0 : 0 ≤ q) (hq1 : q < 1)
(hcontract : ∀ R, W R ≤ q * sSup (W '' {s | R - B ≤ s})) :
Summable (fun R => sSup (W '' {s | R ≤ s}))
Preamble
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# R7 Fact B via Doeblin: the tail-sup of block oscillation is summable
The §9 connection's key device: if block oscillation `W ≥ 0` is bounded and satisfies the slab
contraction `W R ≤ q · sSup(W '' {s ≥ R−B})` (`0 ≤ q < 1`), then its tail-sup
`V R := sSup(W '' {s ≥ R})` is monotone-dominated, so `V R ≤ q · V(R−B)`, hence `Summable V`. This
turns the local (comparable-rank) contraction into a global summable bound, resolving the far-pair
obstruction. `csSup`-based. Opus-authored.
-/
Formal statement
theorem AnalyticCombinatorics.Ch8.Partitions.Erdos.tailsup_summable {W : ℕ → ℝ} {q M : ℝ} {B : ℕ}
(hWnn : ∀ R, 0 ≤ W R) (hWbd : ∀ R, W R ≤ M)
(hq0 : 0 ≤ q) (hq1 : q < 1)
(hcontract : ∀ R, W R ≤ q * sSup (W '' {s | R - B ≤ s})) :
Summable (fun R => sSup (W '' {s | R ≤ s})) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).