Namespaces
Variants
Actions

Difference between revisions of "Congruence subgroup problem"

From Encyclopedia of Mathematics
Jump to: navigation, search
m (typo)
m (typo)
 
Line 1: Line 1:
 +
{{MSC|20G30}}
 
{{TEX|done}}
 
{{TEX|done}}
{{MSC|20G30}}
+
 
  
  

Latest revision as of 21:48, 5 March 2012

2020 Mathematics Subject Classification: Primary: 20G30 [MSN][ZBL]


The congruence subgroup problem deals with the following question:


Is every subgroup of finite index in $\def\O{\mathcal{O}}G_\O$, where $\O$ is the ring of integers in an algebraic number field $k$ (cf. Algebraic number theory) and $G$ is a connected linear algebraic group defined over $k$, a congruence subgroup?

This is the classical statement of the congruence subgroup problem. A contemporary version of it is based on the concept of the congruence subgroup kernel, which is a measure of the deviation from a positive solution. Let $\def\G{\Gamma}\G$ denote the group $G_\O$, and let $\hat\G$ and $\bar\G$ be the completions of the group $\G$ in the topologies defined by all its subgroups of finite index and all congruence subgroups of $\G$, respectively. Then there is a surjective continuous homomorphism $\pi:\hat\G \to \bar\G$. The kernel of $\pi$ is called the congruence subgroup kernel and is denoted by $c(G)$. The positive solution of the classical congruence subgroup problem is equivalent to proving $c(G) = 1$. In its modern form, the congruence subgroup problem is that of computing the congruence subgroup kernel $c(G)$.

If $\def\SL{\textrm{SL}}\G=\SL(n,\Z)$, where $\Z$ is the ring of integers, it was known already in the 19th century that the congruence subgroup problem has a negative solution for $n=2$. For $n\ge 3$, it was proved in 1965 that every subgroup of finite index in $\SL(n,\Z)$ is a congruence subgroup (see [BaMiSe]). After this, the congruence subgroup problem was solved [BaMiSe] for $\G = \SL(n,\O)$, $n\ge 3$, and $\def\Sp{\textrm{Sp}}\Sp(2n,\O)$, $n \ge 2$, where $\Sp$ denotes the symplectic group. The results are as follows for these groups; $c(G)\ne 1$ only for totally imaginary fields $k$, in which case the congruence subgroup kernel is isomorphic to the (cyclic) group of roots of unity in $k$. It turned out that the same result holds for simply-connected Chevalley groups other than $\SL(2,k)$ (see [Ma]). The condition of being simply connected is essential, because it follows from the strong approximation theorem (cf. Linear algebraic group) that the congruence subgroup kernel $c(G)$ of a non-simply-connected semi-simple group $G$ is infinite. For every non-semi-simple group $G$ one has $c(G)=c(H)$, where $H$ is a maximal semi-simple subgroup of $G$; in particular, $c(G) = 1$ for a solvable group $G$.

A more general form of the congruence subgroup problem is obtained by replacing $\O$ by the ring

$$\O_S = \{x \in k:v(x) \le 1 \textrm{ for all } v \notin S\}$$ where $S$ is any finite set of inequivalent valuations of the field $k$ containing all Archimedean valuations. In this situation, the congruence subgroup kernel, denoted by $c(G,S)$, depends in an essential way on $S$ (see [Pl], [Ra]).

References

[BaMiSe] H. Bass, J. Milnor, J-P. Serre, "Solution of the congruence subgroup problem for $\SL_n$ ($n\ge 3$) and $\Sp_{2n}$ ($n\ge 2$)" Publ. Math. IHES, 33 (1967) pp. 421–499 MR0244257 Zbl 0174.05203
[Pl] V.P. Platonov, "Algebraic groups" J. Soviet Math., 4 : 5 (1975) pp. 463–482 Itogi Nauk. i Tekhn. Algebra. Topol. Geom., 11 (1974) pp. 5–37 MR0466334 Zbl 0386.20019 Zbl 0305.20023
[Ra] M. Raghunathan, "On the congruence subgroup problem" Publ. Math. IHES, 46 (1976) pp. 107–161 MR0507030 Zbl 0347.20027
[Se] J.-P. Serre, "Le problème des groupes de congruence pour $\SL_2$" Ann. of Math., 92 (1970) pp. 489–527 MR0272790 Zbl 0239.20063
How to Cite This Entry:
Congruence subgroup problem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Congruence_subgroup_problem&oldid=21558
This article was adapted from an original article by V.P. Platonov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article