Alphabeta Math
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.

22 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Probability Spaces Random Variables and Expectation

1 · Prerequisites

2 · Summary

This page moves from measure spaces of total mass 1 to the standard probability toolkit built on them. The first block identifies the finite probability model with probability measures on finite full power sets, then defines random elements, laws, and distribution functions in a way that matches the earlier finite page exactly.

Expectation is defined as the ambient Lebesgue integral, so change of variables, layer-cake formulas, Jensen, Markov, Chebyshev, Holder, and Cauchy-Schwarz all become probability-space corollaries of the measure-theory backbone. The page closes with moments, variance, covariance, and the normal equations for best affine L2 prediction.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Basic identities for a probability measure

Statement

Let (Ω,F,P) be a probability space, let A,BF, and let (An)nN be events.

  1. P(Ac)=1P(A).
  2. If AB, then P(A)P(B).
  3. If AB, then P(BA)=P(B)P(A).
  4. P(nAn)n=0P(An), and for every natural m, P(n<mAn)n<mP(An).
  5. P(AB)=P(A)+P(B)P(AB).
  6. If AnA, then P(A)=supnP(An). If AnA, then P(A)=infnP(An).

Facts & Assumptions

Given: A probability space (Ω,F,P), events A,B, and an event sequence (An).

[L1]

A probability measure is a measure of total mass 1 (Probability measures and probability spaces).

[L2]

Measures are monotone, set differences subtract when the smaller set has finite measure, subadditivity holds, continuity from below holds, continuity from above holds once one set has finite measure, and finite inclusion-exclusion holds for finite-measure sets (Measures are monotone, Measure of a set difference when the smaller set has finite measure, Finite and countable subadditivity of measures, Continuity from below for measures, Continuity from above when one set has finite measure, Inclusion-exclusion for a nonempty finite family of finite-measure sets).

Proof

technique · direct
1.1

Because P(Ω)=1 by [L1] and AΩ, [L2] gives 1=P(Ω)=P(A)+P(Ac), so P(Ac)=1P(A). Monotonicity in [L2] also gives ABP(A)P(B).

L1L2
1.2

Since every probability is at most 1, the finite-measure hypotheses in [L2] apply to A, B, and AB. Thus if AB, then P(BA)=P(B)P(A), subadditivity gives the countable and finite union bounds, finite inclusion-exclusion gives P(AB)=P(A)+P(B)P(AB), and continuity from below and from above give the two monotone-limit formulas, because a decreasing probability sequence always has finite first term.

L1L2
2.1

Steps 1.1 and 1.2 are exactly the stated probability identities.

step 1.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Finite probability spaces are exactly finite full-power-set probability spaces

Statement

Let Ω be a finite set.

  1. If (Ω,w) is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities, then Pw(A):=ωAw(ω)(AΩ) is a probability measure on (Ω,P(Ω)).
  2. Conversely, if P is a probability measure on (Ω,P(Ω)), then w(ω):=P({ω})(ωΩ) makes (Ω,w) a finite probability space and P(A)=ωAw(ω)(AΩ).

These two constructions are inverse to each other. In particular, zero-weight outcomes remain genuine outcomes in both descriptions.

Facts & Assumptions

Given: A finite set Ω.

[L1]

A finite probability space is a finite set with nonnegative weights summing to 1, every subset is an event, and event probabilities are the corresponding sub-weight sums (Finite probability spaces, outcome weights, events, and event probabilities).

[L2]

A probability measure is a measure of total mass 1 (Probability measures and probability spaces).

[L3]

On a finite sigma-algebra, the atoms partition the space, every measurable set is the union of the atoms it contains, and a measure is the sum of the atom masses over those atoms (A measure on a finite sigma-algebra is a finite weighted sum over its atoms).

Proof

technique · direct
1.1

If (Ω,w) is a finite probability space, then [L1] already states that every subset of Ω is an event and that AωAw(ω) is its probability. Therefore Pw is a probability measure on (Ω,P(Ω)) by [L2].

L1L2
1.2

Conversely, let P be a probability measure on (Ω,P(Ω)) and put w(ω)=P({ω}). Each singleton is an atom of the full power-set sigma-algebra, and every AΩ is the union of the singletons it contains. Thus [L3] gives P(A)=ωAP({ω})=ωAw(ω). Taking A=Ω yields ωΩw(ω)=P(Ω)=1, and nonnegativity of w comes from the measure axioms inside [L2]. So (Ω,w) is a finite probability space.

L2L3
2.1

Step 1.1 constructs a full-power-set probability measure from any finite weight model, and step 1.2 recovers exactly those singleton weights from any full-power-set probability measure. Hence the two descriptions are equivalent, including the boundary case of outcomes with weight 0.

