The most basic data structure is a set. Sets are defined by what is included or what is excluded. To understand what else this implies answer the following questions.
In mathematics concepts must be "well defined." This means there are no ambiguities. For sets this means that it must be possible to determine whether every object is in a set or not. Note this does not mean that any person necessarily knows the answer, rather that some means exists. For example every number is prime or it is not. However, no person knows or can list all the primes.
The terms collection, set, member, and element are undefined. Collection and set are synonyms. An element is an object that is included in a set. Element and member are synonyms. Because specific sets are defined by membership, sets do not have a concept of order of their elements.
For example \(E \subset \mathbb{Z}.\) Note when needed \(X \subseteq Y\) means \(X\) is a subset but might be equal to \(Y\) whereas \(X \subset Y\) means \(X\) is a subset and \(Y\) contains at least one element not in \(X.\) However, we rarely need to make this distinction in this class, so we will use \(\subset\) to mean \(\subseteq.\)