Given a sequence of realvalued random variables defined on a probability space , it is a standard result that the supremum
is measurable. To ensure that this is welldefined, we need to allow X to have values in , so that whenever the sequence is unbounded above. The proof of this fact is simple. We just need to show that is in for all . Writing,
the properties that are measurable and that the sigmaalgebra is closed under countable intersections gives the result.
The measurability of the suprema of sequences of random variables is a vital property, used throughout probability theory. However, once we start looking at uncountable collections of random variables things get more complicated. Given a, possibly uncountable, collection of random variables , the supremum is,

(1) 
However, there are a couple of reasons why this is often not a useful construction:
The essential supremum can be used to correct these deficiencies, and has been important in several places in my notes. See, for example, the proof of the debut theorem for rightcontinuous processes. So, I am posting this to use as a reference. Note that there is an alternative use of the term `essential supremum’ to refer to the smallest real number almost surely bounding a specified random variable, which is the one referred to by Wikipedia. This is different from the use here, where we look at a collection of random variables and the essential supremum is itself a random variable.
The essential supremum is really just the supremum taken within the equivalence classes of random variables under the almost sure ordering. Consider the equivalence relation if and only if almost surely. Writing for the equivalence class of X, we can consider the ordering given by if almost surely. Then, the equivalence class of the essential supremum of a collection of random variables is the supremum of the equivalence classes of the elements of . In order to avoid issues with unbounded sets, we consider random variables taking values in the extended reals .
Definition 1 An essential supremum of a collection of valued random variables,
is the least upper bound of , using the almostsure ordering on random variables. That is, S is an valued random variable satisfying
 upper bound: almost surely, for all .
 minimality: for all valued random variables Y satisfying almost surely for all , we have almost surely.
(more…)