Does every subset start with an empty set?
If $A = \{a,b\}$, then the subsets of $A$ are $\{a\},\{b\},\{a,b\}$.
Not sure if that is correct.
Does every subset start with an empty set?
If $A = \{a,b\}$, then the subsets of $A$ are $\{a\},\{b\},\{a,b\}$.
Not sure if that is correct.
The empty set $\emptyset$ is a subset of every set, including the set $A$. The subsets of $A$ are $\emptyset$, $\{a\}$, $\{b\}$, and $\{a, b\}$.
From the definition of subset containment:
If, for every $a \in A$, we have $a \in B$, then we say $A \subseteq B$.
To test whether $\emptyset \subseteq S$:
For each $x \in \emptyset$, we need to make sure $x \in S$. But $x \in \emptyset$ is always false, so the implication is vacuously true; thus, $\emptyset \subseteq S$, for all sets $S$ (even if $S = \emptyset$).
Adding to Michael's answer: are you familiar with what a power set is (briefly, it is the set of all subsets of a set)? If so, then you would know that $|\mathcal{P}(A)|=2^n$, where $n$ denotes the number of elements in $A$.
For your problem, you have $A = \{a,b\}$. Hence, $n=2$ and so you know $|\mathcal{P}(A)|=2^2=4$. Thus, there are four subsets of $A$. You listed three of them: $\{a\},\{b\},\{a,b\}$. The one you forgot was, indeed, the empty set.