I am learning about σ-algebra. I am looking at an example of a set F ⊂ Ω and the authors are proving that F is a σ-algebra.
Let |A| denote the number of elements of a set A ⊂ Ω. Then, F is defined as F = {A ⊂ Ω: either |A| is finite or |Ac| is finite. So, among other things, they trying to prove that in line with the standard definition of σ-algebra that if a subset B ⊂ F ⇒ Bc ⊂ F.
For THIS particular example, they are defining the complement of |A| as |Ac|c = |A|. I am unable to understand this particular equality. Can someone please explain how they came up with this equality?
I had a similar question in an exercise I'm about to post (replace the statement "$|A|$ is finite" with "$A$ is countable").
We're trying to show that if $A$ is in this algebra, then so is $A^C$. So suppose $A$ is in the algebra, and, WLOG, suppose that A is a finite set. Consider the set $A^C$. To be in the algebra, either this set, or its complement, $A$, must be in it. We already know $A$ is in, so $A^C$ is in.
Remember that complement has an involution property: the complement of the complement is the original set.