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 1 of 32

Describe information with sigma-algebras

Construct generated sigma-algebras from observations.

Loading your saved responses…

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

Try

A sensor reports only whether a number on a six-outcome device is at most two. From this observation one can distinguish the event A consisting of the first two outcomes and its complement, but not the individual outcomes inside either group. The available yes-or-no questions are empty, A, its complement and the whole space. A sigma-algebra formalizes a collection of events whose logical combinations remain meaningful.

Predict

Predict what happens when a second sensor reports whether the outcome is even. Intersections of the two sensor events and their complements produce smaller distinguishable groups called atoms. Every event determined by the observations is a union of these groups. Counting atoms rather than original outcomes gives the size of the generated finite sigma-algebra. Empty intersections are omitted; an impossible observation combination is not a new atom.

Experiment

For outcomes 1 through 6, compare the two observations.

First sensorEven sensorAtom
At most 2Even2
At most 2Odd1
Above 2Even4,6
Above 2Odd3,5

There are four nonempty atoms and therefore sixteen distinguishable events. Construct an event that separates outcome two from four, then explain why no combination of these observations separates four from six.

Understand

A sigma-algebra F on a set X contains X, is closed under complements relative to X, and is closed under countable unions. It consequently contains the empty set and is closed under countable intersections by De Morgan’s law. For a family C of subsets, its generated sigma-algebra σ(C) is the intersection of all sigma-algebras containing C; the power set guarantees that this collection is nonempty. Intersections preserve the axioms, proving that σ(C) exists and is the smallest such sigma-algebra. This construction defines minimality without claiming there is a finite algorithm that lists every generated set.

Apply

On a topological space, the Borel sigma-algebra is generated by the open sets. On the real line, open intervals with rational endpoints suffice because every open set is their countable union. Countability is crucial: a sigma-algebra need not contain arbitrary unions of its sets. For example, the countable-cocountable sigma-algebra on the real line contains every singleton, but not an interval with both it and its complement uncountable. The interval is an uncountable union of singletons. Thus a measurable-event structure need not be a topology, and a topology need not itself be closed under complements.

Continue

A measurable space is only the pair (X, F); no sizes have yet been assigned. A measure will add numerical values while respecting countable disjoint unions. Keep this order of definitions clear: deciding which sets are measurable and deciding how much they measure are separate operations. The real-analysis sequence supplies countability and limit prerequisites. This course uses the undergraduate scope of Warwick ST 350, 2026, with the MIT 18.125 Spring 2010 schedule as a separately labeled advanced comparison, not a claim of institutional equivalence.

Continue to Derive continuity from countable additivity.

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.

A finite sigma-algebra has three nonempty atoms. How many measurable sets does it contain?

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

On a six-point space, one nonempty proper event generates how many measurable sets?

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

Prove any intersection of sigma-algebras on the same set is a sigma-algebra.

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.

Prove the countable-cocountable subsets of an uncountable set form a sigma-algebra.

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 closure under countable unions does not imply closure under arbitrary unions.

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.

Prove the inverse images of a sigma-algebra under a function form a sigma-algebra on its domain.

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.