Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Finite variance does not imply a sub-Gaussian tail

Statement refuted

Every centered real random variable with finite variance is sub-Gaussian with some finite proxy.

Facts & Assumptions

Given: A countable atomic probability space, the real random variable defined below, and the meanings of expectation, variance, and sub-Gaussian proxy.

[F1]

A measure is nonnegative and countably additive, and a probability measure has total mass 1 (Measures on sigma-algebras, Probability measures and probability spaces).

[F2]

A real random variable is a measurable map to (R,B(R)) (Random elements and real random variables).

[F3]

Expectation is integration against the probability measure, and the variance of a square-integrable real variable is E[(X−EX)2] (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).

[F4]

A series is the limit of its partial sums when those partial sums converge; a nonnegative series with bounded partial sums converges to their supremum (Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[F5]

Increasing nonnegative functions pass to their limit under the integral (Monotone convergence for the integral).

[F6]

A centered variable with sub-Gaussian proxy σ2 satisfies P(∣X∣≥t)≤2e−t2/(2σ2) for σ2>0, and its positive-threshold tail is zero for σ2=0 (Finite sub-Gaussian maxima and epsilon-net reduction).

[F7]

For every positive a and natural m, xm/eax→0 as x→+∞ (The exponential dominates every fixed nonnegative integer power at +∞).

Counterexample

1.1givenF4algebra

Let S=∑k=1∞k−4. Its partial sums are increasing, and for k≥2, k−4≤k−2≤1/[k(k−1)]=1/(k−1)−1/k; hence 1≤S≤2 and S is finite by [F4]. Set c=(2S)−1>0.

1.2givenF1F4algebra

Enumerate Ω={(k,s):k≥1, s∈{−1,1}} by ω2k−1=(k,1), ω2k=(k,−1), and assign each atom weight w2k−1=w2k=ck−4. Define P(A)=∑j≥1wj1A(ωj) for A⊆Ω. The weights are nonnegative and sum to 2cS=1, so all subseries converge by [F4]. For pairwise disjoint Ar, put arj=wj1Ar(ωj) and qj=∑rarj; at most one term in each qj is nonzero. For every finite atom prefix J, only finitely many Ar meet that prefix, so finite regrouping gives ∑j=1Jqj=∑r∑j=1Jarj≤∑rP(Ar). Taking the supremum over J yields P(⋃rAr)≤∑rP(Ar). Conversely, for each finite event prefix R and each δ>0, convergence of the finitely many subseries lets us choose one atom prefix J for which ∑r=1RP(Ar)−δ≤∑r=1R∑j=1Jarj≤∑j=1Jqj≤P(⋃rAr). Letting δ↓0 and then taking the supremum over R proves the reverse inequality. Thus [F1] makes P a probability measure.

1.3F1F2given

Define X(k,s)=sk on (Ω,P(Ω),P). It is a real random variable by [F2], since every preimage is a subset of the full-power-set sample space.

1.4F3F5algebra

By [F5] applied to finite atom prefixes, E∣X∣=2c∑k≥1k−3 and EX2=2c∑k≥1k−2. For k≥2, k−3≤k−2≤1/[k(k−1)], whose partial sums telescope to at most 1; hence both moments are finite, so X is integrable and square-integrable. The two atoms at each k have equal mass and opposite values; since E∣X∣<∞, their absolutely convergent contributions cancel and EX=0. By [F3], X is centered with finite variance Var⁡(X)=EX2.

2.1givenstep 1.2step 1.3

For every integer n≥1, the atoms (n,1) and (n,−1) give P(∣X∣≥n)≥2cn−4>0.

3.1F6step 2.1assume-contra

Suppose for contradiction that X has a finite sub-Gaussian proxy σ2. If σ2=0, [F6] contradicts the positive tail in step 2.1.

4.1F6F7F8step 2.1assume-contraalgebradischarge-contradiction: no finite proxy can satisfy the assumed bound∎

If σ2>0, [F6] gives 2cn−4≤P(∣X∣≥n)≤2e−n2/(2σ2). By [F8], n4e−n2/(2σ2)=(n2)2/en2/(2σ2), which tends to 0 by [F7] with x=n2, m=2, and a=1/(2σ2). It is eventually smaller than c, so the upper tail is eventually smaller than 2cn−4, contradicting step 2.1. Thus this centered finite-variance variable is not sub-Gaussian for any finite proxy.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

68 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