Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 27 of 32

Express laws and independence through measures

Construct probability laws as pushforwards.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

A random variable is a measurable function on a probability space. That definition connects the probability of an output event to the measure of its inverse image. Two independent fair bits give a concrete space with four equally likely outcomes. Add their parity as a third variable and inspect how pairwise independence can coexist with a deterministic relation.

Predict

Predict whether checking all pairs proves mutual independence of three variables. It does not. In the parity example, knowing both input bits determines the third. Predict also whether a zero covariance would prove independence. It is weaker still: covariance checks one product moment, whereas independence compares whole event collections.

Experiment

List the complete parity model.

UVW, parityProbability
0001/4
0111/4
1011/4
1101/4

Make a two-way table for each pair and verify its four entries are equal. Then compare the probability of the first row with the product of its three marginal probabilities. This calculation distinguishes the two definitions without relying on terminology alone.

Understand

A probability space is a measure space with total measure one. A real random variable X is measurable into the Borel sets of the real line. Its distribution is the pushforward probability measure, so expectation is an integral with respect either to the underlying space or to that distribution.

Two sigma-algebras are independent when P(A intersection B)=P(A)P(B) for every event A in the first and B in the second. Random variables are independent when their generated sigma-algebras are independent. Their joint law then agrees with the product of marginal laws on every measurable rectangle. Since both are finite measures, the pi-lambda uniqueness theorem extends agreement to the product sigma-algebra. Conversely, equality of these laws immediately gives the rectangle probability formula.

It is often enough to check generating pi systems. Fix an event A in the first generating pi system. The events B satisfying the independence formula form a lambda system: the whole space works; complements use finite probabilities; disjoint unions use countable additivity. The pi-lambda theorem extends the formula to the second generated sigma-algebra. Now fix any event in that full second sigma-algebra and repeat the argument in the first variable. This two-stage extension is necessary; merely mentioning generators does not complete the proof.

For independent integrable X and Y, Tonelli on the product law first gives E abs (XY)=E abs (X)E abs (Y)< infinity. Fubini then proves E(XY)=E(X)E(Y). For several variables, mutual independence requires the corresponding finite intersection formula, not merely all pairwise formulas. The parity table satisfies every pairwise formula but violates the triple formula.

Apply

Use the product-law viewpoint to calculate the distribution of a measurable function of independent variables. First identify the product measure, then take a pushforward under the function. This separates the independence assumption from the transformation. A deterministic function of one variable generally does not produce an independent second variable merely because the output looks different.

Continue

Measure theory clarifies which statements concern laws, underlying events or particular representatives. Next, compare convergence of random variables in several modes and use countable event estimates to turn summable error probabilities into almost-sure conclusions. The probability-one setting supplies finiteness assumptions used earlier in convergence theorems.

Continue to Compare convergence modes using event bounds.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

Independent events A and B have probabilities 2/5 and 3/4. What is P(A∩B)?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Two fair independent bits U, V define W as their parity. What is P(U=0, V=0, W=0)?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Prove independence of random variables is equivalent to their joint law being the product of their marginal laws.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Explain why independence checked on generating pi systems extends to their generated sigma-algebras.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Show that U, V and their parity W are pairwise independent but not mutually independent.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

For independent integrable X, Y, justify E(XY)=E(X)E(Y) and product integrability.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.