MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am reading this introduction to enlargement of filtration and at the beginning of section 2.4 there is a claim that I cannot justify but seems like it should be well known. The author claims that if $\mathcal{F}_t$ is the natural filtration of a Brownian Motion, then since $\mathcal{F}_t$ is separable it follows that $\mathcal{F}_\infty$ is generated by a real random variable. I assume that separable means that there is a countable collection of random variables which generates $\mathcal{F}_t$,though I have not been able to find a definition for the term 'separable' in this context. In any case, I wonder if someone could help me with a proof (or a reference for one) of this result.

share|cite|improve this question
up vote 4 down vote accepted

Let $(\Omega,\mathcal B,\mu)$ be a probability space and $\mathcal A$ a sub-sigma-algebra of $\mathcal B$. The following statements are equivalent:

  1. $\mathcal A$ admits a countable set of generators.
  2. There is a bounded random variable $X\colon \Omega\to \Bbb R$ such that $\sigma(X)=\mathcal A$.
  3. There are countably many bounded random variables $X_k\colon \Omega\to \Bbb R$ such that $\sigma(X_k,k\in\Bbb N)=\mathcal A$.

Indeed, if $1.$ is satisfied, let $\(A_k,k\in\Bbb N\)\subset 2^\Omega$ generating $X$. Then define $X:=\sum_{k=1}^{+\infty}3^{-k}\chi_{A_k}$. Then $X^{-1}(3^{-k})=A_k$.

$2.\Rightarrow 3.$ is obvious taking $X_k=X$.

$3.\Rightarrow 1.$ Let $S_j$ be countably many sets generating Borel sigma-algebra, for example open intervals with rational endpoints. The (countable) collection $(X_k^{-1}(S_j),(k,j)\in\Bbb N^2)$ generated $\mathcal A$.

share|cite|improve this answer

Yes, you can define separable by saying that it means "generated by a countable collection of (real) random variables", and you can always assume that all these variables take values in $[0,1]$. Then you can find a single random variable generating the same $\sigma$-algebra by intertwining the digits of all your initial random variables (the countable collection of all the digits of all random variables is itself countable, so that you can encode them in a single sequence of digits).

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.