• An enumeration of a set S gives an index set ${\displaystyle J\subset \mathbb {N} }$ , where f : J → S is the particular enumeration of S.
• Any countably infinite set can be (injectively) indexed by the set of natural numbers ${\displaystyle \mathbb {N} }$ .
• For ${\displaystyle r\in \mathbb {R} }$ , the indicator function on r is the function ${\displaystyle \mathbf {1} _{r}\colon \mathbb {R} \to \{0,1\}}$  given by $${\displaystyle \mathbf {1} _{r}(x):={\begin{cases}0,&{\mbox{if }}x\neq r\\1,&{\mbox{if }}x=r.\end{cases}}}$$ 

The set of all such indicator functions, ${\displaystyle \{\mathbf {1} _{r}\}_{r\in \mathbb {R} }}$ , is an uncountable set indexed by ${\displaystyle \mathbb {R} }$ .

In computational complexity theory and cryptography, an index set is a set for which there exists an algorithm I that can sample the set efficiently; e.g., on input 1ⁿ, I can efficiently select a poly(n)-bit long element from the set.^[3]

• Friendly-index set