# Finitary symmetric group on countable set is subgroup-universal for finite groups

From Groupprops

Revision as of 17:11, 14 October 2008 by Vipul (talk | contribs) (New page: {{embeddability theorem}} ==Statement== Let <math>\Omega</math> be a countably infinite set and <math>G := \operatorname{FSym}(\Omega)</math> be the finitary symmetric group on <math...)

This article gives the statement, and possibly proof, of an embeddability theorem: a result that states that any group of a certain kind can be embedded in a group of a more restricted kind.

View a complete list of embeddability theorems

## Statement

Let be a countably infinite set and be the finitary symmetric group on . Then, is **subgroup-universal** for finite groups. In other words, if is any finite group, is isomorphic to a subgroup of .

## Facts used

- Cayley's theorem: This states that every group embeds as a subgroup of the symmetric group on its underlying set.

## Proof

The proof follows from fact (1), and the observation that the symmetric group on any finite set is isomorphic to some subgroup of -- namely, the subgroup comprising the permutations on a finite subset of of the same cardinality.