Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-25T19:31:11.360Z Has data issue: false hasContentIssue false

Normal subgroups of infinite symmetric groups, with an application to stratified set theory

Published online by Cambridge University Press:  12 March 2014

Nathan Bowler
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge Cb3 0Wb, United Kingdom, E-mail: N.Bowler@dpmms.cam.ac.uk, E-mail: T.Forster@dpmms.cam.ac.uk
Thomas Forster
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge Cb3 0Wb, United Kingdom, E-mail: T.Forster@dpmms.cam.ac.uk

Extract

It is generally known that infinite symmetric groups have few nontrivial normal subgroups (typically only the subgroups of bounded support) and none of small index. (We will explain later exactly what we mean by small). However the standard analysis relies heavily on the axiom of choice. By dint of a lot of combinatorics we have been able to dispense—largely—with the axiom of choice. Largely, but not entirely: our result is that if X is an infinite set with ∣X∣ = ∣X × X∣ then Symm(X) has no nontrivial normal subgroups of small index. Some condition like this is needed because of the work of Sam Tarzi who showed [4] that, for any finite group G, there is a model of ZF without AC in which there is a set X with Symm(X)/FSymm(X) isomorphic to G.

The proof proceeds in two stages. We consider a particularly useful class of permutations, which we call the class of flexible permutations. A permutation of X is flexible if it fixes at least ∣X∣-many points. First we show that every normal subgroup of Symm(X) (of small index) must contain every flexible permutation. This will be theorem 4. Then we show (theorem 7) that the flexible permutations generate Symm(X).

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Forster, T. E., Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF, this Journal, vol. 71 (2006), pp. 227240.Google Scholar
[2]Holmes, M. R., Symmetry as a criterion for comprehension motivating Quine's ‘new foundations’. Studia Logica, vol. 88 (03 2008), pp. 195213.CrossRefGoogle Scholar
[3]Jensen, R. B., On the consistency of a slight(1) modification of Quine's NF, Synthese, vol. 19 (1969), pp. 250–63.CrossRefGoogle Scholar
[4]Tarzi, Sam., Group actions on amorphous sets and reducts of coloured random graphs, Ph.D. thesis, University of London, 2002, see also http://www.maths.qmul.ac.uk/~pjc/preprints/amorph.ps.Google Scholar