DEV Community

Samuel Kendrick
Samuel Kendrick

Posted on

1

The number of elements in a power set of size <= 1 is the size of the original set + 1 more element: the empty set .

Suppose A=m|A|=m . What is the size of this set:

{XP(A):X1} | \{X \in \mathscr{P}(A) \in : |X| \leq 1 \} |

Let's start with a specific example:

{XP({1,2,3}):X1} | \{X \in \mathscr{P}(\{1,2,3\}) \in : |X| \leq 1 \} |

First, let's create the power set, stopping once we hit an element whose size is greater than 1:

P({1,2,3})={,{1},{2},{3}} {\mathscr{P}(\{1,2,3\})} = \{\emptyset, \{1\}, \{2\}, \{3\} \}

Notice that the number of elements of size 1\leq 1 is the size of the original set + 1 more element: the empty set.

Thus:

{XP(A):X1}=m+1 | \{X \in \mathscr{P}(A) \in : |X| \leq 1 \} | = m+1

Top comments (0)

👋 Kindness is contagious

Dive into this thoughtful article, cherished within the supportive DEV Community. Coders of every background are encouraged to share and grow our collective expertise.

A genuine "thank you" can brighten someone’s day—drop your appreciation in the comments below!

On DEV, sharing knowledge smooths our journey and strengthens our community bonds. Found value here? A quick thank you to the author makes a big difference.

Okay