step 1.1step 1.2
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Agreement with the published finite probability-space definition

The earlier item Finite probability spaces, outcome weights, events, and event probabilities and the present measure-theoretic formulation describe the same finite object. The theorem above does not replace the published finite definition; it identifies it with the probability-measure language on the full power set.

This agreement keeps two boundary features visible. First, every subset of a finite sample space remains measurable. Second, an outcome of weight 0 is still part of the sample space, so a nonempty event may still have probability 0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Random elements and real random variables

Definition

Let (Ω,F,P) be a probability space and let (S,Σ) be a measurable space. A random element of S is a measurable map X:(Ω,F)(S,Σ) in the sense of A measurable function between measurable spaces.

When S=R and Σ=B(R) from The Borel sigma-algebra of a topological space, the map X is a real random variable.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Finite random variables are measurable

Statement

Let (Ω,w) be a finite probability space, and regard it as the probability space (Ω,P(Ω),Pw) from Finite probability spaces are exactly finite full-power-set probability spaces. Then every function X:ΩR is a real random variable.

In particular, the published finite definition Real random variables on finite probability spaces and their finite distributions is exactly the measure-theoretic definition on that full-power-set probability space.

Facts & Assumptions

Given: A finite probability space (Ω,w) and a function X:ΩR.

[L1]

The theorem on finite probability spaces identifies (Ω,w) with a probability measure on (Ω,P(Ω)) (Finite probability spaces are exactly finite full-power-set probability spaces).

[L2]

A real random variable is a measurable map from the sample-space sigma-algebra to (R,B(R)) (Random elements and real random variables).

[L3]

On a finite probability space, a real random variable is simply a function ΩR (Real random variables on finite probability spaces and their finite distributions).

Proof

technique · direct
1.1

By [L1], every subset of Ω is measurable. Hence for every Borel set BR, the preimage X1(B) is a subset of Ω, so it lies in P(Ω). Therefore X is measurable.

L1L2
2.1

Step 1.1 proves that every finite random variable in the sense of [L3] is a real random variable in the sense of [L2], so the two notions agree exactly on finite full-power-set probability spaces.

step 1.1L2L3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Law or distribution of a random element

Definition

Let X:(Ω,F,P)(S,Σ) be a random element. Its law or distribution is the set function PX:Σ[0,+],PX(B):=P(X1(B)).

Thus the law of X records the probability of each measurable target set by pulling it back to an event in the original probability space.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The law of a random element is a probability measure

Statement

Let X:(Ω,F,P)(S,Σ) be a random element. Then PX is a probability measure on (S,Σ).

Facts & Assumptions

Given: A random element X:(Ω,F,P)(S,Σ).

[L1]

The law is defined by PX(B)=P(X1(B)) (Law or distribution of a random element).

[L2]

A random element is measurable, so measurable target sets have measurable preimages (Random elements and real random variables).

[L3]

A probability measure is a measure with total mass 1 (Probability measures and probability spaces).

Proof

technique · direct
1.1

By [L2], every BΣ has X1(B)F, so [L1] is well defined. Also X1()= and X1(S)=Ω, so PX()=0,PX(S)=P(Ω)=1.

L1L2L3
1.2

If (Bn) is a pairwise disjoint sequence in Σ, then the preimages X1(Bn) are pairwise disjoint and X1(nBn)=nX1(Bn). Therefore PX(nBn)=P(nX1(Bn))=n=0P(X1(Bn))=n=0PX(Bn).

L1L2L3
2.1

Steps 1.1 and 1.2 show that PX is a measure of total mass 1, hence a probability measure by [L3].

step 1.1step 1.2L3
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Laws commute with measurable maps

Statement

Let X:(Ω,F,P)(S,Σ) be a random element, and let g:(S,Σ)(T,T) be measurable. Then gX is a random element and for every BT, PgX(B)=PX(g1(B)).

Facts & Assumptions

Given: A random element X and a measurable map g as in the Statement.

[L1]

Composition of measurable maps is measurable (Composition with a Borel measurable outer map preserves measurability).

[L2]

The law of a random element is defined by pullback of measurable target sets (Law or distribution of a random element).

[L3]

The law of any random element is a probability measure (The law of a random element is a probability measure).

Proof

technique · direct
1.1

By [L1], the composite gX is measurable, hence a random element.

givenL1
1.2

For every BT, (gX)1(B)=X1(g1(B)). Therefore [L2] gives PgX(B)=P((gX)1(B))=P(X1(g1(B)))=PX(g1(B)). This right-hand side is defined because [L3] makes PX a probability measure on (S,Σ).

L2L3
2.1

Steps 1.1 and 1.2 prove the measurable-map compatibility of laws.

