# Smallest $\sigma$-algebra generated by $\mathcal C$?

Can someone explain how this $\sigma$-algebra is attained? It's mainly the $X\cup Y$ bit which I don't understand.

Question: If $\Omega = \{1, 2, 3, 4\}$ and we have a collection of sets $\mathcal C = \{\{3\},\{2, 3, 4\}\}$ what is the smallest $\sigma$-algebra generated by $\mathcal C$?

Answer: The ”atoms” that $\mathcal C$ generates are a bit more complex, there are in fact three:

• Clearly $X = \{3\}$ is one atom.
• If we set $A =\{2, 3, 4\}$, then $A^c =\{1\} = Y$ is an atom.
• $X\cup Y = \Omega\setminus\{1, 3\} = \{2, 4\} = Z$.

Given these three atoms, the $\sigma$-algebra is $\{\emptyset, X, Y, Z, X\cup Y, X\cup Z, Y\cup Z,\Omega\}$.

It is likely a typo: what is intended is $(X \cup Y)^c = \Omega \setminus \{1,3\} = \{2,4\} =: Z$.
• What do you mean by that? An attempt at clarification: Since $X$ and $Y$ do not suffice to create $\{2,3,4\} \in C$, we need a further atom. $Z$ (the complement of the union of all preceding atoms) is our next attempt at adding an atom. Because $X,Y,Z$ suffice to create all sets in $C$, we needn't split up $Z$ into smaller atoms. – Lord_Farin Apr 19 '13 at 13:38