Formula for Cardinality of Power Sets | Set Theory

preview_player
Показать описание
What is the formula for the cardinality of power sets? Why does it work? We go over all of that in today's math lesson! Recall that the power set, of a set A, is the set containing all subsets of A. So, for example, let A = { 1, 2, 3 }. Then, the power set of A, denoted P(A), is

P(A) = { { }, { 1 }, { 2 }, { 3 }, { 1, 2 }, { 1, 3 }, { 2, 3 }, { 1, 2, 3 } }.

Every subset of A is an element of P(A). So how many elements are in P(A)? If we count them up, we see there are 8 elements, which is equal to 2^3. Notice that |A| = 3. So |P(A)| = 2^(|A|). This is true in general. If the cardinality of a set S is n, then the cardinality of P(S) is 2^n. So why does this work?

We have to ask ourselves how many subsets any given set has, as this number is the same as the cardinality of the power set. If our set S has n elements, then how many subsets of S are there? Well, since S has n elements, we can write it like this:

S = { 1, 2, 3, ..., n },

where each number is just a label for each of the n elements of S. Then, if we are creating a subset of S, it could either contain or not contain the element labeled 1. So we have 2 possibilities. Then, for each of those two possibilities, our subset could either contain or not contain the element labeled 2, so now we are up to 2*2 possibilities. This reasoning continues up to the nth element, where we then have 2^n possibilities. This is where the formula comes from. There are 2^n subsets of any set with n elements, so the power set, which is the set of all subsets, has cardinality 2^n.

I hope you find this video helpful, and be sure to ask any questions down in the comments!

********************************************************************
The outro music is by a favorite musician of mine named Vallow, who, upon my request, kindly gave me permission to use his music in my outros. I usually put my own music in the outros, but I love Vallow's music, and wanted to share it with those of you watching. Please check out all of his wonderful work.

********************************************************************

+WRATH OF MATH+

Follow Wrath of Math on...

Рекомендации по теме
Комментарии
Автор

It was this simple all along?! None of the proof videos I’ve watched have given me an intuitive answer to “why” it works. This video does. Thank you for explaining it so simply!

isaachester
Автор

If we add a new element to the set, all existing subsets now must include the newly added element, and the previous ones also remain in the powerset. Thus, the number of previous subsets times two equals the new number of subsets.

suatozcan
Автор

Good explanation and Best Video - thanks!

ميناروبير
Автор

I am from India ❤ and i can understand your vedio

bhartijoshi
Автор

I have a question! why is it 8 subsets in total when 2 to the power of 3 is 9 for me am I miscalculating something?. No hate im just asking cuz im new😅

squirrel
Автор

Thank you! This really helps me!! But do you have a video on how to use the Venn Diagram i'm stuck in Venn Diagram

cc-shih
Автор

What if the n is equal to 10? For example {1, 2, 3, ...., 10}? What would be the answer? Is it |P(S)|=2 to the power of 10?

EjayEat
Автор

Very useful video❣️ Easy to understand.

robelynagos
Автор

What is the caridinality of set {0, {0}, {0, {0}}}? can u please explain

khavanu
Автор

The Cardinality for this set { (1, 2) } is one right?

bubu.__
Автор

Very well explained,
Can you please do a proof of why 2 power n is true using proof by induction ?

Thank you

nuche
Автор

what is the cardinality of this set P(H)+{{D}, {O}, {G}, {D, O}, {D, G}, {O, G}, {D, O, G}, { } } ?

jilliantalle
Автор

Subbed.
Could you explain how to prove this formula via induction tho? :D

Brontosuchus