step 1.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Cumulative distribution function of a real random variable

Definition

Let X be a real random variable. Its cumulative distribution function is the function FX:R[0,1],FX(x):=P(Xx)=PX((,x]).

The second expression is the same quantity written in terms of the law Law or distribution of a random element of X.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Probability laws correspond to distribution functions

Statement

Assume the Axiom of Countable Choice.

  1. Let X be a real random variable, let PX be its law, and let FX(x)=P(Xx). Then FX is nondecreasing and right-continuous, satisfies limxFX(x)=0,limx+FX(x)=1, and obeys PX((a,b])=FX(b)FX(a)(a<b).
  2. Conversely, if F:RR is nondecreasing and right-continuous with limxF(x)=0,limx+F(x)=1, then there is a unique Borel probability measure μ on R such that μ((a,b])=F(b)F(a)(a<b), equivalently F(x)=μ((,x])(xR).

Facts & Assumptions

Given: Countable Choice, a real random variable X, its law PX, and a function F as in part 2.

[L1]

The law PX is a probability measure on (R,B(R)) (Law or distribution of a random element, The law of a random element is a probability measure).

[L2]

For measures, monotonicity, set-difference subtraction, continuity from below, and continuity from above are available (Measures are monotone, Measure of a set difference when the smaller set has finite measure, Continuity from below for measures, Continuity from above when one set has finite measure).

[L3]

Assuming Countable Choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants, and the interval increments determine the measure (Assuming countable choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants).

Proof

technique · direct
1.1

If a<b, then (,a](,b], so [L1] and [L2] give FX(a)FX(b). Also (,b](,a]=(a,b], so the finite-measure difference formula from [L2] yields PX((a,b])=FX(b)FX(a).

L1L2
1.2

For fixed x, the sets (,x+1/n] decrease to (,x], and PX((,x+1])PX(R)=1. Hence [L2] gives right continuity of FX. Likewise (,n]R and (,n], so continuity from below and from above give limnFX(n)=1,limnFX(n)=0.

L1L2
1.3

Put G(x):=F(x)F(0). Then G is still nondecreasing and right-continuous, so [L3] gives a unique Borel measure μ finite on compact sets with μ((a,b])=G(b)G(a)=F(b)F(a)(a<b).

L3given
2.1

For fixed x, the sets (n,x] increase to (,x]. Hence [L2] and step 1.3 give μ((,x])=limnμ((n,x])=limn(F(x)F(n))=F(x). Applying continuity from below once more to (,n]R shows μ(R)=limnF(n)=1, so μ is a probability measure. If ν is another Borel probability measure with ν((,x])=F(x) for all x, then ν((a,b])=F(b)F(a)=μ((a,b]) for every a<b, and [L3] gives ν=μ.

L2L3step 1.3
3.1

Steps 1.1 and 1.2 prove part 1, and steps 1.3 and 2.1 prove part 2.

step 1.1step 1.2step 1.3step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Atoms and continuity points of a law

Definition

Let X be a real random variable with law PX and cumulative distribution function FX.

  • A point xR is an atom of the law of X when it is an atom of the Borel measure PX, equivalently when PX({x})>0.
  • A point xR is a continuity point of the law of X when FX is continuous at x.

The atom language belongs to the measure An atom of a measure on R, while the continuity-point language belongs to the distribution function Cumulative distribution function of a real random variable.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Expectation of a nonnegative or integrable random variable

Definition

Let (Ω,F,P) be a probability space.

  • If X:Ω[0,+] is measurable, its expectation is the extended-valued integral E[X]:=ΩXdP[0,+].
  • If X:ΩR or X:ΩC is integrable in the sense of Integrable real and complex functions, and their integrals, its expectation is again E[X]:=ΩXdP, now a finite real or complex number.

For an integrable real random variable, E[X]=E[X+]E[X], where X+ and X are its positive and negative parts.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Expectation depends only on the almost-everywhere class

Statement

If X and Y are integrable real or complex random variables on one probability space and X=Y almost surely, then E[X]=E[Y].

Thus expectation is a function of the L1-equivalence class.

Facts & Assumptions

Given: Integrable random variables X,Y on one probability space.

[L1]

Expectation is the Lebesgue integral with respect to the underlying probability measure (Expectation of a nonnegative or integrable random variable).

[L2]

Two integrable functions are equal almost everywhere exactly when all of their integrals over measurable sets agree (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).

Proof

technique · direct
1.1

Since X=Y almost surely and both are integrable, [L2] applied to the measurable set Ω gives ΩXdP=ΩYdP.

L2given
2.1

Rewriting the two integrals as expectations by [L1] yields E[X]=E[Y].

step 1.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Change of variables for expectation

Statement

