Let $X$ be a set with $n$ elements. Prove that $$ \sum_{Y, Z \subseteq X}|Y \cap Z|=n \cdot 4^{n-1} $$ The sum is over all possible pairs $(Y, Z)$ of subsets of $X$.
I do not need a solution, but rather I need help in understanding this problem, for trying to understand what it says, I took $n=3$ case, say $X=\{1,3,5\}$, now we can list out all possible subsets that are as following (excluding null set as its not relevant here):
$$A\{1\}, B\{3\}, C\{5\}, D\{1,3\}, E\{1,5\}, F\{3,5\}, G\{1,3,5\}$$
Next I list out all possible non empty intersections of these subsets, which is as following:
$$\begin{aligned} & A \cap D=\{1\}, \quad A \cap E=\{1\}, \quad A \cap G=\{1\} \\ & B \cap D=\{3\}, \quad B \cap F=\{3\}, \quad B \cap G=\{3\} \\ & C \cap E=\{5\}, \quad C \cap F=\{5\}, \quad C \cap G=\{5\} \\ & D \cap E=\{1\}, \quad D \cap F=\{3\}, \quad D \cap G=\{1,3\} \\ & E \cap F=\{5\}, \quad E \cap G=\{1,5\}, \quad F \cap G=\{3,5\} . \end{aligned}\\$$
Clearly the sum of cardinality of all these subsets is $18$, and not $3 \times 4^{2}=48$, so what an I misunderstanding here?