advanced28 min studyLesson 181 in Mathematics

Sigma algebras and measurable maps

Specify observable sets and test functions through their inverse images before assigning any sizes.

On this page

What you’ll understand

  • Construct a sigma algebra generated by a partition or a family of sets.
  • Check measurability using a generating family of target sets.
  • Distinguish a measurable space from a measure space and from its completion.

Before asking how large a set is, specify which sets the model can distinguish. A sensor that reports only whether a number lies above a threshold provides less information than one reporting the number itself. Sigma algebras make this difference precise without requiring a probability distribution. Measurable functions then transport observable questions backward: an event described in the output must correspond to an allowed event in the input. This viewpoint prevents several misleading appeals to continuity or pictures.

Closure under countable questions

A sigma algebra on X contains X and is closed under complements and countable unions. These rules also give the empty set, countable intersections, and set differences. Countability is essential: a countable sequence of observations must still define an observation, but arbitrary unions need not. Intersecting every sigma algebra containing a family C produces the generated sigma algebra. This construction proves existence even when listing all its sets is impractical. It is the smallest collection satisfying the closure rules and containing the original questions.

On a finite space, a partition provides a concrete picture. If the observer can distinguish the blocks {a,b} and {c,d} but cannot distinguish points within either block, the measurable sets are the empty set, those two blocks, and the whole space. Adding the question {a} refines the information: complements and intersections now separate a from b. No numerical weights were needed. A measure is additional data assigning nonnegative values to these sets, with countable additivity on disjoint unions.

σ(C)=⋂{A:A is a sigma algebra on X, C⊆A}\sigma(\mathcal C)=\bigcap\{\mathcal A:\mathcal A\text{ is a sigma algebra on }X,\ \mathcal C\subseteq\mathcal A\}
The power set is one sigma algebra containing C, so the intersected family is nonempty. Intersections preserve the required closure properties.↔ Scroll wide equations horizontally.

Pull questions backward rather than pushing sets forward

For measurable spaces X and Y, a function f is measurable when the inverse image of every measurable subset of Y is measurable in X. The sigma algebra on each side is part of the assertion. Inverse images commute with complements and arbitrary unions, explaining why this definition works so cleanly. Direct images do not generally preserve complements or intersections. Consequently a measurable map need not carry every measurable input set to a measurable output set. Confusing these directions obscures the actual theorem.

For real outputs equipped with their Borel sigma algebra, it suffices to test the sets where f exceeds a rational threshold. Such half-lines generate all Borel sets. More generally, if G generates the target sigma algebra, collect all target sets whose inverse images are measurable. That collection is itself a sigma algebra, so containing G forces it to contain the generated sigma algebra. This short argument replaces an impossible test over every Borel set with a manageable family of inequalities.

f:(X,A)→(R,B(R)) measurable⟺{x:f(x)>q}∈A for every q∈Qf:(X,\mathcal A)\to(\mathbb R,\mathcal B(\mathbb R))\text{ measurable}\quad\Longleftrightarrow\quad\{x:f(x)>q\}\in\mathcal A\ \text{for every }q\in\mathbb Q
Rational upper half-lines generate the Borel sigma algebra; inverse images preserve the operations used to generate it.↔ Scroll wide equations horizontally.

Operations and null-set information

Compositions of measurable maps are measurable because the inverse image of a composition is an iterated inverse image. For real measurable functions, sums, products, and pointwise limits are measurable as well. For limits, the event that a limiting value exceeds a threshold can be written using countable unions and intersections of threshold events for the sequence. These closure results justify building complicated observables from elementary ones. They assert that the result is eligible for integration, not that its integral is finite.

After choosing a measure, completeness asks a further question: is every subset of every measurable null set also measurable? Completing a measure space adds those subsets and gives them measure zero. This enlargement need not add any new integral values for previously measurable integrable functions. However, it changes which representatives are measurable after modifications on null sets. Borel measurability and Lebesgue measurability on the real line therefore should not be silently interchanged: Lebesgue measure includes the completion of the Borel measure.

Which four-point functions can be observed?

Let X={a,b,c,d} have sigma algebra {∅,{a,b},{c,d},X}. Decide whether f(a)=f(b)=2 and f(c)=f(d)=−1 is measurable as a real-valued function.

  1. For a threshold q<−1, the event f>q is all of X. For −1≤q<2 it is exactly {a,b}; for q≥2 it is empty.

  2. All three possibilities belong to the specified input sigma algebra. The threshold criterion proves measurability without checking every Borel subset of the real line.

  3. If f(b) were changed to 3 while f(a) stayed 2, the threshold q=5/2 would produce the event {b}. That event is absent, so the modified function would not be measurable.

The result

The original function is measurable. In this finite example, real measurable functions are exactly the functions constant on each observable block.

Explore the model

Interactive lab

Interactive lab · probability

Observable thresholds in a finite distribution

Change success probability p and integer trial count n in the exact binomial bars. Predict which bars belong to the event K>2 before adding their masses. Changing p changes the measure, while the count values and their threshold sets remain observable. This is a finite illustration, not a generator for arbitrary sigma algebras.

Observable thresholds in a finite distributionThese are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Current readings: Mean · np: 5; Variance · np(1−p): 2.5; Total probability: 1. All parameters are adjustable with the labeled controls below.03581000.070.150.220.3Successes kP(X = k)k = 0 · P = 9.77e-4
Exact probabilityHighlighted outcomeMean np
Mean · np
5
Variance · np(1−p)
2.5
Total probability
1
t = 0 s

These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forMeasurability decides whether the event is allowed; the chosen measure decides its weight.

Check your understanding

To prove a real-valued map measurable, why is checking rational upper thresholds enough?

Try it yourself

On X={1,2,3}, use the sigma algebra {∅,{1,2},{3},X}. Characterize all measurable real-valued functions and explain why adding a probability distribution does not change that characterization.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

If the first two values differ, choose a rational threshold strictly between them.

Compare with the solution

The necessary and sufficient condition is f(1)=f(2); f(3) is unrestricted. If the first values differ, a rational threshold separates them, producing either {1} or {2}, neither measurable. If they agree, every inverse image is a union of the two partition blocks. Assigning probabilities to those blocks changes weights but does not enlarge the sigma algebra. Completing a particular measure could enlarge it if a block were null, which is a separate operation.

Take it with you

  • A sigma algebra records allowed set questions independently of their numerical weights.
  • Measurability is an inverse-image condition relative to specified sigma algebras.
  • Completion adds subsets of null sets and should be named when it matters.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.