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.
A normal variable has finite fourth moment
Statement
Assume AC and let for . Then and ; in particular the fourth moment is finite. For independent centered normal coordinates , every finite linear combination of the variables has finite second moment.
Facts & Assumptions
Given: AC and a scalar centered normal variable with variance .
The Axiom of Choice and Standard normal and normal laws: the standard normal law is defined under AC and has density .
If are differentiable on with integrable, then : on finite intervals, under its stated integrability hypotheses.
The exponential dominates every fixed nonnegative integer power at : a fixed polynomial times tends to zero as and is integrable after comparison with a weaker Gaussian tail.
The exponential function is smooth and gives ; The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with gives for differentiable on an open interval. The product and scalar rules in Sums, scalar multiples, products and quotients: , , , and when give , so has derivative .
Expectations factor over finite products of independent random variables: for independent variables, integrable Borel functions of the individual variables have integrable product and factorized product expectation.
Proof
Let for . These integrals are finite: outside a bounded interval, is bounded by [F3], while is integrable by [F1] after scaling. Thus integration by parts on is valid, and its polynomial-exponential boundary terms vanish as by [F3].
Since is differentiable on and the exponential is differentiable at every , the chain rule in [F4] gives . All these functions and derivatives are continuous on , so the hypotheses of [F2] hold. Integration by parts gives and . Letting , [F3] makes the boundary terms vanish and [F1] gives and ; integration against the standard-normal density gives and .
If , the definition of is the law of , so and . If , almost surely and both formulas hold. For distinct indices , the squared coordinates are integrable by these second-moment formulas, so [F5] gives . For , the fourth-moment formula instead gives . Thus every term in the square of a finite linear combination of the is integrable, proving that combination has finite second moment; the empty combination is zero.
Depends on
- The Axiom of Choice
- Standard normal and normal laws
- The Gaussian integral $\int_{-\infty}^{\infty}e^{-x^2}\,dx=\sqrt{\pi}$
- If $u,v$ are differentiable on $[a,b]$ with $u',v'$ integrable, then $\int_a^b u v' = u(b)v(b)-u(a)v(a) - \int_a^b u'v$
- The exponential function is smooth and $(\exp)'=\exp$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The exponential dominates every fixed nonnegative integer power at $+\infty$
- Change of variable in an improper integral
- Expectations factor over finite products of independent random variables
Used by
Dependency tree · two levels
65 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
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, Chapter 2 §2.3 (standard reference, not scraped)
- David J. C. MacKay, Information Theory, Inference, and Learning Algorithms, Chapter 12 §12.3 (standard reference, not scraped)