Content deleted Content added
No edit summary |
|||
Line 40:
Another set-denotational convention that relies on metaphor comes from [[enumerative combinatorics]]. It derives a symbol for a set {{math|''S''}} from an expression for the set's [[cardinality]], or size, {{math||''S''|}}. Perhaps the simplest and best known example is the [[Cartesian product]] of sets {{math|''A''}} and {{math|''B''}}, which is the set {{math|{(''a'', ''b'') : ''a''∈''A'', ''b''∈''B''}}}. Since in this set every element of {{math|''A''}} gets paired exactly once with every element of {{math|''B''}}, its cardinality is {{math||''A''| × |''B''|}}. For this reason, the set is denoted by {{math|''A''×''B''}}. In fact, that same fact about its cardinality is why this set is called a ''product''.
There are many other examples of this convention. One is the set of [[Function (mathematics)|functions]] from set {{math|''A''}} to set {{math|''B''}}. When {{math|''A''}} and {{math|''B''}} are [[Finite set|finite]], specifying any such function amounts to choosing for each element of {{math|''A''}} which element of {{math|''B''}} should be its [[image (mathematics)|image]]
An example where this cardinality-based convention appears not to have been used yet is {{math|''X''!}} to denote the set of all [[permutations]] of a set {{math|''X''}}. Since it is usually seen as the underlying set of a [[symmetric group]], this set is typically denoted by a symbol for the group itself, either {{math|''S''<sub>''X''</sub>}} or {{math|Sym(''X'')}}.
|