Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Gaussian series norm tails and fourth moments

Statement

Assume Countable Choice. Let (ξj)j≥1 be given real random variables on a probability space such that every finite subfamily is independent and each variable has density (2π)−1/2e−z2/2. Let aj≥0 be deterministic with v:=∑jaj<∞, and put u:=sup⁡jaj and w:=∑jaj2. The nonnegative series Q:=∑jajξj2 is finite almost surely. Define N:=Q on that event and set N=0 on its null complement. Then EN2=v,EN4=v2+2w≤3v2. For every t>0, P{N2>v+2wt+2ut}≤e−t,P{N>v+2ut}≤e−t. The upper quantile q(t):=inf⁡{z≥0:P(N>z)≤e−t} is finite and satisfies P(N>q(t))≤e−t,q(t)≤v+2ut. These conclusions include v=0, in which case N=q(t)=0 almost surely. For a Gaussian series in a fixed orthonormal coordinate system with coordinate variances aj, N is its norm.

Facts & Assumptions

Given: The supplied independent standard-normal coordinates and summable nonnegative weights in the Statement.

[A1]

The Axiom of Countable Choice (ACω) is assumed; all countable coordinates are already given.

[F1]

Monotone convergence for the integral permits increasing limits of nonnegative measurable functions inside the integral.

[F2]

Chebyshev-Markov inequality for the integral bounds the probability that a nonnegative variable exceeds a positive level by its expectation divided by that level.

[F3]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions gives scalar affine substitution under Countable Choice. The supplied normal density already has total mass one.

[F4]

Expectations factor over finite products of independent random variables factors finite products of nonnegative or integrable functions of independent coordinates.

Proof

1.1givenA1F3F4algebra

Put Qn=∑j≤najξj2, vn=∑j≤naj, and wn=∑j≤naj2. On finite intervals integration by parts with ϕ′(x)=−xϕ(x) gives ∫x2kϕ(x) dx=[−x2k−1ϕ(x)]+(2k−1)∫x2k−2ϕ(x) dx. The boundary terms vanish at infinity; the integrals converge since a polynomial times e−x2/2 is bounded by a constant times e−x2/4, whose integral is finite by [F3] and the given unit Gaussian integral. Starting from ∫ϕ=1 therefore gives Eξj2=1 and Eξj4=3. Thus EQn=vn and finite independence gives EQn2=vn2+2wn. Also u≤v and w≤uv≤v2.

2.1F1F2step 1.1algebra

The measurable series Qn↑Q satisfies EQ=v by [F1]; hence Q<∞ almost surely, since [F2] gives P(Q≥r)≤v/r for every r>0. Extending N by zero on the null exceptional set does not change an integral. Applying [F1] also to Qn2↑Q2 proves EN4=v2+2w≤3v2.

2.2givenF2F3F4step 1.1algebrachoose

Suppose u>0. For 0<s<(2u)−1 the scalar substitution y=1−2saj x in [F3], using the supplied unit density, gives Eesajξj2=(1−2saj)−1/2. Finite factorization [F4] and the power-series inequality −log⁡(1−z)−z≤z2/[2(1−z)] for 0≤z<1 therefore give log⁡Ees(Qn−vn)=∑j≤n[−saj−12log⁡(1−2saj)]≤s2wn1−2us. If wn>0, apply [F2] to this exponential and choose s=t/(wn+2ut). Substitution gives −s(2wnt+2ut)+s2wn/(1−2us)=−t, so P{Qn>vn+2wnt+2ut}≤e−t. If wn=0, then Qn=vn=0 almost surely and this inequality is immediate.

3.1step 1.1step 2.1step 2.2algebra

The deterministic levels vn+2wnt+2ut converge to v+2wt+2ut. Whenever Q strictly exceeds this final level, sufficiently large n have Qn exceeding their corresponding levels. The probability of this eventual-event set is at most the lower limit of their probabilities, as follows directly by countable additivity applied to unions of intersections. Step 2.2 thus gives the first tail inequality. Since w≤uv and v+2uvt+2ut≤(v+2ut)2, the second follows. If u=0, all weights vanish and both bounds hold directly.

4.1step 2.1step 3.1algebra∎

The second tail bound makes the set defining q(t) nonempty and implies 0≤q(t)≤v+2ut. This set is upward closed. Every q(t)+1/n therefore belongs to it: by the definition of an infimum some member lies strictly below that number. The events {N>q(t)+1/n} increase to {N>q(t)}, so countable additivity gives P(N>q(t))≤e−t. When v=0, step 2.1 gives N=0 almost surely and the quantile is zero. Finally, in a fixed orthonormal system the squared norm of the finite Gaussian sum is Qn; finiteness of Q gives norm convergence of that series and the asserted norm interpretation.

Depends on

Used by

Dependency tree · two levels

38 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