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

closed as off-topic by Care Bear, Tomás, Daniel Fischer, le gâteau au fromage, Hakim Jul 20 at 0:12

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Care Bear, Tomás, Daniel Fischer, le gâteau au fromage, Hakim
If this question can be reworded to fit the rules in the help center, please edit the question.

3  
What have you tried? –  Nate Eldredge Sep 21 '12 at 22:01

1 Answer 1

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

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