The example I'm using is from Wikipedia
The set { 1, 2, 3 } has these five partitions (one partition per item):
{ {1}, {2}, {3} }, sometimes written 1|2|3.
{ {1, 2}, {3} }, or 12|3.
{ {1, 3}, {2} }, or 13|2.
{ {1}, {2, 3} }, or 1|23.
{ {1, 2, 3} }, or 123 (in contexts where there will be no confusion with the number).
Question:
If I take any of the 2-1 partitions 12|3, 13|2, or 1|23 and find the intersection with 1|2|3 isn't it non-empty? Therefore why is it a partition?
$\{ \{1\}, \{2\},\{3\}\}$ is a partition because $\{1\} \cup \{2\} \cup \{3\} = \{1,2,3\} $ and $\{1\} \cap \{2\}= \emptyset, \{1\} \cap \{3\}= \emptyset,\{2\} \cap \{3\}= \emptyset$.
Notice that the verification process doesn't involve another partition.
It is alright for two different partitions to intersect.