Let ${\displaystyle I}$  and ${\displaystyle X}$  be sets and ${\displaystyle f}$  a function such that

Functions and indexed families are formally equivalent, since any function ${\displaystyle f}$  with a domain ${\displaystyle I}$  induces a family ${\displaystyle (f(i))_{i\in I}}$  and conversely. Being an element of a family is equivalent to being in the range of the corresponding function. In practice, however, a family is viewed as a collection, rather than a function.

Any set ${\displaystyle X}$  gives rise to a family ${\displaystyle \left(x_{x}\right)_{x\in X},}$  where ${\displaystyle X}$  is indexed by itself (meaning that ${\displaystyle f}$  is the identity function). However, families differ from sets in that the same object can appear multiple times with different indices in a family, whereas a set is a collection of distinct objects. A family contains any element exactly once if and only if the corresponding function is injective.

An indexed family ${\displaystyle \left(x_{i}\right)_{i\in I}}$  defines a set ${\displaystyle {\mathcal {X}}=\{x_{i}:i\in I\},}$  that is, the image of ${\displaystyle I}$  under ${\displaystyle f.}$  Since the mapping ${\displaystyle f}$  is not required to be injective, there may exist ${\displaystyle i,j\in I}$  with ${\displaystyle i\neq j}$  such that ${\displaystyle x_{i}=x_{j}.}$  Thus, ${\displaystyle |{\mathcal {X}}|\leq |I|}$ , where ${\displaystyle |A|}$  denotes the cardinality of the set ${\displaystyle A.}$  For example, the sequence ${\displaystyle \left((-1)^{i}\right)_{i\in \mathbb {N} }}$  indexed by the natural numbers ${\displaystyle \mathbb {N} =\{1,2,3,\ldots \}}$  has image set ${\displaystyle \left\{(-1)^{i}:i\in \mathbb {N} \right\}=\{-1,1\}.}$  In addition, the set ${\displaystyle \{x_{i}:i\in I\}}$  does not carry information about any structures on ${\displaystyle I.}$  Hence, by using a set instead of the family, some information might be lost. For example, an ordering on the index set of a family induces an ordering on the family, but no ordering on the corresponding image set.

Indexed subfamily edit

An indexed family ${\displaystyle \left(B_{i}\right)_{i\in J}}$  is a subfamily of an indexed family ${\displaystyle \left(A_{i}\right)_{i\in I},}$  if and only if ${\displaystyle J}$  is a subset of ${\displaystyle I}$  and ${\displaystyle B_{i}=A_{i}}$  holds for all ${\displaystyle i\in J.}$ 

Indexed vectors edit

For example, consider the following sentence:

The vectors ${\displaystyle v_{1},\ldots ,v_{n}}$  are linearly independent.

Here ${\displaystyle \left(v_{i}\right)_{i\in \{1,\ldots ,n\}}}$  denotes a family of vectors. The ${\displaystyle i}$ -th vector ${\displaystyle v_{i}}$  only makes sense with respect to this family, as sets are unordered so there is no ${\displaystyle i}$ -th vector of a set. Furthermore, linear independence is defined as a property of a collection; it therefore is important if those vectors are linearly independent as a set or as a family. For example, if we consider ${\displaystyle n=2}$  and ${\displaystyle v_{1}=v_{2}=(1,0)}$  as the same vector, then the set of them consists of only one element (as a set is a collection of unordered distinct elements) and is linearly independent, but the family contains the same element twice (since indexed differently) and is linearly dependent (same vectors are linearly dependent).

Matrices edit

Suppose a text states the following:

A square matrix ${\displaystyle A}$  is invertible, if and only if the rows of ${\displaystyle A}$  are linearly independent.

As in the previous example, it is important that the rows of ${\displaystyle A}$  are linearly independent as a family, not as a set. For example, consider the matrix

Other examples edit

Let ${\displaystyle \mathbf {n} }$  be the finite set ${\displaystyle \{1,2,\ldots n\},}$  where ${\displaystyle n}$  is a positive integer.

• An ordered pair (2-tuple) is a family indexed by the set of two elements, ${\displaystyle \mathbf {2} =\{1,2\};}$  each element of the ordered pair is indexed by each element of the set ${\displaystyle \mathbf {2} .}$ 
• An ${\displaystyle n}$ -tuple is a family indexed by the set ${\displaystyle \mathbf {n} .}$ 
• An infinite sequence is a family indexed by the natural numbers.
• A list is an ${\displaystyle n}$ -tuple for an unspecified ${\displaystyle n,}$  or an infinite sequence.
• An ${\displaystyle n\times m}$  matrix is a family indexed by the Cartesian product ${\displaystyle \mathbf {n} \times \mathbf {m} }$  which elements are ordered pairs; for example, ${\displaystyle (2,5)}$  indexing the matrix element at the 2nd row and the 5th column.
• A net is a family indexed by a directed set.

Index sets are often used in sums and other similar operations. For example, if ${\displaystyle \left(a_{i}\right)_{i\in I}}$  is an indexed family of numbers, the sum of all those numbers is denoted by

When ${\displaystyle \left(A_{i}\right)_{i\in I}}$  is a family of sets, the union of all those sets is denoted by

Likewise for intersections and Cartesian products.

The analogous concept in category theory is called a diagram. A diagram is a functor giving rise to an indexed family of objects in a category C, indexed by another category J, and related by morphisms depending on two indices.

• Array data type – Data type that represents an ordered collection of elements (values or variables)Pages displaying short descriptions of redirect targets
• Coproduct – Category-theoretic construction
• Diagram (category theory) – Indexed collection of objects and morphisms in a category
• Disjoint union – In mathematics, operation on sets
• Family of sets – Any collection of sets, or subsets of a set
• Index notation – Manner of referring to elements of arrays or tensors
• Net (mathematics) – A generalization of a sequence of points
• Parametric family – family of objects whose definitions depend on a set of parametersPages displaying wikidata descriptions as a fallback
• Sequence – Finite or infinite ordered list of elements
• Tagged union – Data structure used to hold a value that could take on several different, but fixed, types

• Mathematical Society of Japan, Encyclopedic Dictionary of Mathematics, 2nd edition, 2 vols., Kiyosi Itô (ed.), MIT Press, Cambridge, MA, 1993. Cited as EDM (volume).