Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T13:26:47.909Z Has data issue: false hasContentIssue false

PERMUTATION GROUPS IN o-MINIMAL STRUCTURES

Published online by Cambridge University Press:  13 February 2001

DUGALD MACPHERSON
Affiliation:
Department of Pure Mathematics, University of Leeds, Leeds LS2 9JT; h.d.macpherson@leeds.ac.uk
ALEX MOSLEY
Affiliation:
21 St Luke's Mews, London W11 1DF
KATRIN TENT
Affiliation:
Mathematisches Institut, Universität Würzburg, Am Hubland, 97074 Würzburg, Germany; tent@mathematik.uni-wuerzburg.de

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we develop a structure theory for transitive permutation groups definable in o-minimal structures. We fix an o-minimal structure [Mscr], a group G definable in [Mscr], and a set Ω and a faithful transitive action of G on Ω definable in [Mscr], and talk of the permutation group (G, Ω). Often, we are concerned with definably primitive permutation groups (G, Ω); this means that there is no proper non-trivial definable G-invariant equivalence relation on Ω, so definable primitivity is equivalent to a point stabiliser Gα being a maximal definable subgroup of G. Of course, since any group definable in an o-minimal structure has the descending chain condition on definable subgroups [23] we expect many questions on definable transitive permutation groups to reduce to questions on definably primitive ones.

Recall that a group G definable in an o-minimal structure is said to be connected if there is no proper definable subgroup of finite index. In some places, if G is a group definable in [Mscr] we must distinguish between definability in the full ambient structure [Mscr] and G-definability, which means definability in the pure group G:= (G, .); for example, G is G-definably connected means that G does not contain proper subgroups of finite index which are definable in the group structure. By definable, we always mean definability in [Mscr]. In some situations, when there is a field R definable in [Mscr], we say a set is R-semialgebraic, meaning that it is definable in (R, +, .). We call a permutation group (G, Ω) R-semialgebraic if G, Ω and the action of G on Ω can all be defined in the pure field structure of a real closed field R. If R is clear from the context, we also just write ‘semialgebraic’.

Information

Type
Research Article
Copyright
The London Mathematical Society 2000