A family, or indexed family (or sometimes indexed set, etc), consists of an index set (whose elements are the indices of the family) and, for each index , some element . One can also speak of an -indexed family. An ordered pair is a family indexed by ; an infinite sequence is an -indexed family.
As a whole, this family may be denoted , , , or simply . Sometimes one sees braces used instead of parentheses, giving the same notation for a family as for a collection, although this is falling out of fashion; the parentheses ultimately come from notation for ordered pairs. One can also use notation for functions, such as or . Finally, instead of , one can see the type of indicated using any other method, especially (which ultimately derives from material set theory).
Formally, a family of things should be distinguished from a collection of things; properly, it is the range of a family of things that is a collection, such as a subset of an appropriate ambient set of things. On the other hand, often the difference between a family and a collection is unimportant, and the two may be used interchangeably. (For example, one can take the union of either a family of subsets or a collection of subsets, with equivalent results; but one can take the sum of only a family of cardinal numbers.)
We have been vague so far about what a family is a family of (what the elements are). The easiest case is when the elements are from a set ; then an -indexed family of elements of , also called an indexed subset of , is simply a function to from . If the elements are from a category , then an -indexed family of objects of is a functor (or anafunctor) to from the discrete category on , and an -indexed family of morphisms of , also called an indexed subcategory, is similarly a functor to the arrow category of . In general, the elements ought to be from (at the very least) some sort of -groupoid , in which case the family is a functor to from the discrete -groupoid on .
In foundations without proper classes, it may be tricky to specify exactly what a family of sets is, if one cannot literally speak of a functor from a discrete category to the large category Set; see the article. On the other hand, there is no difficulty in speaking of a family of subsets of a given set; even in predicative mathematics (where one cannot speak of the power set), a family of subsets of is simply a binary relation between and some index set , writing to denote that the -element is related to the index .