Search arXivSearch

arXiv · math/0212233

Possible Cardinalities of Maximal Abelian Subgroups of Quotients of Permutation Groups of the Integers

Abstract

The maximality of Abelian subgroups play a role in various parts of group theory. For example, Mycielski has extended a classical result of Lie groups and shown that a maximal Abelian subgroup of a compact connected group is connected and, furthermore, all the maximal Abelian subgroups are conjugate. For finite symmetric groups the question of the size of maximal Abelian subgroups has been examined by Burns and Goldsmith in 1989 and Winkler in 1993. We show that there is not much interest in generalizing this study to infinite symmetric groups; the cardinality of any maximal Abelian subgroup of the symmetric group of the integers is 2^{aleph_0}. Our purpose is also to examine the size of maximal Abelian subgroups for a class of groups closely related to the the symmetric group of the integers; these arise by taking an ideal on the integers, considering the subgroup of all permutations which respect the ideal and then taking the quotient by the normal subgroup of permutations which fix all integers except a set in the ideal. We prove that the maximal size of Abelian subgroups in such groups is sensitive to the nature of the ideal as well as various set theoretic hypotheses.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saharon Shelah, Juris Stepráns. 2002-12-17. Possible Cardinalities of Maximal Abelian Subgroups of Quotients of Permutation Groups of the Integers. https://arxiv.org/abs/math/0212233

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO