Index set

From formulasearchengine
Revision as of 12:34, 25 November 2014 by en>Brirush (Added reference)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Template:Distinguish In mathematics, an index set is a set whose members label (or index) members of another set.[1][2] For instance, if the elements of a set A may be indexed or labeled by means of a set J, then J is an index set. The indexing consists of a surjective function from J onto A and the indexed collection is typically called an (indexed) family, often written as (Aj)jJ.

Examples

The set of all the functions is an uncountable set indexed by .

Other uses

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; i.e., on input 1n, I can efficiently select a poly(n)-bit long element from the set.[3]

See also

References

  1. Template:Cite web
  2. Munkres, James R. Topology. Vol. 2. Upper Saddle River: Prentice Hall, 2000.
  3. {{#invoke:citation/CS1|citation |CitationClass=book }}