Finitary permutation

From Groupprops
Revision as of 14:43, 16 March 2009 by Vipul (talk | contribs) (New page: ==Definition== Let <math>S</math> be a set. A permutation <math>\sigma</math> on <math>S</math> is termed a '''finitary permutation''' if the set of points <math>s \in S</math> such that ...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


Let S be a set. A permutation \sigma on S is termed a finitary permutation if the set of points s \in S such that \sigma(s) \ne s is a finite subset of S.

For a finite set, every permutation is finitary. For an infinite set, all permutations are not finitary. The finitary permutations form a proper subgroup of the symmetric group on S, termed the finitary symmetric group on S and denoted \operatorname{FSym}(S).

Related facts