Let X:(Ω,F,P)(S,Σ) be a random element, let PX be its law, and let g:(S,Σ)R or g:(S,Σ)C be measurable.

  1. If g0, then E[g(X)]=SgdPX.
  2. If g(X) is integrable, then g is integrable with respect to PX and the same formula holds: E[g(X)]=SgdPX.

Facts & Assumptions

Given: A random element X, its law PX, and a measurable map g as in the Statement.

[L1]

The law PX is a probability measure on (S,Σ) (Law or distribution of a random element, The law of a random element is a probability measure).

[L2]

Measurable outer maps preserve measurability under composition (Composition with a Borel measurable outer map preserves measurability).

[L3]

Every nonnegative measurable function is the increasing limit of nonnegative simple functions, monotone convergence holds, and the nonnegative integral agrees with the simple integral on simple functions (Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral, The nonnegative integral agrees with the simple integral on simple functions, The integral of a nonnegative simple function).

[L4]

Expectation is integration against P, and real or complex integrability uses the positive-negative and real-imaginary decompositions (Expectation of a nonnegative or integrable random variable, Integrable real and complex functions, and their integrals).

[L5]

Measurable functions are closed under the elementary operations used by the integral, and the Lebesgue integral is linear on L1 (Closure properties of measurable functions used by the integral, The Lebesgue integral is linear on L1(μ)).

Proof

technique · direct
1.1

By [L2], the composite gX is measurable. If s=j=1mcjχBj is a nonnegative simple function on S with the Bj pairwise disjoint, then sX=j=1mcjχX1(Bj) is a nonnegative simple function on Ω. Using [L1], [L3], and [L4], E[s(X)]=j=1mcjP(X1(Bj))=j=1mcjPX(Bj)=SsdPX.

L1L2L3L4
2.1

Assume now that g0. By [L3], choose nonnegative simple functions sng on S. Then snXgX by step 1.1, so monotone convergence on both spaces and step 1.1 give E[g(X)]=limnE[sn(X)]=limnSsndPX=SgdPX.

step 1.1L3L4
3.1

Assume g(X) is integrable. Then E[g(X)]<, so step 2.1 applied to g gives SgdPX=E[g(X)]<. Hence g is PX-integrable. For real-valued g, [L4] and [L5] give g=g+g with both parts nonnegative, so step 2.1 and linearity yield E[g(X)]=E[g+(X)]E[g(X)]=Sg+dPXSgdPX=SgdPX.

step 2.1L4L5
4.1

If g is complex-valued, write g=u+iv with real measurable parts u,v. The inequality u,vg and step 3.1 show that u(X) and v(X) are integrable, so the real-valued case applied to u and v, followed by complex-linearity from [L5], gives E[g(X)]=E[u(X)]+iE[v(X)]=SudPX+iSvdPX=SgdPX.

step 3.1L4L5
5.1

Step 2.1 proves the nonnegative case, while steps 3.1 and 4.1 prove the integrable real and complex cases.

step 2.1step 3.1step 4.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Expectation agrees with the published finite weighted sum

Statement

Let (Ω,w) be a finite probability space and let X:ΩR. After identifying (Ω,w) with the full-power-set probability space of Finite probability spaces are exactly finite full-power-set probability spaces, the expectation defined by Expectation of a nonnegative or integrable random variable agrees with the published finite formulas: E[X]=ωΩX(ω)w(ω)=xX(Ω)xP(X=x).

Facts & Assumptions

Given: A finite probability space (Ω,w) and a real-valued function X:ΩR.

[L1]

Finite probability spaces are exactly full-power-set probability spaces, and every finite real random variable is measurable there (Finite probability spaces are exactly finite full-power-set probability spaces, Finite random variables are measurable).

[L2]

Change of variables for expectation identifies E[X] with the integral of the identity function against the law of X (Change of variables for expectation).

[L3]

The published finite expectation is ωΩX(ω)w(ω), and it is also the sum over attained values weighted by their probabilities (Expectation of a real random variable on a finite probability space, Expectation is the sum of each attained value times its probability).

Proof

technique · direct
1.1

By [L1], the general expectation and the law of X are defined on the same full-power-set probability space attached to (Ω,w).

L1
2.1

Applying [L2] to the identity map on R gives E[X]=RxdPX. For a finite random variable, [L3] identifies this quantity with both ωΩX(ω)w(ω)andxX(Ω)xP(X=x).

step 1.1L2L3
3.1

Thus the general expectation is exactly the published finite weighted-sum expectation and its finite-distribution reformulation.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The expectation of an indicator is the probability of the event

Statement

Let (Ω,F,P) be a probability space and let AF. Then the indicator 1A satisfies E[1A]=P(A).

Facts & Assumptions

