Book contents
- Frontmatter
- Contents
- Preface
- Continuous Functionals of Dependent and Transfinite Types
- Degree-Theoretic Aspects of Computably Enumerable Reals
- Simplicity and Independence for Pseudo-Algebraically Closed Fields
- Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
- A Techniques Oriented Survey of Bounded Queries
- Relative Categoricity in Abelian Groups
- Computability and Complexity Revisited
- Effective Model Theory: The Number of Models and Their Complexity
- A Survey on Canonical Bases in Simple Theories
- True Approximations and Models of Arithmetic
- On the Topological Stability Conjecture
- A Mahlo-Universe of Effective Domains with Totality
- Logic and Decision Making
- The Sheaf of Locally Definable Scalars over a Ring
- Human Styles of Quantificational Reasoning
- Recursion Theoretic Memories 1954–1978
- Fields Definable in Simple Groups
- A Combinatory Algebra for Sequential Functionals of Finite Type
- Model Theory of Analytic and Smooth Functions
Fields Definable in Simple Groups
Published online by Cambridge University Press: 17 May 2010
- Frontmatter
- Contents
- Preface
- Continuous Functionals of Dependent and Transfinite Types
- Degree-Theoretic Aspects of Computably Enumerable Reals
- Simplicity and Independence for Pseudo-Algebraically Closed Fields
- Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
- A Techniques Oriented Survey of Bounded Queries
- Relative Categoricity in Abelian Groups
- Computability and Complexity Revisited
- Effective Model Theory: The Number of Models and Their Complexity
- A Survey on Canonical Bases in Simple Theories
- True Approximations and Models of Arithmetic
- On the Topological Stability Conjecture
- A Mahlo-Universe of Effective Domains with Totality
- Logic and Decision Making
- The Sheaf of Locally Definable Scalars over a Ring
- Human Styles of Quantificational Reasoning
- Recursion Theoretic Memories 1954–1978
- Fields Definable in Simple Groups
- A Combinatory Algebra for Sequential Functionals of Finite Type
- Model Theory of Analytic and Smooth Functions
Summary
Cherlin's Conjecture that an infinite simple group of finite Morely rank is an algebraic group over an algebraically closed field has been around for many years now, and has been the starting point for a considerable amount of research. In this survey paper we describe two approaches towards Cherlin's Conjecture, first without any stability assumption via the theory of algebraic groups and secondly via the theory of Tits buildings in the context of finite Morley rank. While the conjecture is still open, our results cover most classes of classical and algebraic groups and the (twisted) Chevalley groups.
Algebraic groups and Cherlin's Conjecture
Restricted to algebraic groups, Cherlin's Conjecture reduces to the following: If the group G(k) of k-rational points of an algebraic group G is a simple group of finite Morley rank, does this imply that k is algebraically closed? In similar form this was asked by Borovik and Nesin in [BN], p.367.
We show that this is (almost) true: whenever G is almost simple (or k-simple) and k-isotropic, the field k (or a finite extension of k) is definable in the pure group structure of G(k); hence if such a group has finite Morley rank, then k has to be either algebraically closed or real closed, thus answering Questions B.46 and B.48 in [BN] for these cases. This result should come as no surprise since in [BT73] it is shown that the group of abstract automorphisms of such a groups is essentially the group itself extended by the automorphism group of the field.
- Type
- Chapter
- Information
- Models and Computability , pp. 377 - 388Publisher: Cambridge University PressPrint publication year: 1999