Skip to main content

Subsection A.3.1 Sets and Combinatorics

Terminology.

Definition A.3.1 Set.

An order-independent collection of distinct items called elements (or members).
The number of objects contained in a given set is called its cardinality (or size).

Definition A.3.2 List.

A collection of elements from a universal set \(\mathcal{U}\) defined by a function:
\begin{equation*} L: \mathcal{I}_n \to \mathcal{U} \end{equation*}
where \(\mathcal{I}_n\) is a finite index set.
The number of elements in a list is called its length.

Note A.3.3.

Unlike sets, a list is order-dependent and may consist of repeated elements.
Universal Set
A context-specific domain \(\mathcal{U}\) containing all admissible elements that comprise a framework of interest.
Index Set
A set \(\mathcal{I}_n \cong \{1, 2, \dots, n\}, n\in\mathbb{Z}^+\) that acts as a dedicated counting space used to label and track elements of others sets.
In computer science convention, index sets are usually defined as \(\mathcal{I}_n \cong \{0, 1, 2, \dots, n\}, n\in\mathbb{N}_0\text{.}\)
Sequence
\((a_k)_{k \in \mathcal{I}_n}\)
An ordered, repeatable list of terms that are mapped directly from an index space.