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.
Variance of a centered random weighted sum
Statement
Let . Let be mutually independent real random variables with finite second moments, means , and variances . Let be a real random vector whose coordinates have finite second moments, and suppose the random elements and are independent. The coordinates of need not be mutually independent. For , the variable is square-integrable, , and
Facts & Assumptions
Given: Mutually independent centered square-integrable real random variables and a square-integrable random vector independent of the vector .
Independence of random elements means independence of their generated sigma-algebras. (Independent random elements)
The joint law of a finite family of independent random elements is the product of their marginal laws. (Independent random elements have product joint law)
Measurable coordinatewise maps preserve independence. (Measurable coordinatewise functions preserve independence)
Expectations of products of independent integrable random variables factor, and the product is integrable. (Expectations factor over finite products of independent random variables)
Sums, products, and lattice operations of measurable real-valued functions used here are measurable. (Arithmetic and lattice operations preserve measurability whenever they are defined)
If , then . (Cauchy-Schwarz for random variables)
Expectation is integration against the probability measure. (Expectation of a nonnegative or integrable random variable)
For a square-integrable real random variable , . (Moments, variance, and covariance on a probability space)
Expectation is linear in scalar multiples and binary sums of integrable random variables; repeated use gives the finite-sum rule. (Linearity, monotonicity, and the modulus bound for expectation)
Proof
Each and is integrable by [F6] applied with the constant random variable . Independence of the two random elements gives independence of and by [F1], so [F4] yields . Linearity [F9] over the finite index set gives .
Fix . The coordinate-product maps and are measurable by [F5]. Since the joint law of is the product law by [F2], these maps, one applied to each independent factor, give independent random variables and by [F3]. Both are integrable by [F6]. Also by [F4] and mutual independence of the weights. Hence [F4] gives .
For each , and are independent nonnegative random variables by [F2] and [F3]. Applying the nonnegative case of [F4] gives .
Expanding the finite square gives diagonal terms from step 1.3 and cross terms from step 1.2, so is integrable. Linearity [F9] gives . By step 1.1, ; [F7] and [F8] therefore identify this second moment with and prove the claim.
Depends on
- Cauchy-Schwarz for random variables
- Expectation of a nonnegative or integrable random variable
- Independent random elements
- Moments, variance, and covariance on a probability space
- Arithmetic and lattice operations preserve measurability whenever they are defined
- Expectations factor over finite products of independent random variables
- Independent random elements have product joint law
- Measurable coordinatewise functions preserve independence
- Linearity, monotonicity, and the modulus bound for expectation
Used by
Dependency tree · two levels
42 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
- Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun, Delving Deep into Rectifiers, §2.2 (standard reference, not scraped)
- Simon J. D. Prince, Understanding Deep Learning, §7.5.1 (standard reference, not scraped)
- Johns Hopkins University, Handout #8: Neural Network Training and Tokenization, §3 (standard reference, not scraped)