Measurable function

Let (X,F) and (Y,G) be measurable spaces. A function:

f:(X,F)(Y,G)

is called measurable if for every GG, the pre-image belongs to F:

f1(G)F.

Special Cases:

  1. Real/complex-valued measurable functions:

    • If Y=R or C, G is the Borel σ-algebra.
    • It suffices to check measurability on a generating set (e.g., open intervals (a,b) or strips {za<Re(z)<b}).
  2. Random variables:


The pushforward measure

Given a measure μ in (X,F) we can define a new measure ν on (Y,G) by setting:

ν(B)=μ(f1(B))

for all BG.

This ν is called the pushforward measure or image measure, often denoted fμ or μf1.

This pushforward construction is essential in probability theory (where it describes how random variables induce probability distributions) and in many areas of analysis and geometry.


Intuition for measurable functions

The formal definition of measurability can be understood through the intuition of information.
Think of the sigma-algebra F on the input space X as the information we are allowed to have about the experiment's outcome, ωX.

A function f:XY (like a random variable) is a calculation we want to perform based on the outcome ω.

The "Constant on the Chunks" Test

The core intuition is this:

A function f is F-measurable if and only if it is constant on each of the information "chunks" defined by F.

That is, once the experiment has happened, we can determine the value of f with our holes system F, since f assigns the same value to all the results ω in the same chunk. So we don't worry about what the actual ω is, but to what subset in F it belongs to.

In other words, if we can't distinguish between two outcomes ω1 and ω2 (because they are in the same "chunk"), then an F-measurable function f cannot "illegally" distinguish them either—it must give them the same value, f(ω1)=f(ω2).

Connecting Intuition to the Formal Definition

The formal definition is: f1(G)F for all GG.

So, the definition f1(G)F means:

"For any question we can ask about the output (a set G), the set of all inputs that give a 'YES' answer (the set f1(G)) must be an event we can observe with our input information (F)."

This is a direct result of the "constant on the chunks" rule. If f is constant on the "chunks," any set f1(G) will be a perfect union of these chunks, which is by definition an observable event in F.