Given: A probability space (Ω,F,P) and an event A.

[L1]

Expectation of a nonnegative random variable is its integral with respect to P (Expectation of a nonnegative or integrable random variable).

[L2]

The complement identity gives P(Ac)=1P(A) (Basic identities for a probability measure).

[L3]

On nonnegative simple functions, the nonnegative integral is the simple integral jcjμ(Ej) (The nonnegative integral agrees with the simple integral on simple functions, The integral of a nonnegative simple function).

Proof

technique · direct
1.1

The function 1A is the simple function 1A=1χA+0χAc. Therefore [L1] and [L3] give E[1A]=1P(A)+0P(Ac).

L1L3
2.1

Using [L2] only to note that Ac is the complementary event in the same probability space, step 1.1 simplifies to E[1A]=P(A).

step 1.1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Layer-cake formulas for random variables

Statement

Let (Ω,F,P) be a probability space.

  1. If X:Ω[0,+] is measurable, then E[X]=0P(X>t)dt, where the right-hand side may be +.
  2. If X is an integrable real random variable, then E[X]=0P(X>t)dt0P(X<t)dt.

Facts & Assumptions

Given: A probability space and a random variable X in the relevant clause.

[L1]

Expectation is integration against P, and X=X+X with X=X++X for real X (Expectation of a nonnegative or integrable random variable, The positive and negative parts of a function).

[L2]

The layer-cake formula with p=1 gives fdμ=0μ({f>t})dt for measurable f (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).

[L3]

The Lebesgue integral is linear on L1 (The Lebesgue integral is linear on L1(μ)).

Proof

technique · direct
1.1

Apply [L2] with f=X and p=1. Because X0, one has X=X and {X>t}={X>t}, so [L1] gives E[X]=0P(X>t)dt.

L1L2
2.1

If X is integrable and real, then X+,XL1 and [L1] gives X=X+X. By step 1.1 applied to X+ and X, E[X+]=0P(X>t)dt,E[X]=0P(X<t)dt. Subtracting these identities and using [L3] proves the second formula.

L1L3step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Linearity, monotonicity, and the modulus bound for expectation

Statement

Let X,Y be integrable real or complex random variables on one probability space.

  1. For scalars a,b, E[aX+bY]=aE[X]+bE[Y].
  2. If X and Y are real-valued and XY almost surely, then E[X]E[Y].
  3. E[X]E[X].

Facts & Assumptions

Given: Integrable random variables X,Y.

[L1]

Expectation is the Lebesgue integral against the probability measure (Expectation of a nonnegative or integrable random variable).

[L2]

The Lebesgue integral is linear on L1, the nonnegative integral is monotone, and the modulus of an integral is bounded by the integral of the modulus (The Lebesgue integral is linear on L1(μ), Monotonicity and nonnegative homogeneity of the nonnegative integral, The modulus of an integral is bounded by the integral of the modulus).

Proof

technique · direct
1.1

Rewriting expectation as the integral by [L1], linearity in [L2] gives E[aX+bY]=aE[X]+bE[Y].

L1L2
1.2

Applying the integral triangle inequality from [L2] after [L1] gives E[X]=XdPXdP=E[X].

L1L2
2.1

If XY almost surely, then YX0 almost surely. Hence [L1] and [L2] give 0E[YX]=E[Y]E[X], so E[X]E[Y].

step 1.1L1L2
3.1

Steps 1.1, 1.2, and 2.1 prove the three assertions.

step 1.1step 1.2step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Moments, variance, and covariance on a probability space

Definition

Let X be a real random variable on a probability space.

  • For p>0, the pth absolute moment of X exists when Xp is integrable, and is then E[Xp].
  • If X is integrable, its mean is E[X].
  • If X is square-integrable, its variance is Var(X):=E[(XE[X])2].

If X and Y are square-integrable real random variables on the same probability space, their covariance is Cov(X,Y):=E[(XE[X])(YE[Y])].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Variance and covariance identities for random variables

Statement

Let X,Y be square-integrable real random variables on one probability space. Then Var(X)=E[X2]E[X]2, Cov(X,Y)=E[XY]E[X]E[Y]. Moreover, covariance is symmetric and bilinear on finite linear combinations. On finite full-power-set probability spaces these formulas reduce to the published finite identities.

Facts & Assumptions

Given: Square-integrable real random variables X,Y.

[L1]

Variance and covariance are the expectations of the centered square and centered product (Moments, variance, and covariance on a probability space).

[L2]

Expectation is linear on integrable random variables (Linearity, monotonicity, and the modulus bound for expectation).

[L3]

Finite probability spaces agree with the full-power-set probability-space formalism (Finite probability spaces are exactly finite full-power-set probability spaces).

Proof

technique · direct
1.1

