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.

Vanishing tail control bounds truncated second moments

Statement

Let X be a real random variable with nP(∣X∣>n)→0 as positive integers n→∞. Then xP(∣X∣>x)→0 for real x→∞, and E[X21{∣X∣≤n}]n⟶0. Moreover E∣X∣p<∞ for every 0<p<1.

Facts & Assumptions

[F1]

Zero truncation at a positive level: For a real random variable X and a deterministic level A>0, its zero truncation is X(A)=X1{∣X∣≤A}. The threshold event is measurable because X is measurable and [−A,A] is Borel; its indicator and the product are measurable by thm-arithmetic-and-lattice-operations-preserve-measurability. Thus X(A) is a real random variable as in def-random-element-and-real-random-variable. It equals X at both cutoff endpoints and is zero outside the interval. Since ∣X(A)∣≤A, for every 0<p<∞ its absolute pth moment is at most ApP(Ω)=Ap. This is not clipping to the endpoints.

[F2]

For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function: Let (X,A,μ) be a measure space, let f:X→C be measurable, and let 0<p<∞. Then ∫X∣f∣p dμ=p∫0∞tp−1μ({∣f∣>t}) dt=p∫0∞tp−1Af(t) dt, where either side may be +∞.

Proof

Given: The objects and hypotheses of the statement.

1.1givenalgebra

For x≥1, put m=⌊x⌋. Monotonicity of the tail gives xP(∣X∣>x)≤(m+1)P(∣X∣>m), which tends to zero. Consequently h(t)=tP(∣X∣>t) is bounded on [0,∞) and tends to zero.

2.1F1F2step 1.1algebra

Apply layer cake with exponent 2 to X1{∣X∣≤n}. Its tail is at most that of ∣X∣ for t<n and is zero for t≥n. Thus its second moment is at most 2∫0nh(t) dt. If h(t)≤ε for t≥M, division by n bounds this by 2n−1∫0Mh(t) dt+2ε for n≥M. Let n→∞ then ε↓0. No moment assumption on the untruncated square was used.

3.1F2step 1.1algebra∎

For 0<p<1, layer cake gives E∣X∣p=p∫0∞tp−1P(∣X∣>t) dt. On (0,1) this is at most p∫01tp−1 dt=1. If h≤K, the remaining integral is at most pK∫1∞tp−2 dt=pK/(1−p)<∞. This also covers X=0 and bounded laws. Neither endpoint p=0 nor p=1 is asserted.

Depends on

Used by

Dependency tree · two levels

10 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