Elementary anti-concentration for stopped bounded-increment martingales
ProvedKServer.martingale_abs_anticoncentrationAnti-concentration for finite discrete martingales: if the increments are bounded, , and the total conditional variance lies in the window on every path, then
i.e. — of order when the window is .
Role
This replaces Ibragimov's quantitative martingale central limit theorem in the Bubeck–Coester–Rabani lower bound (STOC 2023, Lemma 9): their stage-2a imbalance martingale is stopped when its accumulated conditional variance reaches , and the recurrence needs exactly — which this bound provides with a worse constant, absorbed into the choice of . Stopping is handled by zeroing increments beyond the stopping time, which stays inside the IsDiscreteMartingale interface.
Proof idea
Three elementary steps. (i) Orthogonality: . (ii) A fourth-moment bound : expanding , the odd term vanishes, the cross terms are dominated using and , and the accumulated grows to by conditional second-moment monotonicity. (iii) Cauchy–Schwarz twice, in polynomial form: and , so .
import Mathlib import Definitions.Def_KServer_discrete_martingale
namespace KServer
theorem martingale_abs_anticoncentration {Ω : Type*} [Fintype Ω] [DecidableEq Ω]
(P : Ω → ℝ) (N : ℕ) (hist : ℕ → Ω → ℕ) (X v : ℕ → Ω → ℝ)
(H : IsDiscreteMartingale P N hist X v) (γ B T₀ : ℝ) (hγ : 0 ≤ γ)
(hX : ∀ j, j < N → ∀ ω, |X j ω| ≤ γ)
(hv0 : ∀ j, j < N → ∀ ω, 0 ≤ v j ω)
(hVB : ∀ ω, ∑ j ∈ Finset.range N, v j ω ≤ B)
(hVT : ∀ ω, T₀ ≤ ∑ j ∈ Finset.range N, v j ω)
(hT₀ : 0 ≤ T₀) (hB : 0 ≤ B) (hPsum : ∑ ω, P ω = 1) :
T₀ ^ 3 ≤ (∑ ω, P ω * |mgSum X N ω|) ^ 2 * (8 * B ^ 2 + 3 * γ ^ 2 * B) := by sorry
end KServer