Expanding (XE[X])2 and applying [L2] gives Var(X)=E[X2]2E[X]E[X]+E[X]2=E[X2]E[X]2. Likewise, Cov(X,Y)=E[XY]E[X]E[Y].

L1L2algebra
2.1

The covariance formula in step 1.1 is symmetric in X and Y, so Cov(X,Y)=Cov(Y,X). If U=i<maiXi and V=j<nbjYj are finite linear combinations of square-integrable real random variables, expanding E[UV]E[U]E[V] and using [L2] gives Cov(U,V)=i<mj<naibjCov(Xi,Yj).

step 1.1L2algebra
3.1

On a finite probability space, [L3] identifies the general formulas above with the already-published finite ones, so the finite and general identities agree exactly.

step 1.1step 2.1L3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Jensen's inequality for expectation

Statement

Let (Ω,F,P) be a probability space, let X be an integrable real random variable, let IR be an interval containing X(ω) for almost every ω, and let φ:IR be convex.

Assume additionally that φ(X) is either integrable or nonnegative, so its expectation is defined by Expectation of a nonnegative or integrable random variable. Then φ(E[X])E[φ(X)]. In the nonnegative case the right-hand side may be +.

Facts & Assumptions

Given: A probability space, an integrable real random variable X, an interval I containing its almost-everywhere range, and a convex φ:IR such that φ(X) is integrable or nonnegative.

[L1]

Expectation is integration against the underlying probability measure (Expectation of a nonnegative or integrable random variable).

[L2]

Jensen's integral inequality holds for a probability measure whenever the composed function is integrable (Jensen's integral inequality for a probability measure).

Proof

technique · direct
1.1

If φ(X) is nonnegative and E[φ(X)]=+, then the claimed inequality is automatic, because φ(E[X]) is a real number while the right-hand side is +.

given
1.2

In every remaining case, φ(X) is integrable: this is assumed directly, or follows from nonnegativity and finite expectation. Thus [L1] and [L2] applied to the probability measure P give φ(E[X])=φ(XdP)φ(X)dP=E[φ(X)].

L1L2
2.1

Steps 1.1 and 1.2 cover the infinite and finite expectation cases.

step 1.1step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Markov's inequality for random variables

Statement

If X:Ω[0,+] is a nonnegative random variable on a probability space and a>0, then P(Xa)E[X]a.

Facts & Assumptions

Given: A nonnegative random variable X and a real number a>0.

[L1]

Expectation is integration against the probability measure (Expectation of a nonnegative or integrable random variable).

[L2]

The integral Markov inequality states μ({ft})t1fdμ for nonnegative measurable f and t>0 (Chebyshev-Markov inequality for the integral).

Proof

technique · direct
1.1

Apply [L2] to the probability measure P, the function X, and the threshold a>0. Rewriting the integral by [L1] gives P(Xa)E[X]a.

L1L2
2.1

Step 1.1 is exactly Markov's inequality for random variables.

step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Chebyshev's inequality for random variables

Statement

If X is a square-integrable real random variable and a>0, then P(XE[X]a)Var(X)a2.

Facts & Assumptions

Given: A square-integrable real random variable X and a real number a>0.

[L1]

Variance is the expectation of the squared centered variable (Moments, variance, and covariance on a probability space).

[L2]

Markov's inequality applies to every nonnegative random variable (Markov's inequality for random variables).

Proof

technique · direct
1.1

The random variable Y:=(XE[X])2 is nonnegative, and {Ya2}={XE[X]a}.

givenalgebra
2.1

Applying [L2] to Y and using [L1] gives P(XE[X]a)=P(Ya2)E[Y]a2=Var(X)a2.

step 1.1L1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Holder's inequality for random variables

Statement

Let p,q[1,] be conjugate exponents. If X and Y are real random variables in the spaces named by the corresponding clause of Holder's inequality for integrals, including the endpoint cases, then E[XY]XpYq.

In particular, XY is integrable.

Facts & Assumptions

Given: Real random variables X,Y and conjugate exponents p,q as in the Statement.

[L1]

Expectation is integration against the probability measure (Expectation of a nonnegative or integrable random variable).

[L2]

Holder's integral inequality, including the endpoint cases, holds on every measure space (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · direct
1.1

Apply [L2] to the measure space (Ω,F,P). Rewriting the left-hand side with [L1] gives E[XY]=XYdPXpYq.

L1L2
2.1

The same theorem [L2] already states that the right-hand side is finite in every allowed case, so XY is integrable.

step 1.1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Cauchy-Schwarz for random variables

Statement

If X,YL2(P) are real random variables, then E[XY](E[X2])1/2(E[Y2])1/2.

