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.
Expectation of a nonnegative or integrable random variable
Definition
Let be a probability space.
- If is measurable, its expectation is the extended-valued integral
- If or is integrable in the sense of Integrable real and complex functions, and their integrals, its expectation is again now a finite real or complex number.
For an integrable real random variable, where and are its positive and negative parts.
Depends on
Used by
- Inverse probability weighting for a causal mean Algorithm
- Self-normalized importance sampling Algorithm
- Standardization for a causal mean Algorithm
- Holder's inequality for random variables Corollary
- Layer-cake formulas for random variables Corollary
- Linearity, monotonicity, and the modulus bound for expectation Corollary
- Lyapunov central limit theorem Corollary
- Markov's inequality for random variables Corollary
- The expectation of an indicator is the probability of the event Corollary
- A random variable need not have a finite expectation Counterexample
- A supermartingale supremum threshold need not be attained Counterexample
- Almost-sure convergence does not imply convergence of expectations Counterexample
- An L1-bounded martingale need not converge in L1 Counterexample
- An unbounded predictable transform may lose integrability Counterexample
- Diminishing adaptation and uniform ergodicity need not give a strong law Counterexample
- Doob Lp maximal inequality excludes p equals one Counterexample
- Finite variance does not imply a sub-Gaussian tail Counterexample
- Identical distribution without independence can defeat the mean law Counterexample
- Integrable stopping time alone does not suffice for arbitrary martingale increments Counterexample
- Quadratic pure-birth rates can explode Counterexample
- Uniform moving support invalidates the naive score bound Counterexample
- Uniform payoff convergence does not imply gradient convergence Counterexample
- A metric for convergence in probability Definition
- Adapted and integrable stochastic process Definition
- Bias and mean squared error Definition
- Binary instrumental-variable potential-outcome setup Definition
- Binding function and indirect-inference target Definition
- Biological and technical replication model Definition
- Conditional expectation given a sigma algebra Definition
- Contamination-robust expected risk and tail risk Definition
- Continuous-time filtrations and all-pairs martingales Definition
- Control-variate estimators Definition
- Covariance matrix of a finite-dimensional random vector Definition
- Critical, detection, and quantification levels Definition
- Empirical, centered, and Rademacher processes Definition
- False discovery proportion, FDR, and FWER Definition
- Filtration-adapted stochastic-gradient oracles and Robbins–Monro updates Definition
- Finite-dimensional linear mixed model with explicit longitudinal roles Definition
- Fixed-design linear regression model Definition
- Ideal and finite-simulation synthetic likelihood Definition
…and 123 more results.
Dependency tree · two levels
11 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
- Rick Durrett, Probability: Theory and Examples, 5th ed., Sections 1.4 and 1.6 (standard reference, not scraped)
- S. R. S. Varadhan, Probability Theory, Section 1.6 (standard reference, not scraped)