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.
Probability Spaces Random Variables and Expectation — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples isolate the standard probability-space behaviors that the A page proves abstractly: explicit laws and CDFs, tail-integral expectation formulas, pushforward computations, Jensen instances, and sharpness examples for the basic inequalities.
The counterexamples keep the scope honest. Expectations can diverge, atoms can prevent the existence of a density, and almost-sure equality is weaker than pointwise equality. Bertrand's paradox closes the pair by showing that a probability question is not determined until the sample space and law have been specified.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A countable probability space with geometric weights
Example
Let and define Let be the coordinate map . Then is a random variable, its law is and
Facts & Assumptions
Given: The weights on and the coordinate map .
A probability measure has total mass , the law of a random element is its pushforward measure, and change of variables computes expectation from the law (Probability measures and probability spaces, Law or distribution of a random element, Change of variables for expectation).
A real random variable is a measurable map into (Random elements and real random variables).
Verification
The geometric series gives so the displayed weights define a probability measure as in [L1]. Since every subset of is measurable, the coordinate map is a real random variable by [L2].
For each , the fibre of is the singleton , so the law definition gives
Applying change of variables from [L1] to the identity function on gives
Steps 1.1, 1.2, and 2.1 verify the measure, the law, and the expectation.
The uniform random variable on [0,1]
Example
Let with its Borel sets and uniform probability measure, and let . Then and
Facts & Assumptions
Given: The identity random variable on with uniform probability.
The cumulative distribution function is (Cumulative distribution function of a real random variable).
Expectation is integration against the probability measure, and for a nonnegative random variable the layer-cake formula computes it from the tail probabilities (Expectation of a nonnegative or integrable random variable, Layer-cake formulas for random variables).
Verification
By direct interval computation, which is exactly the displayed .
Direct integration gives
The tail is for and for , so in agreement with [L2].
Steps 1.1, 1.2, and 2.1 verify the CDF, moments, and tail integral.
Recovering an exponential law from its tail
Example
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Fix and suppose a nonnegative random variable satisfies Then its law on is the exponential law with parameter , and
Facts & Assumptions
Given: The Axiom of Countable Choice and a nonnegative random variable with for all .
The cumulative distribution function is (Cumulative distribution function of a real random variable).
Assuming the Axiom of Countable Choice, distribution functions determine probability laws (Probability laws correspond to distribution functions).
For nonnegative random variables, (Layer-cake formulas for random variables).
Verification
Because , one has for . For , So the displayed formula is the CDF of .
The tail integral from [L3] gives
By [L2], that distribution function determines the law uniquely, and its interval increments are those of the exponential distribution with parameter .
Steps 1.1, 1.2, and 2.1 recover the law and its expectation from the tail.
Discrete, continuous, and mixed distribution functions
Example
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Three standard distribution functions illustrate three different atom patterns:
The first law is purely atomic, the second has no atoms on , and the third is mixed: it has an atom at and a continuous part on .
Facts & Assumptions
Given: The Axiom of Countable Choice and the three displayed functions.
Assuming the Axiom of Countable Choice, distribution functions determine probability laws (Probability laws correspond to distribution functions).
Atoms are positive point masses of the law, while continuity points are points where the distribution function is continuous (Atoms and continuity points of a law).
Verification
Each displayed function is nondecreasing, right-continuous, tends to at , and tends to at . Therefore [L1] gives a probability law for each of them.
The jumps identify the atoms. For , the jumps are at and at , so the law is purely discrete. For there are no jumps, hence no atoms. For there is a jump of size at and no jump on , so the law is mixed.
Thus the three distribution functions realize discrete, continuous, and mixed behavior without any implication that a density must exist in general.
Expectation under a measurable transformation
Example
Let take the values , , and with probabilities , , and , and let . Then
Facts & Assumptions
Given: The law with masses , , and , and the measurable map .
Change of variables for expectation allows computation against the law instead of the original sample space (Change of variables for expectation).
Verification
By [L1], Because the law is supported on , this is the weighted sum
The nonlinear expectation is therefore computed entirely from the law on the target space.
Jensen for logarithm and exponential
Example
Let be a positive integrable random variable such that is integrable.
- Applying Jensen to the concave function yields equivalently
- If is any integrable real random variable with , then Jensen applied to the convex function gives
For a two-point law with and , , the first inequality is the weighted arithmetic-geometric mean inequality
Facts & Assumptions
Given: A positive integrable random variable such that is integrable, and an integrable real random variable with finite exponential moment.
Jensen's inequality holds for expectation under the stated integrability hypotheses (Jensen's inequality for expectation).
Verification
Apply [L1] to the convex function and to . This gives
Applying the same theorem to and the convex function gives which is equivalent to .
For the two-point law, step 1.2 becomes that is,
Steps 1.1, 1.2, and 2.1 give the exponential-moment and weighted AM-GM forms of Jensen.
Markov and Chebyshev sharpness
Example
Both Markov's and Chebyshev's inequalities can be sharp.
- If with , then
- If takes the values with probability each, then
These equality examples do not mean the bounds are always informative: when a distribution has much lighter tails, the same inequalities may be very far from equality.
Facts & Assumptions
Given: The two-point random variables described above.
Markov's and Chebyshev's inequalities are the probability-space bounds already proved on the A page (Markov's inequality for random variables, Chebyshev's inequality for random variables).
Verification
For , one has and , so
For with equal probabilities, and , while always. Hence
Thus both inequalities admit equality, even though other laws can make the bounds much weaker.
A random variable need not have a finite expectation
Statement refuted
Every real random variable has a finite expectation.
Facts & Assumptions
Given: The set with its power-set sigma-algebra, the weights , and the coordinate map .
Expectation of a nonnegative random variable is allowed to take the value (Expectation of a nonnegative or integrable random variable).
The integral of a nonnegative simple function is its weighted level-set sum, and monotone convergence passes increasing nonnegative limits through the integral (The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions, Monotone convergence for the integral).
Counterexample
Define The total mass is If is pairwise disjoint, regrouping the nonnegative series gives Thus is a probability measure on the power set of , and is a measurable real random variable.
Put . The functions increase pointwise to . By [L1], [L2], and monotone convergence, Thus the expectation exists only as an extended value, not as a finite real number, exactly as [L1] allows.
Steps 1.1 and 2.1 refute the claim that every random variable has finite expectation.
A distribution function need not have a density
Statement refuted
A distribution function need not arise from a Lebesgue density.
Facts & Assumptions
Given: A Bernoulli random variable with and , where .
The cumulative distribution function is (Cumulative distribution function of a real random variable).
Atoms of a law are positive point masses (Atoms and continuity points of a law).
Counterexample
The CDF of is So the law has atoms at and by [L2].
If this law were given by a Lebesgue density , then every singleton would have probability In particular , contradicting .
Therefore this distribution function has no Lebesgue density.
Equality almost surely is not pointwise equality
Statement refuted
If two random variables are equal almost surely, then they are pointwise equal.
Facts & Assumptions
Given: The probability space , the zero function , and the indicator .
A property holds almost everywhere when its exceptional set is contained in a measurable null set (Measure-null sets and almost-everywhere statements relative to a measure).
Integrable random variables with the same almost-sure class have the same expectation (Expectation depends only on the almost-everywhere class).
Counterexample
The functions and differ only at the single point . That set is Lebesgue-null, so [L1] gives almost surely.
They are not pointwise equal, because while . They are both bounded and hence integrable, so [L2] also gives
Therefore almost-sure equality is strictly weaker than pointwise equality.
Bertrand's chord paradox is a model-specification problem
Example
Consider a circle of radius and the event that a random chord is longer than the side of the inscribed equilateral triangle. Three natural models give three different probabilities.
- If the chord is determined by a random central angle , then the event is and has probability .
- If the chord is determined by choosing its midpoint uniformly on a fixed radius, then the event is that the midpoint lies within distance of the center, and has probability .
- If the chord is determined by choosing its midpoint uniformly in the whole disk, then the same geometric condition gives probability .
Facts & Assumptions
Given: The three sample-space models stated in the Example.
A probability question is determined only after the sample space and its probability measure have been fixed (Probability measures and probability spaces).
Verification
A chord subtending central angle has length . It is longer than exactly when , that is, when . Under the uniform-angle model this has probability
A chord is longer than exactly when its midpoint is within distance of the center. Along a fixed radius, the favorable segment has length inside the unit segment, so the midpoint-on-a-radius model gives probability . Over the whole disk, the favorable region is the disk of radius , so the midpoint-in-the-disk model gives area ratio
The three different answers , , and come from three different probability models for the same geometric question, exactly as [L1] predicts.
Sources
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.1
- Jean-Francois Le Gall, Integration, Probabilities and Stochastic Processes, Section 8.1.5
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.2
- J. R. Norris, Probability and Measure, Section 2.3
- S. R. S. Varadhan, Probability Theory, Section 1.4
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.6.1
- J. R. Norris, Probability and Measure, Section 4.2
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.6
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 1.5
- Jean-Francois Le Gall, Integration, Probabilities and Stochastic Processes, Section 8.1.4