# On Measurability

18 Jul 2016.. this one is pretty dry, I’ll admit. David Williams said it best:

.. Measure theory, that most arid of subjects when done for its own sake, becomes amazingly more alive when used in probability, not only because it is then applied, but also because it is immensely enriched.

Unfortunately for you, dear reader, we won’t be talking about probability.

Moving on. What does it mean for something to be *measurable* in the
mathematical sense? Take some arbitrary collection and slap an
appropriate algebraic structure on it - usually an
algebra or -algebra, etc. Then we can
refer to a few different objects as ‘measurable’, going roughly as follows.

The elements of the structure are called *measurable sets*.
They’re called this because they can literally be assigned a notion of measure
- a kind of generalized volume. If we’re just talking about some subset of
out of the context of its structure then we can be pedantic and call it
measurable *with respect to* , say. You could also call a set
-measurable, to be similarly precise.

The product of the original collection and its associated structure is called a *measurable space*. It’s called that because it can
be completed with a measuring function - itself called a measure - that
assigns notions of measure to measurable sets.

Now take some other measurable space and consider a
function from to . This is a *measurable function* if it
satisfies the following technical requirement: that for any
-measurable set, its preimage under is an element of
(so: the preimage under is -measurable).

The concept of measurability for functions probably feels the least intuitive of the three - like one of those dry taxonomical classifications that we just have to keep on the books. The ‘make sure your function is measurable and everything will be ok’ heuristic will get you pretty far. But there is some good intuition available, if you want to look for it.

Here’s an example: define a set that consists of the elements ,
, and . To talk about measurable functions, we first need to define
our measurable sets. The de-facto default structure used for this is a
-algebra, and we can always *generate* one from some
underlying class of sets. Let’s do that from the following plain old
*partition* that splits the original collection into a couple of disjoint
‘slices’:

The -algebra generated from this partition will just be the partition itself, completed with the whole set and the empty set. To be clear, it’s the following:

The resulting measurable space is . So we could assign a notion of generalized volume to any element of , though I won’t actually worry about doing that here.

Now. Let’s think about some functions from to the real numbers, which we’ll assume to be endowed with a suitable -algebra of their own (one typically assumes the standard topology on and the associated Borel -algebra).

How about this - a simple indicator function on the slice containing :

Is it measurable? That’s easy to check. The preimage of is , the preimage of is , and the preimage of is itself. Those are all in , and the preimage of the empty set is the empty set, so we’re good.

Ok. What about this one:

Check the preimage of and you’ll find it’s . But
that’s *not* a member of , so is not measurable!

What happened here? Failing to satisfying technical requirements aside: what, intuitively, made measurable where wasn’t?

The answer is a problem of *resolution*. Look again at :

The structure that we’ve endowed our collection with is
*too coarse* to permit distinguishing between elements of the slice . There is no measurable set , nor a measurable set - just
a measurable set . And as a result, if we define a function that
says something about either or without saying the same thing about
the other, *that function won’t be measurable.* The function assigned
the same value to both and , so we didn’t have any problem there.

If we want to be able to distinguish between and , we’ll need to equip with some structure that has a finer resolution. You can check that if you make a measurable space out of and its power set (the set of all subsets of ) then will be measurable there, for example.

So if we’re using partitions to define our measurable sets, we get a neat
little property: for any measurable function, elements in the same slice of the
partition *must* have the same value when passed through the function. So if
you have a function that takes an element to its respective
slice in a partition, you know that for any ,
in implies that for any measurable
function .

## Addendum

Whipping together a measurable space using a -algebra generated by a
partition of sets occurs naturally when we talk about correlated
equilibrium, a solution concept in non-cooperative game theory. It’s
common to say a function - in that context a *correlated strategy* - must be
measurable ‘with respect to the partition’, which sort of elides the fact that
we still need to generate a -algebra from it anyway.

Some oldschool authors (Halmos, at least) developed their measure theory using -rings, but this doesn’t seem very popular nowadays. Since a ring doesn’t require including the entire set , you need to go through an awkward extra hoop when defining measurability on functions. But regardless, it’s interesting to think about what happens when one uses different structures to define measurable sets!