# Indexed family

In mathematics, an indexed family is a collection of values associated with indices. For example, a family of real numbers, indexed by the integers is a collection of real numbers, where each integer is associated with one of the real numbers.

Formally, an indexed family is the same thing as a mathematical function; a function with domain J and codomain X is equivalent to a family of elements of X indexed by elements of J. The difference is conceptual; indexed families are interpreted as collections instead of as functions. Every element of the image of the family's underlying function is an element of the family.

When a function f : JX is treated as a family, J is called the index set of the family, the function image f(j) for jJ is denoted xj, and the mapping f is denoted {xj}jJ or simply {xj}.

Next, if the set X is the power set of a set U, then the family {xj}jJ is called a family of sets indexed by J .

## Mathematical statement

Definition. Let X and I be any sets. Then by family of elements in X indexed by I , we mean a function ${\displaystyle x:I\mapsto X}$. An indexed family is denoted by ${\displaystyle \{x_{i}\}_{i\in I}}$, where it is understood that there is a function x that maps i to ${\displaystyle x_{i}:=x(i)\,}$.

An indexed family can be turned into a set by considering the set ${\displaystyle {\mathcal {X}}:=\{x_{i}:i\in I\}}$, that is, the range of x, but this will collapse the elements ${\displaystyle x_{i}=x_{j}}$ with ${\displaystyle i\neq j}$ into one element in ${\displaystyle {\mathcal {X}}}$. This is because we are writing down the sets that are in the range into another set called ${\displaystyle {\mathcal {X}}}$. Since, ${\displaystyle {\mathcal {X}}}$ is a set, repeat elements collapse into one. Thus, |${\displaystyle {\mathcal {X}}}$| <= | ${\displaystyle \{x_{i}\}_{i\in I}}$| where |A| denotes cardinality of the set.

Definition. Let S be a set. An indexed family of sets ${\displaystyle \{C_{i}\}_{i\in I}}$ is an indexed family that maps I to elements of the power set of S.

Hence, an indexed family of sets is conceptually different from a family of sets (which is just a synonym for "set of sets"), but in practice the distinction is sometimes fuzzy and the indexed family is identified with its range and treated like an ordinary family.

## Examples

### Index notation

Whenever index notation is used the indexed objects form a family. For example, consider the following sentence.

• The vectors v1, …, vn are linearly independent.

Here (vi)i ∈ {1, …, n} denotes a family of vectors. The i-th vector vi only makes sense with respect to this family, as sets are unordered and there is no i-th vector of a set. Furthermore, linear independence is only defined as the property of a collection; it therefore is important if those vectors are linearly independent as a set or as a family.

If we consider n = 2 and v1 = v2 = (1, 0), the set of them consists of only one element and is linearly independent, but the family contains the same element twice and is linearly dependent.

### Matrices

Suppose a text states the following:

• A square matrix A is invertible, if and only if the rows of A are linearly independent.

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

${\displaystyle A={\begin{bmatrix}1&1\\1&1\end{bmatrix}}.}$

The set of rows only consists of a single element (1, 1) and is linearly independent, but the matrix is not invertible. The family of rows contains two elements and is linearly dependent. The statement is therefore correct if it refers to the family of rows, but wrong if it refers to the set of rows. (The statement is also correct when "the rows" is interpreted as referring to a multiset, in which the elements are also kept distinct but which lacks some of the structure of an indexed family.)

## Functions, sets and families

Surjective functions and families are formally equivalent, as any function f with domain I induces a family (f(i))iI. In practice, however, a family is viewed as a collection, not as a function: being an element of a family is equivalent with being in the range of the corresponding function. A family contains any element exactly once, if and only if the corresponding function is injective.

Like a set, a family is a container and any set X gives rise to a family (xx)xX. Thus any set naturally becomes a family. For any family (Ai)iI there is the set of all elements {Ai | iI}, but this does not carry any information on multiple containment or the structure given by I. Hence, by using a set instead of the family, some information might be lost.

## Examples

Let n be the finite set {1, 2, …, n}, where n is a positive integer.

## Operations on families

Index sets are often used in sums and other similar operations. For example, if (ai)iI is a family of numbers, the sum of all those numbers is denoted by

${\displaystyle \sum _{i\in I}a_{i}.}$

When (Ai)iI is a family of sets, the union of all those sets is denoted by

${\displaystyle \bigcup _{i\in I}A_{i}.}$

Likewise for intersections and cartesian products.

## Subfamily

A family (Bi)iJ is a subfamily of a family (Ai)iI, if and only if J is a subset of I and for all i in J

Bi = Ai

## Usage in category theory

{{#invoke:main|main}}

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.

## References

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