Equality holds if and only if at least one of X,Y is zero almost surely, or there is a constant c>0 with X2=cY2P-almost surely.

Facts & Assumptions

Given: Real random variables X,YL2(P).

[L1]

Holder's inequality on a probability space specializes to E[XY]X2Y2 (Holder's inequality for random variables).

[L2]

The L2 Cauchy-Schwarz equality criterion is already proved for general measure spaces (Cauchy-Schwarz inequality for L2).

Proof

technique · direct
1.1

Step [L1] at p=q=2 gives E[XY]X2Y2=(E[X2])1/2(E[Y2])1/2.

L1
2.1

The equality clause is exactly the probability-measure specialization of [L2].

step 1.1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Lyapunov's moment inequality on a probability space

Statement

Let (Ω,F,P) be a probability space and let 1pq.

  • If q< and XLq(P), then XLp(P) and XpXq.
  • If q= and XL(P), then XLp(P) and XpX.

Facts & Assumptions

Given: A probability space and exponents 1pq.

[L1]

A probability measure has total mass 1 (Probability measures and probability spaces).

[L2]

On a finite measure space, Lq includes into Lp with factor μ(Ω)1/p1/q for finite q, and L includes into Lp with factor μ(Ω)1/p (Finite-measure Lr includes into Lp for p<r).

Proof

technique · direct
1.1

If p=q, the inequality is equality. If p<q<, apply [L2] with μ=P and use [L1] to collapse the factor P(Ω)1/p1/q to 1.

L1L2
1.2

If q=, the same specialization of [L2] and [L1] gives XpP(Ω)1/pX=X.

L1L2
2.1

Steps 1.1 and 1.2 are exactly the finite-q and q= cases of Lyapunov's moment inequality on a probability space.

step 1.1step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

The second-moment lower bound for positive probability

Statement

Let X be a nonnegative square-integrable real random variable.

  • If E[X2]>0, then P(X>0)E[X]2E[X2].
  • If E[X2]=0, then X=0 almost surely and P(X>0)=0.

Facts & Assumptions

Given: A nonnegative square-integrable real random variable X.

[L1]

The expectation of an indicator is the probability of its event (The expectation of an indicator is the probability of the event).

[L2]

Cauchy-Schwarz holds for square-integrable random variables (Cauchy-Schwarz for random variables).

[L3]

Square-integrability means that the second moment E[X2] is finite (Moments, variance, and covariance on a probability space).

Proof

technique · direct
1.1

The identity X=X1{X>0} holds pointwise because X0. Applying [L2] to U=X1{X>0} and V=1{X>0} gives E[X]2E[X2]E[1{X>0}]. By [L1], this is E[X]2E[X2]P(X>0).

L1L2L3
2.1

If E[X2]>0, divide the inequality in step 1.1 by that positive number. If E[X2]=0, then step 1.1 forces E[X]=0 as well, and since X20, zero second moment means X2=0 almost surely, hence X=0 almost surely and P(X>0)=0.

step 1.1L3algebra
3.1

Step 2.1 proves both the positive-second-moment case and the zero boundary case.

step 2.1
RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

The general inequalities compare cleanly with the published finite ones

The probability-space inequalities above recover the published finite statements exactly in the Markov, Chebyshev, and Cauchy-Schwarz cases, and they isolate the precise extra nonnegativity needed for the positive-probability bound.

The earlier finite proofs remain the canonical finite arguments. The present page packages them as consequences of the general integral theory on a probability space.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Normal equations for best affine L2 prediction

Statement

Let X,Y1,,Yn be square-integrable real random variables on one probability space, and write W:=span([1],[Y1],,[Yn])L2(P), where [] denotes the almost-everywhere class from The space Lp(μ) as the quotient by null functions.

Then there is a unique class [Z]W minimizing [X][Z]2 over [Z]W. This minimizing class has an affine representative Z=a0+j=1najYj, and its coefficients satisfy a0=E[X]j=1najE[Yj], j=1nCov(Yi,Yj)aj=Cov(X,Yi)(1in).

The class [Z] is unique. If the covariance matrix Γ=(Cov(Yi,Yj))i,j is singular, the coefficient vector need not be uniquely determined by the normal equations, but any two solutions yield the same predictor almost surely.

Facts & Assumptions

Given: Square-integrable real random variables X,Y1,,Yn.

[L1]

Variance and covariance are given by centered expectations, satisfy the identities Var(U)=E[U2]E[U]2,Cov(U,V)=E[UV]E[U]E[V], and are bilinear on finite linear combinations (Moments, variance, and covariance on a probability space, Variance and covariance identities for random variables).

[L2]

Cauchy-Schwarz gives integrability of products of square-integrable random variables (Cauchy-Schwarz for random variables).

[L4]

