Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

One-sided maximal inequality for symmetric independent sums

Statement

For independent symmetric real random variables X1,…,Xn, n≥1, let Sk=∑j=1kXj. For every real a, P(max⁡1≤k≤nSk>a)≤2P(Sn>a). Consequently for every t>0, P(max⁡1≤k≤n∣Sk∣>t)≤2P(∣Sn∣>t). No moment assumptions are needed.

Facts & Assumptions

[F1]

Symmetric real random variables: A real random variable X is symmetric if its law as defined in def-law-or-distribution-of-a-random-element equals the law of −X. Equivalently, P(X∈B)=P(X∈−B) for every Borel B⊆R, where −B={−b:b∈B}. No existence of an expectation is assumed in this definition. In particular atoms, including an atom at zero, are allowed.

[F2]

Disjoint groups of an independent sigma-algebra family remain independent: Let (Fi)i∈I be an independent family of sigma-algebras on a probability space, and let J0,…,Jm−1⊆I be pairwise disjoint index sets. For each r<m, define Gr:=σ(⋃i∈JrFi). Then the sigma-algebras G0,…,Gm−1 are independent.

[F3]

Measurable coordinatewise functions preserve independence: Let (Xi)i∈I be an independent family of random elements Xi:(Ω,F,P)→(Si,Σi). For each i, let gi:(Si,Σi)→(Ti,Ti) be measurable. Then the family (gi∘Xi)i∈I is independent.

[F4]

Independent random elements have product joint law: Let n≥1, and let Xi:(Ω,F,P)→(Si,Σi) for i<n be independent random elements. Define X=(X0,…,Xn−1):Ω→∏i<nSi. Then X is a random element of (∏i<nSi,⨂i<nΣi), and its law is the finite product of the marginal laws: PX=⨂i<nPXi.

Proof

Given: The objects and hypotheses of the statement.

1.1F2F3F1givenF4

Let Ak={Sj≤a (j<k), Sk>a}. They partition the crossing event. The unused tail Rk=Sn−Sk is independent of the past by grouping. Its law is symmetric: the independent marginal laws are unchanged when each remaining variable is negated, so their sum has the same law as its negative. Hence P(Rk≥0)≥1/2, including Rn=0.

2.1step 1.1algebra

On Ak∩{Rk≥0} one has Sn>a. Independence gives P(Ak∩{Rk≥0})≥P(Ak)/2. These events are disjoint over k, so summing proves the one-sided assertion. The argument works unchanged at a=0 and at negative a.

3.1F3step 2.1algebra∎

Apply that assertion to (Xj) and (−Xj). The event of a strict absolute crossing of t is contained in the union of a positive and a negative crossing. Their final events {Sn>t} and {−Sn>t} are disjoint for t>0, giving the displayed two-sided bound. Atoms at thresholds do not enter the strict events.

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources