Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We have a set A with finite elements, where A is a subset of Power set of Omega. prove that total number of elements in the sigma algebra generated by A is at most 2^2^|Omega|

share|improve this question
3  
What have you tried? –  Nate Eldredge Sep 21 '12 at 22:01
add comment

1 Answer

Proof.

Suppose that $\Sigma$ is a $\sigma$-algebra generated by $A$, then $\Sigma \subseteq \wp(A)$; and since $A \subseteq \wp(\Omega)$, so consequently $|\Sigma|\le 2^{|A|}$ and $|A|\le 2^{|\Omega|}$. Hence $|\Sigma|\le 2^{2^{|\Omega|}}$

$\Box$

share|improve this answer
add comment

Your Answer

 
discard

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.