In a finite-dimensional inner product space, the orthogonal projection onto any subspace is the unique nearest point in that subspace (The orthogonal projection is the unique nearest point in the subspace).

[L5]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

Proof

technique · direct
1.1

Let V:=span([X],[1],[Y1],,[Yn])L2(P). This space is finite-dimensional because it is spanned by n+2 vectors, and W is a subspace of V. Equip V with the usual L2 inner product. Applying [L4] to the vector [X]V and the subspace WV gives a unique class [Z]W minimizing [X][Z]2 over [Z]W.

L3L4
2.1

By [L3], every class in W has an affine representative of the form Z=a0+j=1najYj. Put X~:=XE[X] and Y~j:=YjE[Yj]. Then XZ=X~j=1najY~j+(E[X]a0j=1najE[Yj]). Expanding the square and using [L1] shows that the mixed term with the final constant vanishes, so E[(XZ)2]=E[(X~j=1najY~j)2]+(E[X]a0j=1najE[Yj])2. Hence every affine representative of the minimizing class must satisfy a0=E[X]j=1najE[Yj].

L1L3step 1.1algebra
3.1

After imposing the intercept from step 2.1, define Q(a1,,an):=E[(X~j=1najY~j)2]. Using [L1] and [L2], Q(a)=Var(X)2j=1najCov(X,Yj)+i=1nj=1naiajCov(Yi,Yj).

L1L2step 2.1algebra
4.1

Let h=(h1,,hn)Rn. Substituting a+h into step 3.1 and subtracting gives Q(a+h)Q(a)=E[(j=1nhjY~j)2]+2i=1nhi(j=1nCov(Yi,Yj)ajCov(X,Yi)). Therefore, if a satisfies the normal equations, then Q(a+h)Q(a)0 for every h, so a minimizes Q.

step 3.1L1algebra
5.1

Conversely, suppose a minimizes Q. Fix i and take h=tei, where ei is the ith standard basis vector. Then step 4.1 gives Q(a+tei)Q(a)=t2Var(Yi)+2t(j=1nCov(Yi,Yj)ajCov(X,Yi))0 for every real t. The coefficient of t must therefore be 0, since the same inequality holds for both signs of t. This is exactly the ith normal equation, and i was arbitrary.

step 4.1givenalgebra
6.1

Let a and b be two coefficient vectors satisfying the normal equations, and let D:=j=1n(ajbj)Y~j. Subtracting the two linear systems gives jCov(Yi,Yj)(ajbj)=0 for every i. Multiplying the ith equation by aibi and summing over i, then using bilinearity from [L1], yields E[D2]=i=1nj=1n(aibi)(ajbj)Cov(Yi,Yj)=0. Because D20, [L5] gives D=0 almost surely. Thus the corresponding predictors agree almost surely, so the minimizing class in L2(P) is unique even when the coefficient vector is not.

L1L5step 5.1algebra
7.1

Step 1.1 gives existence and uniqueness of the minimizing class, step 2.1 identifies the optimal intercept, steps 4.1 and 5.1 characterize the optimal centered coefficients by the covariance normal equations, and step 6.1 proves that all coefficient solutions yield the same predictor almost surely. This is exactly the best affine L2 prediction statement.

step 1.1step 2.1step 4.1step 5.1step 6.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Best affine prediction from one random variable

Statement

Let X and Y be square-integrable real random variables.

  • If Var(Y)>0, the unique best affine predictor of X from Y is E[X]+Cov(X,Y)Var(Y)(YE[Y]).
  • If Var(Y)=0, then every best affine predictor is almost surely equal to the constant E[X].

Facts & Assumptions

Given: Square-integrable real random variables X,Y.

[L1]

Best affine L2 predictors are characterized by the normal equations (Normal equations for best affine L2 prediction).

[L2]

Proof

technique · direct
1.1

With one predictor variable, the normal equation from [L1] is Cov(Y,Y)a1=Cov(X,Y). By [L2], this is Var(Y)a1=Cov(X,Y).

L1L2
2.1

If Var(Y)=0, then step 1.1 makes the normal equation 0a1=Cov(X,Y). Hence every real a1 solves it, and [L1] says that all corresponding affine predictors yield the same optimal class. Taking a1=0 gives the constant predictor E[X], so every best affine predictor is almost surely equal to that constant.

step 1.1L1L2algebra
2.2

If Var(Y)>0, step 1.1 gives a1=Cov(X,Y)Var(Y). Substituting this into the intercept formula from [L1] yields the displayed predictor a0+a1Y=E[X]+Cov(X,Y)Var(Y)(YE[Y]).

step 1.1L1L2algebra
3.1

Steps 2.2 and 2.1 give the positive-variance and zero-variance cases.

step 2.2step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources