Collection vs. set of subsets vs. set of all subsets vs. family of sets

Question

Collection vs. set of subsets vs. set of all subsets?

These get mixed. But the idea that I have is:

collection: a set of subsets, where order is ignored. So it's like a weaker form of set.

set of subsets: could be a collection, however since this is set of subsets, then one may not know whether the weakened properties of collections suffice. Or whether one actually has set of collections.

set of all subsets or the power set: this could be a collection, but it's not required to be one, because one could refrain from using the term collection and rather use subset.

family of sets or family of subsets is by definition a collection $F$ of subsets of a given set $S$. So it seems like here collection is the same as set of subsets, but also family of subsets. Or also, family is a set.

I wonder what sense does it make to use the terms collection and family at all? If they are sets, then why not call them sets?

Answer 1

In Axiomatic Set Theory everything is a set; it's the only kind of object the language talks about. So there you have sets of sets, sets of sets of sets, etc. For my own sanity I use family, collection, congeries as synonyms for `set'. So, I have some set where it all happens, it has subsets, there are families of (sub)sets and, if need be, congeries of families of (sub)sets. But, to repeat, these are all synonyms; the words serve to remind me at what level I am.

Answer 2

I think that you are radically over-analysing the language. A "collection" of (sub)sets, a "family" of (sub)sets, and a "set" of (sub)sets are all referring to the same kind of object: a set whose elements are subsets of some other set. Note, even, that the Wikipedia disambiguation page for "collection" links to "set" and "family of sets". Wikipedia does seem to make some distinction between a "family of sets" and the other terms, but this is likely highly context-dependent, and such a distinction probably wouldn't matter to someone who is not an expert in set theory.

As examples:

• The powerset of a set $S$ is set (or collection of sets, or family of sets). In particular, the powerset $\mathscr{P}(S)$ is a set where every element of $\mathscr{P}(S)$ is a subset of $S$. Indeed, we can say something stronger: $$ A \in \mathscr{P}(S) \iff A \subseteq S. $$ In other words, the powerset of a set $S$ is a set (or a collection, or a family) which contains all of the subsets of $S$.
• A topology on a set $T$ is a set $\mathscr{T}$ where every element of $\mathscr{T}$ is a subset of $T$. That is, if $U \in \mathscr{T}$, then $U \subseteq T$. For example, if we let $\mathscr{T}$ denote the usual topology on $\mathbb{R}$, then the interval $(0,1)$ is a subset of $\mathbb{R}$ (as every element of $(0,1)$ is a real number), but $(0,1)$ is a singleton element of $\mathscr{T}$ (since $(0,1)$ is an open set in the usual topology).
• A $\sigma$-algebra on set $X$ is a set $\Sigma$ where every element of $\Sigma$ is a subset of $X$.

I suspect that the terms "family" and "collection" exist as a form of disambiguation. "A set of sets" is somewhat awkward to say, and in verbal communication I can see where it would be useful to distinguish between the underlying set, and the set which contains subsets of the underlying set (e.g. we can refer to a topology as a "collection", then talk about element of the collection and subsets of the underlying set).