This paper investigates the structure of semilinear automorphisms of reductive algebraic groups over fields, establishing conditions for splitting of automorphism sequences and providing examples where automorphism groups do not decompose straightforwardly.
Contribution
It characterizes the automorphism groups of reductive algebraic groups over fields, especially quasi-split cases, and explores the splitting conditions of associated exact sequences.
Findings
01
Aut_G(k) is isomorphic to Aut_{R(G)}(k) for quasi-split G
02
The exact sequence of automorphisms splits under specific conditions
03
Examples of groups with non-decomposable automorphism groups
Abstract
Let G be a connected reductive algebraic group over a field k. We study the group of semilinear automorphisms Aut(G→Spec k) consisting of algebraic automorphisms of G over automorphisms of k. We focus on the exact sequence 1→Aut G→Aut (G→Spec k)→AutG(k)→1. When G is quasi-split, we show that AutG(k) is isomorphic to AutR(G)(k), where R(G) denotes the scheme of based root datum of G. Furthermore, the exact sequence 1→Aut G→Aut (G→Spec k)→AutG(k)→1 splits if and only if the exact sequence 1→Aut R(G)→Aut (R(G)→Spec k)→AutR(G)(k)→1 splits. As a corollary, we get many examples of algebraic groups G over k whose group of abstract automorphisms does not decompose as the semidirect…
Equations125
1→(AdG)
1→(AdG)
1→AutG→Aut(G→Speck)→Aut(k)→H1(k,AutGks).
1→AutG→Aut(G→Speck)→AutG(k)→1
1→AutG→Aut(G→Speck)→AutG(k)→1
1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1
1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1
G
G
fφ=IdH×φ∗:H×SpeckSpecl→H×SpeckSpecl.
fφ=IdH×φ∗:H×SpeckSpecl→H×SpeckSpecl.
G0
G0
G0
G0
G0
G0
G0
G0
BRD
BRD
{fα∈Aut(G0→Specks)\leavevmode∣\leavevmodethe underlying α∈Aut(ks) belongs to Aut(ks≥k)}.
{fα∈Aut(G0→Specks)\leavevmode∣\leavevmodethe underlying α∈Aut(ks) belongs to Aut(ks≥k)}.
For all b∈AutG0,\leavevmodeβ∈Aut(ks≥k) and γ∈Γ,\leavevmode\leavevmode\leavevmodeγ.(bIdβ)=cβ−1γββ−1γβbβ−1cγ−1Idβ.
For all b∈AutG0,\leavevmodeβ∈Aut(ks≥k) and γ∈Γ,\leavevmode\leavevmode\leavevmodeγ.(bIdβ)=cβ−1γββ−1γβbβ−1cγ−1Idβ.
For all b∈E,\leavevmodeβ∈Aut(ks≥k) and γ∈Γ,\leavevmode\leavevmode\leavevmodeγ.(bIdβ)=c~β−1γβbc~γ−1Idβ.
For all b∈E,\leavevmodeβ∈Aut(ks≥k) and γ∈Γ,\leavevmode\leavevmode\leavevmodeγ.(bIdβ)=c~β−1γβbc~γ−1Idβ.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Advanced Topics in Algebra · Nonlinear Waves and Solitons
Full text
Semilinear automorphisms of reductive algebraic groups
Thierry Stulemeijer
Postdoctoral fellow at Justus-Liebig Universität Giessen
Justus-Liebig Universität Giessen, 35392 Giessen, Germany
(March 01, 2019)
Abstract
Let G be a connected reductive algebraic group over a field k. We study the group of semilinear automorphisms Aut(G→Speck) consisting of algebraic automorphisms of G over automorphisms of k. We focus on the exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1. When G is quasi-split, we show that AutG(k) is isomorphic to AutR(G)(k), where R(G) denotes the scheme of based root datum of G. Furthermore, the exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1 splits if and only if the exact sequence 1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1 splits. As a corollary, we get many examples of algebraic groups G over k whose group of abstract automorphisms does not decompose as the semidirect product of AutG with AutG(k). We also study the same questions for inner forms of SLn over a local field.
The so-called abstract automorphisms of (the rational points of) a reductive algebraic group have been studied extensively in the literature. In 1955, J. Dieudonné wrote a comprehensive treatise (see [Di71] for the third edition) covering the case of classical groups, and even going beyond the world of algebraic groups (since he also considers classical groups over division algebras that are infinite dimensional over their center). Many results in this area have been subsumed in the famous article [BT73] by A. Borel and J. Tits. To wit, here is one of their results:
Theorem** ([BT73]*excerpt of Corollaire 8.13).**
Let k be an infinite field, and let G be an absolutely simple algebraic group over k, which is assumed to be isotropic and adjoint. Furthermore, if k is of characteristic 2 or 3, assume that k is not perfect. Let α be an automorphism of G(k), considered as an abstract group. Then there exists a unique automorphism φ:k→k and a unique semilinear automorphism fφ:G→G over φ such that for g∈G(k)=Homk-schemes(Speck,G), we have α(g)=fφ∘g∘(Specφ)−1.
By a semilinear automorphismfφ of a k-group scheme G over an automorphism φ:k→k, we mean that we have the following commutative diagram in the category of group schemes
where the vertical arrows are the structural morphisms of the k-scheme G. Note that if G is realised as a matrix group, and if g=(gij)∈G(k), then fφ∘g∘(Specφ)−1 is given by the matrix whose ij-th coefficient is φ−1((fφ)ij(g)), so that our convention differs from [BT73] (see Remark 2.3 for a discussion of this difference).
Another way to phrase the Borel–Tits theorem is to say that the group Autabstract(G(k)) of abstract automorphisms of G(k) fits in the exact sequence 1→AutG→Autabstract(G(k))→Aut(k). Letting AutG(k) denote the image of Autabstract(G(k)) in Aut(k), it is natural to wonder what AutG(k) is, and whether the group of abstract automorphisms of G(k) splits as the semi-direct product (AutG)⋊AutG(k). While this semi-direct product decomposition does hold when G is k-split, it turns out that it may fail in general, even if G is quasi-split. One of the aims of the present paper is to address this issue.
To illustrate some of our results in the most concrete way, here is a corollary of our results (we refer the reader to Corollary 5.14 for a proof of this statement and to Remark 5.15 for an explicit realisation of the algebraic group appearing in this corollary) :
Let G be the quasi-split, absolutely simple, adjoint algebraic group of type 2An−1 over a field k with corresponding quadratic separable extension l. Let k0 be the field of rational numbers (respectively the field of p-adic numbers for some prime p) and assume that k and l are possibly infinite (respectively finite) Galois extensions of k0. Then AutG(k)=Gal(k/k0) and the short exact sequence 1→AutG→Autabstract(G(k))→AutG(k)→1 splits if and only if the short exact sequence of abstract groups 1→Gal(l/k)→Gal(l/k0)→Gal(k/k0)→1 splits.
We now recast the problem in a more useful way for us. Let Aut(G→Speck) denotes the group of semilinear automorphisms of G. We can then rephrase the Borel–Tits theorem as saying that under the assumptions of the theorem, the natural homomorphism Aut(G→Speck)→Autabstract(G(k)) is an isomorphism. The rest of the paper is concerned with the study of Aut(G→Speck).
Given a k-group scheme G (in this paper the letter k is exclusively used to designate a field), we have a homomorphism Aut(G→Speck)→Aut(k):fφ↦φ−1. Let AutG(k) denotes the image of this homomorphism, and let AutG denotes the group of k-algebraic automorphisms of G, or in other words the kernel of Aut(G→Speck)→Aut(k). In summary, we defined the exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1.
It seems that not much is known about the subgroup AutG(k)≤Aut(k) in general (in [Di71]*p. 18, last paragraph, J. Dieudonné makes a related comment, though not exactly about AutG(k)). Actually, for G=SLn(D) with D a non-commutative finite dimensional central division algebra, AutG(k) is isomorphic to the group of outer automorphisms of D (or to a degree 2 extension of this group). But computing the latter is probably hard (for example, in [Ha05] T. Hanke computes explicitly an outer automorphism of a division algebra of degree 3 over a number field, and then uses it to construct a non-crossed product division algebra over Q((t))).
Nonetheless, in some special cases, AutG(k) is easily understood. For example, when G is a split connected reductive group, then AutG(k)=Aut(k) (this follows directly from the fact that split connected reductive groups are defined over the prime field of k). The next easiest case should be to compute AutG(k) for quasi-split groups, and this is indeed feasible.
Theorem 1.1**.**
Let G be a connected reductive k-group and let R(G) be its k-scheme of based root datum. There exists a homomorphism Aut(G→Speck)→Aut(R(G)→Speck) preserving the underlying automorphism of k and whose kernel is (AdG)(k). Hence AutG(k)≤AutR(G)(k). If G is quasi-split, the corresponding exact sequence 1→(AdG)(k)→Aut(G→Speck)→Aut(R(G)→Speck) splits. Hence if G is quasi-split AutG(k)=AutR(G)(k).
The k-scheme of based root datum R(G) appearing in this result is an object (see Definition 3.4) which can be described as a variation on the scheme of Dynkin diagram as defined in [Gil-Pol11]*Exposé 24, Section 3. In the end, the construction of the k-scheme of based root datum is a restatement of [Gil-Pol11]*Exposé 24, Théorème 3.11. Let us directly give a brief description of what R(G) is in concrete terms: for G0 a split connected reductive k-group, R(G0) is defined to be the constant object on Speck associated to the based root datum R=(M,M∗,R,R∗,Δ) of G0. Now given a ks/k-form G of G0, one can choose a cocycle c:Gal(ks/k)→Aut((G0)ks) defining G and compose it with the projection Aut((G0)ks)→AutR to obtain a twist of R(G0) which we define to be the k-scheme of based root datum of G. In light of this description, it is clear that R(G)≅R(G′) (in the category of based root datum over k) if and only if G and G′ are inner forms of each other.
The proof of Theorem 1.1 consists mainly of a straightforward adaptation of [Gil-Pol11]*Exposé 24, Théorème 3.11 to the semilinear situation. One crucial step is to show that taking the scheme of based root datum of G commutes with base change (see Lemma 3.15). We chose to prove this in concrete terms, by using cocycle computations adapted to the semilinear situation. Those cocycle computations also lead to the following Galois cohomological formulation.
Theorem 1.2**.**
Let G be a connected reductive k-group and let R(G) be its k-scheme of based root datum. We have two exact sequences
[TABLE]
We refer the reader to Section 4 for the definition of the coboundary maps involved in those exact sequences. After proving Theorem 1.2, we illustrate how it can be used by computing AutG(k) when G≅SL1(D) and D is a division algebra of degree 3 over k. In doing so, we recover some of the results in [Ha07] without needing to introduce bycyclic algebras (see Lemma 4.17, Lemma 4.18 and Remark 4.19).
Once we have some control over AutG(k), it is natural to wonder whether the exact sequence 1→AutG→Aut(G→\nolinebreakSpeck)→AutG(k)→1 splits. Again, for G a split connected reductive algebraic group, this exact sequence does split (a statement already made in [Tits74]*Corollary 5.10) because such a group is defined over its prime field. But somewhat surprisingly, this is not any more the case for a general quasi-split group.
Theorem 1.3** (The bowtie theorem).**
Let G be a connected reductive k-group which is quasi-split, and let R(G) be its k-scheme of based root datum. Then the short exact sequence
[TABLE]
splits if and only if the short exact sequence
[TABLE]
splits.
As it turns out, the bowtie theorem (whose name is due to the diagram appearing in its proof) is a direct corollary of Theorem 1.1 (see the end of Section 3 for the proof).
When G is absolutely simple, we can identify the short exact sequence 1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1 as a sequence involving various automorphism groups of fields naturally associated with G (see Proposition 5.10). Using this description, we can then give many explicit examples of absolutely simple, quasi-split algebraic k-groups G for which Aut(G→Speck) is not a split extension of AutG(k). The corollary given at the beginning of this introduction illustrates this in the most concrete way.
In the last section of the paper, we also explore the same questions when G is an inner form of SLn over a local field K (see the beginning of Section 6 for a precise definition of what we mean by a local field). The first step is to get some control over AutG(K). Actually, a direct corollary of the results of T. Hanke in [Ha07] is that in this case, AutG(K)=Aut(K).
Theorem 1.4** (corollary of [Ha07]).**
Let K be a local field, let D be a central division algebra over K of degree d, and consider the algebraic group G=SLn(D). Then AutG(K)=Aut(K).
In [Ha07], T. Hanke does not mention local fields, but he gives an algorithm over an arbitrary field to compute outer automorphisms of cyclic division algebras, and this implies the result for local fields. In fact, we only need to use the simplest version of his algorithm and for the ease of the reader we give a self contained proof of Theorem 1.4 in Corollary 6.10. Also note that in characteristic [math], this result has probably been known for a long time since it is a direct consequence of [EML48]*Corollary 7.3.
Finally, we obtain an explicit characterisation for the splitting of the exact sequence 1→AutG→Aut(G→SpecK)→AutG(K)→1 for G an inner form of SLn over a local field.
Theorem 1.5**.**
Let K be a local field, let D be a central division algebra over K of degree d, and consider the algebraic K-group G=SLn(D). The short exact sequence 1→AutG→Aut(G→SpecK)→AutG(K)→1 splits if and only if gcd(nd,[K:K′]) divides n for all subfields K′≤K such that K/K′ is finite Galois.
As we prove in Proposition 6.38, for K=Fpi((T)), the condition “gcd(nd,[K:K′]) divides n for all subfields K′≤K such that K/K′ is finite Galois” is equivalent to requiring that gcd(d,p)=1 and that gcd(nd,i(pi−1)) divides n, so that this criterion is very explicit in characteristic p. On the other hand, in characteristic [math] note that Qp is rigid (see Definition 5.11 and Lemma 5.13), so that the condition is a finite one. See also Remark 6.17 for a vivid illustration of Theorem 1.5 in characteristic [math].
The necessity of the condition is proved in Corollary 6.15. The hard part of Theorem 1.5 is to show that our explicit criterion is sufficient. Whilst in characteristic [math] this follows from Galois descent (see Theorem 6.16), no descent technique can be used in characteristic p>0 since SLn(D) is not defined over the fixed field of Aut(K) (which is just Fp) when D is non commutative. Hence we have to work by hand and give the splitting explicitly. In order to achieve this, for K=Fpi((T)), we decompose Aut(K) as (J(K)⋊Fpi×)⋊Gal(K/Fp((T))) (see Definition 6.19 for the definition of J(K)). Fortunately, it is easy enough to find an explicit section of Aut(G→SpecK)→AutG(K) for the J(K) components, and the theory of Galois descent predicts when a section to Aut(G→SpecK)→AutG(K) exists for the component Fpi×⋊Gal(K/Fp((T))). It thus suffices to compute explicitly those sections predicted by Galois descent, and to check that the formulas we found on each component can be glued together.
Acknowledgements
This paper grew out from the idea that the scheme of Dynkin diagrams provides an obstruction for a semisimple algebraic group to be defined over a given field. This idea was given in a comment to my MathOverflow question [St15] by user grghxy (probably a close relative to nfdc23), and I gratefully thank him.
Jean-Pierre Tignol suggested at an early stage of this project that it should be possible to give an explicit example in some specific cases, which gave an early form of Corollary 5.14. He also pointed out many innacuracies and made various comments that were very helpful. In particular, he mentioned to us the work of T. Hanke and the fact that outer automorphisms of division algebras are related to H3(k,Gm), as explained in [EML48]. He also provided a much cleaner version and proof of Lemma 6.6. I thank him for the very interesting discussions we had on this subject.
A preliminary version of this paper was focusing entirely on the case of local fields. I thank Richard Weiss for pointing out that one could consider just as easily the general case.
I am also grateful to Philippe Gille, who kindly indicated that an earlier version of this paper was reproving a special case of [Gil-Pol11]*Exposé 24, Théorème 3.11. This pointer to the literature was very useful, since in the end this result is the central one around which our paper is organised.
Finally, I warmly thank Pierre-Emmanuel Caprace for asking the question that got this paper started, for encouraging me to investigate the SLn(D) case and for his patient teaching on mathematical exposition.
The research concerning this project was done in part whilst the author was a F.R.S.-FNRS research fellow (in between 2013 and 2017), and then a postdoctoral fellow at the Max Planck Institute for Mathematics in Bonn (in between 2017 and 2018). The final version of this paper was then written whilst the author was a postdoctoral fellow at the Justus-Liebig Universität Giessen. We thank all those institutions for their support.
2 Semilinear automorphisms and Galois descent
For the rest of the paper, the letter k stands for an arbitrary field. By a k-group scheme, we mean an affine group scheme of finite type over k. A smooth k-group scheme is called an algebraic group. Given an object X in a category, we write AutX for the automorphisms of X in that category. Also given a k-scheme X, we denote by AutX its k-group functor of automorphisms (i.e. for any k-algebra R, (AutX)(R)=AutXR). With these conventions, for G a k-group scheme, AutG is the automorphism functor of G evaluated at k, i.e. AutG= (AutG)(k).
Let G be a k-group scheme. We gave in the introduction the definition of a semilinear automorphism of G. The vocabulary “semilinear automorphism” is already used in the literature (see for example [FSS98]*Section 1.2). It has the same meaning than our usage, except that in those references, the underlying automorphisms of the base field are assumed to fix a subfield k0 such that k/k0 is Galois. We do not make this assumption, and for example in Section 6, we consider the case of arbitrary automorphisms of k=Fp((T)), which is a more general situation.
In the literature, the notation SAut(Gks) is used for the group of semilinear automorphisms (see for examples [BKLR12]*Section 3.2 and also the references therein). We prefer to use the notation Aut(G→Speck) so that the ground field explicitly appears in the notation.
Remark 2.1**.**
It is tempting to define a “semilinear automorphism sheaf of k-algebras” such that Aut(G→Speck) would be its k-rational points. Unfortunately, this is not possible, because we do not know how to extend functorially automorphisms of k to automorphisms of an arbitrary k-algebra R.
Let us continue by recalling some standard vocabulary.
Definition 2.2**.**
Let φ:k→l be a field homomorphism (if l is a field containing k, we take φ to be the identity), let G,G′ be k-group schemes and let H be an l-group scheme.
The group of automorphisms of l whose restriction to φ(k) is trivial is denoted Aut(l/k).
2. 2.
We set φ∗=Specφ. We denote the base change of G along Speclφ∗Speck either by Gl or by φG. If Gl is isomorphic to H (as an l-group scheme), we say that G is an l/k-form of H (or just a form of H if the field extension is understood from the context). If there exists an l/k-form of H, we say that H is defined over k.
3. 3.
For f:G→G′ a homomorphism of k-group schemes, we denote by φf:φG→φG′ the base change of f along φ∗.
Remark 2.3**.**
Having set up our notations, let us elucidate the difference between our conventions and the conventions in [BT73]. Given a k-group scheme G, a k′-group scheme G′ and given an abstract homomorphism α:G(k)→G′(k′), A. Borel and J. Tits aim to obtain a field homomorphism φ:k→k′ and an isogeny β:φG→G′ such that for g∈G(k)=Homk-schemes(Speck,G), α(g)=β∘φg. The following commutative diagram summarises the situation:
On the other hand, the present paper focuses entirely on the group of semilinear automorphisms of G. To keep the Borel–Tits convention, one should define this group as {Isomk-grp schemes(\leavevmodeφG,G)\leavevmode∣\leavevmode\linebreakφ∈Aut(k)}. We prefer to use the more natural definition that a semilinear automorphism over φ∈Aut(k) is a commutative diagram of the following kind (note that either one of the red arrows determines the other):
[TABLE]
where fφ and Specφ are both automorphisms of group schemes (but they are not automorphisms of k-group schemes when φ is not the identity). In this setting, there are two ways (admittedly not as natural as in the Borel–Tits setting) to obtain an abstract automorphism of G(k). Either we define this abstract automorphism proceeding “from right to left”, in which case we would obtain the map G(k)→G(k):g↦fφ−1∘g∘Specφ. Or we proceed “from left to right”, in which case we obtain the map G(k)→G(k):g↦fφ∘g∘(Specφ)−1. We chose the latter option.
The following elementary observation plays a fundamental role in this work.
Lemma 2.4**.**
Let k≤l be a field extension of k, let G be an l-group scheme and assume that G is defined over k. Then there exists a homomorphism Aut(l/k)→Aut(G→Specl) whose composition with Aut(G→Specl)→AutG(l) is the identity on Aut(l/k). In particular, AutG(l) contains Aut(l/k).
Proof.
Let H be an l/k-form of G. For φ∈Aut(l/k), we define
[TABLE]
The map Aut(l/k)→Aut(G→Specl):φ↦fφ−1 is a homomorphism. Furthermore, its composition with Aut(G→Specl)→AutG(l) is the identity on Aut(l/k), as wanted.
∎
In fact, if the field extension l/k appearing in Lemma 2.4 is finite Galois, then we have a converse to Lemma 2.4 by the theory of Galois descent.
Theorem 2.5** (Galois descent).**
Let k≤l be a field extension of k such that l/k is a finite Galois extension and let G be an l-group scheme. If there exists a homomorphism Gal(l/k)→Aut(G→Specl) whose composition with Aut(G→\nolinebreakSpecl)→AutG(l) is the identity on Gal(l/k), then G is defined over k.
Proof.
This is a classical result from descent theory, see [Poo17]*Section 4.4. Note that giving such a homomorphism is the same as giving a descent datum on G by [Poo17]*Proposition 4.4.2, so that the result holds by [Poo17]*Corollary 4.4.6.
∎
Remark 2.6**.**
One could also treat the case of infinite Galois extensions by adding a continuity assumption as in [FSS98]*Remark 1.15, but we do not need it in our work. See also [Poo17]*Remark 4.4.8 for how to deal with infinite Galois extensions.
In view of the strong link between Galois descent and semilinear automorphisms, it seems natural that there should be a cocycle interpretation of semilinear automorphisms. We now take some time to set up this formalism in detail.
Definition 2.7**.**
Let k≤l be a field extension of k, let G0 be an l-group scheme and let G be an l/k-form of G0. Choose an isomorphism G0≅Gl, or in other words choose an exact diagram
For any γ∈Aut(l/k), by the definition of base change there exists a unique isomorphism of G0 above γ such that the following diagram commutes:
[TABLE]
We denote this isomorphism γ~G.
2. 2.
For G0 a split connected reductive l-group we assume that an isomorphism with Hl has been chosen, where H is a split algebraic group over the prime field of l. Now in this special situation, for γ∈Aut(l), instead of
γ~H
we use the more suggestive notation Idγ.
Remark 2.8**.**
(i)
Note that when l/k is a finite Galois extension, the collection \{$$\tilde{\gamma}_{G}}γ∈Gal(l/k) is nothing but a descent datum on G0 (as defined in [Poo17]*Proposition 4.4.2 (i)) which descends to G.
2. (ii)
Note that for G0 a split connected reductive l-group and γ∈Aut(l), if we choose a realisation of G0 as a matrix group such that the realisation is defined over the prime field of l, then for g=(gij)∈G0(l) and γ∈Aut(l), Idγ∘g∘(γ∗)−1∈G0(l) is given by the matrix whose ij-th coefficient is γ−1(gij). This explains why we prefer to use the notation Idγ in this situation.
We now study the behaviour of γ~G under base change.
Lemma 2.9**.**
Let k≤l be a field extension of k, let G0 be an l-group scheme and let G be a l/k-form of G0. Fix an isomorphism Gl≅G0, or in other words fix an exact diagram
Let α∈Aut(k) and let β∈Aut(l) be such that β∣k=α. Further assume that G0 is split connected reductive. Then there exists a unique map πβ:G0→G such that the following diagram commutes
[TABLE]
Furthermore, all squares appearing in this diagram are exact.
Proof.
The existence and uniqueness of πβ follows from the fact that the front square of the diagram is a base change. The fact that all squares are exact is a straightforward verification, using the fact that α∗ and β∗ are isomorphisms.
∎
Lemma 2.10**.**
Keep the notations of Lemma 2.9, so that in particular we chose an isomorphism G0≅(αG)l via the exact diagram
With these identifications of base change, for all γ∈Aut(l/k) we have γ~αG=Idβ−1(β−1γβ)GIdβ.
Proof.
The proof follows from the commutativity of the following diagram
[TABLE]
Indeed, γ~αG is defined to be the unique map such that the left hand side of the diagram commutes. But the front side and the back side of the diagram commutes by the definition of πβ (see Lemma 2.9), whilst the right hand side of the diagram commutes by definition of (β−1γβ)G. Also note that (β−1γβ)∗=β∗γ∗(β−1)∗, so that the bottom square of the diagram commutes as well. A diagram chase then shows that Idβ−1(β−1γβ)GIdβ satisfies the property uniquely defining γ~αG, as was to be shown.
∎
We can now state a clean descent formula for semilinear automorphisms in terms of cocycles. In this formula, we use the fact that for G0 a split connected reductive l-group, Aut(G0→Specl)≅AutG0⋊Aut(l), where the splitting of the exact sequence 1→AutG0→Aut(G0→Specl)→Aut(l) is realised by γ↦Idγ−1 (see Definition 2.7 for the notation Idγ). This thus defines a (left) action of Aut(l) on AutG0 that we denote γf (for γ∈Aut(l) and f∈AutG0). Explicitly, we have γf=Idγ−1fIdγ.
Lemma 2.11**.**
Let G0 be a split connected reductive l-group, let k be a subfield of l such that l/k is a (possibly infinite) Galois extension, and let G be a l/k-form of G0. Let β∈Aut(l) be such that β(k)=k, and let α=β∣k∈Aut(k). Fix an isomorphism Gl≅G0 and let c:Gal(l/k)→AutG0 be the corresponding cocycle. Finally, let b∈AutG0. Then bIdβ∈Aut(G0→Specl) descends to a semilinear automorphism of G over α if and only if cβ−1γββ−1γβbβ−1cγ−1=b for all γ∈Gal(l/k).
Proof.
Recall that a morphism of G0 over β is equivalent to an l-morphism from G0 to βG0. In this correspondence, bIdβ corresponds to βb∈AutG0, as can be seen directly from the diagram
[TABLE]
Now by the general theory for morphisms between schemes with a descent datum, the l-morphism βb:G0→βG0 descends to a k-morphism G→αG if and only if (γ~αG)−1(βb)γ~G=βb for all γ∈Gal(l/k) (technically speaking, this is only true for finite Galois extensions, but our schemes are of finite type. Hence βb is defined over a finite Galois extension of k and we are just trying to descend from there). Using Lemma 2.10, we get that βb descends if and only Idβ−1(β−1γ−1β)GIdβ(βb)γ~G=βb. Finally, to transfer this to a cocycle condition, recall that in the correspondence between descent datum and cocycle, we have (in our notations) γ~G=cγ−1Idγ (this of course relies on the fact that we used the same isomorphism G0≅Gl to define cγ and γ~). Furthermore, by definition c:Gal(l/k)→AutG0 is a cocycle for the Galois action introduced before the statement of the theorem, i.e. for γ,δ∈Gal(l/k) we have cγδ=cγγcδ=cγIdγ−1cδIdγ. Hence, the conclusion of the theorem readily follows.
∎
Remark 2.12**.**
In our conventions, if γ∈Gal(l/k) appears in exponent, then it acts on the element appearing below it on the right. So if one wishes to put more parenthesis in the formula cβ−1γββ−1γβbβ−1cγ−1, the unique way to do so respecting this convention is by writing cβ−1γβ(β−1γβb)(β−1cγ−1). Note also that β∈Aut(k) acts by group automorphisms on AutG, so that β−1(cγ−1)=(β−1cγ)−1, i.e. there is no need for any parenthesis to distinguish the two.
Remark 2.13**.**
If β is the identity, our formula specialises to the usual condition for b to descend to a k-automorphism of G, namely cγγbcγ−1=b for all γ∈Gal(l/k). Also note that for γ∈Gal(l/k), the automorphism γ~G=cγ−1Idγ∈Aut(G0→Specl) satisfies the condition to descend (of course, it descends to the trivial automorphism of G).
3 Schemes of based root datum
In [Gil-Pol11]*Exposé 24, section 3, the authors define what they call a “Dynkin’s scheme” of a reductive group G. The strategy is to first define this Dynkin’s scheme for split reductive groups, and then to use descent. The Dynkin’s scheme is well suited to describe quasi-split semisimple groups that are adjoint or simply connected. Since there is not much more work to define a scheme of based root datum and since this allows us to treat the more general case of quasi-split reductive groups, we decided it was worth doing it.
In order to define a scheme of based root datum, we need the notion of a Z-module scheme and of perfect duality between two Z-module schemes. Recall that throughout the paper, the letter k stands for a field.
Definition 3.1**.**
Let R be a k-algebra and let M be a R-scheme. M is called a Z-module R-scheme if M is a (non necessarily affine) commutative R-group scheme.
Recall that given any set E and a k-algebra R, we can consider the constant object onE which is defined to be the R-scheme ER=e∈E∐SpecR. This defines a fully faithfull functor from the category of Sets to the category of R-schemes, called the constant object functor. The constant object functor commutes with forming finite products (see [Gil-Pol11a]*Exposé 1, Section 1.8). Hence given a Z-module M, the constant scheme MR acquires the structure of a Z-module R-scheme. We can now define the notion of perfect pairing for Z-module k-schemes.
Definition 3.2**.**
Let M,M′ be two Z-module k-schemes.
The dual ofM, denoted Mt, is defined to be the functor from the category of k-algebras to the category of sets sending a k-algebra R to HomR(MR,ZR).
2. 2.
We say that M and M′ are in duality if there exists f∈Homk(M×M′→Zk). We say that the duality f is perfect if for all k-algebra R, the map M′(R)→Mt(R):m↦(f(.,m):MR→ZR) is an isomorphism (here, for any R-algebra R′ and n∈MR(R′), f(.,m)(n)=f(n,mR′), with mR′ being the image of m under M′(R)→M′(R′)).
Remark 3.3**.**
As usual in this situation, one should restrict the categories under considerations to avoid set theoretic problems. One way to do so is by using universe.
Note that Mt is a commutative group functor, and hence Mt is a Z-module k-scheme if Mt is representable. Also note that given f∈Homk(M,M′) we can define ft∈Homk-functors(M′t,Mt) by mimicking the definition for Z-modules. Namely for all k-algebras R, ft(R):M′t(R)→Mt(R):α↦α∘fR, where fR:MR→MR′ denotes the base change of f to R. We call ft the dual off.
By a reduced based root datumR, we mean a reduced root datum (M,M∗,Φ,Φ∗) (as defined in [Gil-Pol11]*Exposé 21, Définition 1.1.1 and Definition 2.1.3) together with a choice of simple roots Δ⊂Φ. We can finally give the definition of a k-scheme of root datum.
Definition 3.4**.**
A k-scheme of based root datum is a 5-tuple R=(M,M∗,Ψ,Ψ∗,Γ) where:
(a)
M and M∗ are Z-module k-schemes in perfect duality.
2. (b)
Ψ,Ψ∗ and Γ are finite k-schemes, and there are closed immersions Γ↪Ψ↪M and Ψ∗↪M∗.
3. (c)
There is an isomorphism of k-schemes Ψ≅Ψ∗.
4. (d)
There exists a reduced based root datum R=(M,M∗,Φ,Φ∗,Δ) and a finite Galois extension l/k together with an isomorphism of Z-module l-schemes f:Ml→Ml such that f induces an isomorphism of l-schemes Φl≅Ψl, ft induces an isomorphism of l-schemes Ψl∗≅Φl∗, f(Δl)=Γl and the composition Φl≅Ψl≅Ψl∗≅Φl∗ induces the bijection Φ→Φ∗:α↦α∗ given in the definition of R. In this case, we say that R is of typeR.
2. 2.
Let R=(M,M∗,Φ,Φ∗,Δ) be a reduced based root datum. Using the constant object functor, the 5-tuple Rk=(Mk,Mk∗,Φk,Φk∗,Δk) has a natural structure of a k-scheme of based root datum. We call it the splitk-scheme of based root datum of typeR. A splitk-scheme of based root datum is a split k-scheme of based root datum of type R for some reduced based root datum R.
3. 3.
Given R=(M,M∗,Ψ,Ψ∗,Γ) and R′=(M′,M′∗,Ψ′,Ψ′∗,Γ′) two k-schemes of based root datum, a k-morphism R→R′ is a k-homomorphism f:M→M′ such that f induces two k-isomorphisms Ψ≅Ψ′ and Γ≅Γ′, and such that ft induces a k-isomorphism Ψ′∗≅Ψ∗.
Remark 3.5**.**
Let us stress that with this definition, if a scheme of based root datum is of type R, then R is a reduced based root datum. It would be safer (but more tedious) to call these objects “k-schemes of reduced based root datum”.
Remark 3.6**.**
Let ks be a separable closure of k, let Rk=(Mk,Mk∗,Φk,Φk∗,Δk) be a split k-scheme of based root datum of type R and let E=AutR (see [Gil-Pol11]*Exposé 21, Définition 6.1.1 for the definition of the morphisms in the category of based root datum). Then AutRks=E, and the action of Gal(ks/k) on E is trivial. Hence elements of H1(k,E) are continuous homomorphisms Gal(ks/k)→E up to conjugation. Also recall that H1(k,E) classifies k-schemes of based root datum of type R. Indeed, Galois descent for Mk and Mk∗ is effective because they can be covered by quasi-affine open that are stable under Gal(ks/k) (hence effectivenes is ensured by [Poo17]*Theorem 4.3.5), and the other structures (the duality Mk×Mk∗→Zk, the closed immersions Δk↪Φk↪Mk, Φk∗↪Mk∗ and the k-isomorphism Φk≅Φk∗) will descend as well.
Remark 3.7**.**
If R=(M,M∗,Φ,Φ∗,Δ) is a based root datum such that Φ is empty, then AutR≅GLn(Z) where n is the rank of M. Hence in this case, k-schemes of based root datum of type R classify k-tori of rank n.
Note that given α∈Aut(k) and a k-scheme of based root datum R, we have an obvious notion of base change of R along α, and we denote this base change by αR.
Definition 3.8**.**
Let R be a k-scheme of based root datum, and let α∈Aut(k). A semilinear automorphism ofR** over** α is an isomorphism of k-schemes of based root datum fα:R→αR. Given a semilinear automorphism fα (respectively fβ′) over α (respectively β) in Aut(k), their composition is (αfβ′)fα, which is a semilinear automorphism over αβ. We denote the group of semilinear automorphisms of R by Aut(R→Speck).
As in the case of k-group schemes, for R a k-scheme of based root datum, we have a homomorphism Aut(R→Speck)→Aut(k):fα↦α−1. We let AutR(k) be the image of this homomorphism. Furthermore denoting the k-automorphisms of the based root datum R by AutR (or also (AutR)(k), following the conventions discussed at the start of Section 2), we get a short exact sequence 1→AutR→Aut(R→Speck)→AutR(k)→1.
We now discuss how to associate functorially a k-scheme of based root datum to a connected reductive k-group. One possible approach would be to take an inductive limit of based root datum in the split case, and then descend this canonical object to any form. This would lead to the same construction as the one we now explain.
Actually, it suffices to incorporate our definition of the k-scheme of based root datum in [Gil-Pol11]*Exposé 24, Théorème 3.11, by replacing principal Galois cover of group E=AutR with the objects over k that they classify (i.e. k-schemes of based root datum). As a corollary, we will get the definition of the k-scheme of based root datum of a connected reductive k-group. First, we recall the definition of the group scheme of exterior isomorphisms.
Let G,G′ be two connected reductive k-group of type R, for some reduced based root datum R. Then AdG acts freely (on the right) on the k-group functor Isomk-gr.(G,G′). We define the k-group functor of exterior isomorphisms betweenGand G′ to be the quotient sheaf Extisom(G,G′)=Isomk-gr.(G,G′)/AdG.
Remark 3.10**.**
Actually, [Gil-Pol11]*Exposé 24, Corollaire 1.10 asserts that this quotient is representable. Since it will be useful later, here is an explicit description of Extisom(G,G′) using cocycles: let ks be a separable closure of k, let E=AutR, let G0 be the (split) connected reductive ks-group of type R and identify Aut\leavevmodeG0 with AdG0⋊Eks (after a choice of pinning for G0, see [Gil-Pol11]*Exposé 24, Théorème 1.3). Fix an isomorphism G0≅Gks (respectively G0≅Gks′), denote by c (respectively c′) the corresponding cocycle Gal(ks/k)→AutG0 and let c~ (respectively c~′) be the composition of this cocycle with AutG0→E. Further assume that the pinning of G0 is defined over k, so that the Galois action on AutRks=E is trivial. Then Extisom(G,G′) is a ks/k-form of Eks given by the Galois action γ.f=c~γ′fc~γ−1 (for all f∈Eks and for all γ∈Gal(ks/k)). This follows directly from the Galois condition for an automorphism of G0 to descend to an isomorphism G→G′, together with the fact that we are moding out by adjoint automorphisms.
Let us also recall the notion of a quasi-pinning.
Definition 3.11**.**
Let G be a connected reductive k-group. If it exists, a quasi-pinning of G is:
A choice of a Borel subgroup B containing a maximal torus T of G. Once this is chosen, let ks be a separable closure of k, let Δ be the fundamental roots of Gks corresponding to the pair (Tks,Bks) and for α∈Δ, let gα be the corresponding one dimensional subspace of Lie(Gks).
2. 2.
A choice of a nontrivial element Xα∈gα for all α∈Δ such that for all γ∈Gal(ks/k), γ.Xα=Xγ(α).
If G has a quasi-pinning, we say that G is quasi-split.
The more classical definition for a connected reductive k-group to be quasi-split is that it possesses a Borel subgroup. It is well-known that this definition agrees with Definition 3.11 (and the equivalence is proved in a more general setting in [Gil-Pol11]*Exposé 24, Proposition 3.9.1). For the convenience of the reader, let us reprove this fact.
Lemma 3.12**.**
Let G be a connected reductive k-group. If G has a borel subgroup, then G has a quasi-pinning.
Proof.
Let B be a borel subgroup of G. Then it contains a maximal torus T of G (see for example [Gil-Pol11]*Exposé 22, Corollaire 5.9.7). Let ks,Δ,α∈Δ and gα be as in Definition 3.11 for the pair (T,B). Let H≤Gal(ks/k) be the stabiliser of α, and let kα be the subfield of ks fixed by H. Then there exists an H-equivariant isomorphism kα⊗kαks≅gα (this holds because all ks/kα-forms of the vector space ks are equivalent by Hilbert’s 90). Set Xα=1∈kα⊂gα. Now, for β in the Gal(ks/k)-orbit of α, we set Xβ=γ.Xα where γ∈Gal(ks/k) is any element such that γ(α)=β. The point is that Xβ does not depend on a choice of γ∈Gal(ks/k) such that γ(α)=β because H acts trivially on Xα. Doing so for each orbit of Gal(ks/k) on Δ concludes the proof.
∎
Let R=(M,M∗,Φ,Φ∗,Δ) be a reduced based root datum. Consider the following categories:
The category BRD of k-schemes of based root datum of type R. The morphisms are the isomorphisms of k-schemes of based root datum.
2. 2.
The category RedExt of connected reductive k-groups of type R. The morphisms between G and G′ are elements of the group Extisom(G,G′)(k).
3. 3.
The category QsPin of connected reductive quasi-split k-groups of type R, together with a choice of quasi-pinning. The morphisms are the isomorphisms preserving the quasi-pinning.
These three categories are equivalent. More precisely, we have a diagram of functors between categories
[TABLE]
such that the composition of those three functors (starting with anyone of them) is naturally isomorphic to the identity.
Proof.
We follow the proof given in [Gil-Pol11]*Exposé 24, Section 3.11, with the advantage that we can work with the more concrete Galois descent, and that the notion of pinning is simpler over fields.
Set E=AutR. Let ks be a separable closure of k and let G0 be the (split) connected reductive ks-group of type R. For the proof, we choose a pinning for G0 which is defined over k, i.e. we choose a pinning for the split connected reductive k-group of type R and we base change it to a pinning of G0. In particular we choose a torus T0 contained in a Borel subgroup B0 (both defined over k), and we get an identification Aut\leavevmodeG0≅AdG0⋊Eks (where the Gal(ks/k)-action on Eks is trivial), and in particular an embedding E=Eks(ks)→(Aut\leavevmodeG0)(ks)=AutG0.
The functor ι. On objects, ι(G) is the natural inclusion whilst for f∈MorQsPin(G,G′), ι(f) is the projection of f in Extisom(G,G′)(k)=(Isomk-gr.(G,G′)/AdG)(k).
2. 2.
The functor qspin. Let R be a k-scheme of based root datum of type R. Choose an isomorphism Rl≅Rl for some finite Galois extension l/k and let c:Gal(ks/k)→E be the corresponding cocycle. The quasi-split group qspin(R) is the ks/k-form of G0 defined by the cocycle c:Gal(ks/k)→E→AutG0. Note that this cocycle preserves T0 and B0, so that qspin(R) is indeed quasi-split. We choose for quasi-pinning on qspin(R) the pair (T0,B0) descended to k, and for α∈Δ, we choose the element Xα∈Lie(G0) to be the same as the one appearing in the pinning of G0. Since the pinning of G0 is defined over k by assumption, this indeed constitutes a quasi-pinning of qspin(R). Finally, for a morphism f∈MorBRD(R,R′), qspin(f) is defined to be the descent of fks∈Mor(Rks,Rks′)≅E≤AutG0 to an isomorphism qspin(R)→qspin(R′).
3. 3.
The functor brd. For G a connected reductive group of type R, choose an isomorphism G0≅Gks and let c:Gal(ks/k)→AutG0 be the corresponding cocycle. Consider c~, the composition of c with the projection AutG0→E. Now brd(G) is defined to be the ks/k-form of the split ks-scheme of root datum Rks obtained by Galois descend using the cocycle c~. Whilst for a morphism f∈MorRedExt(G,G′), fks∈Extisom(Gks,Gks′)(ks)≅AutRks, and brd(f) is defined to be the descent of fks to an isomorphism brd(G)→brd(G′).
We now check that the composition of those three functors (starting with anyone of them) is naturally isomorphic to the identity.
brd∘i∘qspin ≅IdBRD. Let c′:Gal(ks/k)→E be the cocycle arising from a choice of Rl≅Rl. By definition of qspin, a choice of isomorphism G0≅qspin(R)ks gives rise to a cocycle c which is cohomologous to c′ (as cocycles with values in AutG0), hence the c~ appearing in the definition of brd is cohomologous to c′ as well (as cocycles with values in E).
2. 2.
qspin ∘ brd∘i≅IdQsPin. We need to check that given a quasi-split group G together with a choice of isomorphism G0≅Gks and corresponding cocycle c:Gal(ks/k)→AutG0, then c is cohomologous to c composed with AutG0→E→AutG0. The quasi-pinning on G gives a pinning of Gks, which is sent by G0≅Gks to a pinning of G0. Up to conjugation by g∈G0(ks), which has the effect of replacing c by a cohomologous cocycle, we can assume that this pinning of G0 is the one we chose from the outset. Because the pinning of G0 is defined over k, it is invariant under the action of Gal(ks/k). Hence, the cocycle c has values in E, as wanted.
3. 3.
i∘ qspin ∘ brd ≅IdRedExt. Let G be a connected reductive group of type R. We want to check that Extisom(G,G′)(k)=∅, where G′=(i∘ qspin ∘ brd)(G). Let G0≅Gks be the chosen isomorphism to define brd(G), with corresponding cocycle c, and let c~ be the projection of c under AutG0→E. By definition, a cocycle defining G′ is cohomologous to c~, so we can assume that G′ is defined by c~. Now, by Remark 3.10, the identity on G0 descends to an element of Extisom(G,G′)(k), concluding the proof. ∎
In view of Theorem 3.13, one can attach in a functorial way a k-scheme of based root datum to any connected reductive k-group.
Definition 3.14**.**
Let G be a connected reductive k-group. The k-scheme of based root datum associated toG is brd(G), where brd is the functor appearing in Theorem 3.13. We denote it R(G).
The crucial input is that taking the scheme of based root datum commutes with base change.
Lemma 3.15**.**
Let G be a connected reductive k-group and let α be an automorphism of k. Then R(αG)≅αR(G), naturally in G.
Proof.
Let R be the type of G, let ks be a separable closure of k, and let G0 be the (split) connected ks-group of type R. Let β be an extension of α to ks, choose an isomorphism G0≅Gks, and let G0≅(αG)ks be the corresponding isomorphism defined in Lemma 2.9. Now by Lemma 2.10, if c denotes the cocycle defining G, then the corresponding cocycle αc defining αG is given by (αc)γ=Idβ−1cβ−1γβIdβ, for all γ∈Gal(ks/k). Finally, we choose a pinning of G0 defined over the prime field of k (so that we can identify AutG0≅(AdG0)(ks)⋊AutR), and we let c~ (respectively αc~) be the projection of c (respectively αc) under AutG0→AutR. Note that since the Galois action on AutR is trivial, (αc~)γ is just the projection of cβ−1γβ onto AutR.
On the other side, let Rks be the split k-scheme of based root datum of type R. The (choice of) cocycle defining R(G) is c~:Gal(ks/k)→AutR. Now exactly the same computation as for algebraic groups (i.e. repeating Lemma 2.9 and Lemma 2.10 in the category of schemes of based root datum) shows that a cocycle defining αR(G) is given by γ↦Idβ−1c~β−1γβIdβ=c~β−1γβ. But this a also the chosen cocycle defining R(αG), as was to be shown. The naturality in G of this isomorphism is straightforward.
∎
Remark 3.16**.**
Of course, for this whole section, we did not need the fact that the base scheme is the spectrum of a field, and for example, Lemma 3.15 should be true over any base scheme, and under any base change. The advantage of working over a field is that the notion of pinning is simpler, and that Galois descent is more concrete than fppf descent.
The proof of Theorem 1.1 now follows easily from Theorem 3.13 and Lemma 3.15.
Recall that to give an automorphism fα of G over α∈Aut(k) is equivalent to give an isomorphism of k-group schemes f:G→αG. Hence, projecting f to an element fˉ∈Extisom(G,αG)(k) and using the functor brd defined in Theorem 3.13, we get an isomorphism brd(fˉ):R(G)→R(αG)≅αR(G) (where we used Lemma 3.15 for the last isomorphism). Now since brd is a functor, and because the isomorphism R(αG)≅αR(G) is natural in G, the map fα↦brd(fˉ) is a group homomorphism which is natural in G. Furthermore, the underlying automorphism of the field is preserved by this homomorphism. To conclude the first part of the proof, note that fα is in the kernel of this homomorphism if and only if α is trivial and fˉ is trivial in Extisom(G,G)(k), which is to say that f∈(AdG)(k).
For the last assertion, assume that G is quasi-split and choose a quasi-pinning of it. Define the subgroup H={fα∈Aut(G→Speck)\leavevmode∣\leavevmodefα preserves the quasi-pinning of G}. Seeing fα as an isomorphism f from G to αG, the condition for f to belong to H is that it preserves the quasi-pinnings (where αG is endowed with the quasi-pinning on G based changed to αG). Now the fact that H maps isomorphically onto Aut(R(G)→Speck) under Aut(G→Speck)→Aut(R(G)→Speck) is a direct consequence of Lemma 3.15 and of the equivalence of categories BRD and QsPin in Theorem 3.13.
∎
Remark 3.17**.**
For G a connected reductive k-group which is not quasi-split, the decomposition AutG≅(AdG)(k)⋊OutG as a semidirect product is usually destroyed. Similarly, one should not expect to obtain a semidirect decomposition of Aut(G→Speck) for a general connected reductive k-group. Investigating a possible semidirect decomposition of the group of semilinear automorphisms of simple algebraic groups is an entirely different matter when G is not quasi-split, as is illustrated by our treatment of the SLn(D) case in Section 6.
As a corollary of Theorem 1.1, we obtain a proof of Theorem 1.3.
where all diagonal lines and vertical lines are exact. Here, π denotes the homomorphism provided by Theorem 1.1, and ι is a section of π (which exists, again by Theorem 1.1). Note that in particular, ι preserves the underlying field automorphism, i.e. p1∘ι=p2.
We thus conclude that the short exact sequence 1→AutG→Aut(G→\nolinebreakSpeck)→AutG(k)→1 splits if and only if the short exact sequence involving k-schemes of based root datum 1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1 does, as was to be shown.
∎
4 Semilinear automorphisms and Galois cohomology
We have just proved that for any connected reductive algebraic k-group G, we have a natural exact sequence 1→(AdG)(k)→Aut(G→Speck)→Aut(R(G)→Speck). It would be nice to be able to express the failure of surjectivity on the right using Galois cohomology. We explain in this section how to do so.
In this section, ks denotes a separable closure of k with Galois group Γ=Gal(ks/k), R is a reduced based root datum, G0 is a (split) connected reductive ks-group of type R with a choice of pinning defined over the base field of k, and Rks is the split ks-scheme of based root datum of type R. We furthermore set E=AutR and we let Eks be the corresponding constant object over ks. Also, we again use the convention that G0 comes together with a preferred split form of it over the prime field of k. In particular, we get a decomposition Aut(G0→Specks)≅AutG0⋊Aut(ks), where the splitting Aut(ks)→Aut(G0→Specks) is given by β−1↦Idβ (see Definition 2.7).
Definition 4.1**.**
Given a field extension l≥k, we set Aut(l≥k)={α∈Aut(l)\leavevmode∣\leavevmodeα(k)=k}
2. 2.
We set Aut(G0→Specks≥k)=
[TABLE]
3. 3.
We denote an element of Aut(G0→Specks≥k)≅AutG0⋊Aut(ks≥k) by bIdβ (where b∈AutG0 and β∈Aut(ks≥k)).
Remark 4.2**.**
In Definition 4.1, α is required to globally preserves k, but its restriction to k can be non-trivial. Also, we will use the fact that Aut(l/k) (see Definition 2.2) is a normal subgroup of Aut(l≥k).
Definition 4.3**.**
Let G be a connected reductive k-group of type R, choose an isomorphism G0≅Gks and let c:Γ→AutG0 be the corresponding Galois cocycle. We define the semilinear Galois action corresponding to c (we also say corresponding to G0≅Gks) on Aut(G0→Specks≥k)≅AutG0⋊Aut(ks) as follows:
[TABLE]
Remark 4.4**.**
In view of Lemma 2.11, an element of Aut(G0→Specks≥k) descends to an element of Aut(G→Speck) if and only if it is Galois invariant. This is the origin of Definition 4.3.
It is important to notice that in general, the Γ-action on Aut(G0→Specks≥k) does not preserve the group structure. Let us prove some elementary properties of this action.
Lemma 4.5**.**
Keep the notations of Definition 4.3. Let γ,γ1,γ2∈Γ and let bIdβ, b1Idβ1, b2Idβ2∈Aut(G0→Specks≥k)≅AutG0⋊Aut(ks≥k).
Keep the notations of Definition 4.3. The set of elements in Aut(G0→Specks≥k) that are fixed by the Γ action is a subgroup.
Proof.
Let b1Idβ1, b2Idβ2∈Aut(G0→Specks≥k)≅AutG0⋊Aut(ks≥k) be elements that are fixed by the Γ action. For γ∈Γ, we have \gamma.(b_{1}\operatorname{\mathrm{Id}}_{\beta_{1}}b_{2}\operatorname{\mathrm{Id}}_{\beta_{2}})=\Big{(}\beta_{2}^{-1}\gamma\beta_{2}.(b_{1}\operatorname{\mathrm{Id}}_{\beta_{1}})\Big{)}\Big{(}\gamma.(b_{2}\operatorname{\mathrm{Id}}_{\beta_{2}})\Big{)} by Lemma 4.5. Hence b1Idβ1b2Idβ2 is Γ invariant as well.
Similarly, if bIdβ is Γ invariant, for all γ∈Γ we have \operatorname{\mathrm{Id}}_{G_{0}}=\gamma.\operatorname{\mathrm{Id}}_{G_{0}}=\gamma.((b\operatorname{\mathrm{Id}}_{\beta})^{-1}b\operatorname{\mathrm{Id}}_{\beta})=\Big{(}\beta^{-1}\gamma\beta.((b\operatorname{\mathrm{Id}}_{\beta})^{-1})\Big{)}\Big{(}\gamma.(b\operatorname{\mathrm{Id}}_{\beta})\Big{)}. Hence, since bIdβ is Γ invariant, we get β−1γβ.((bIdβ)−1)=(bIdβ)−1 for all γ∈Γ, and hence (bIdβ)−1 is Γ invariant as well.
∎
Definition 4.7**.**
In the notations of Definition 4.3, the subgroup of elements of Aut(G0→Specks≥k) that are fixed by Γ is denoted Aut(G0→Specks≥k)Γ.
We now aim to state that the group Aut(G→Speck) is the group Aut(G0→Specks≥k)Γ modulo the Galois group. So we need to embed the Galois group as a normal subgroup of Aut(G0→Specks≥k)Γ.
Definition 4.8**.**
Consider the homomorphism Γ→Aut(G0→Specks≥k)Γ:γ↦cγIdγ−1. We denote the image of Γ by Γ~.
Remark 4.9**.**
Note that for γ∈Γ, cγIdγ−1 is an invariant element of Aut(G0→Specks≥k). Indeed, for δ∈Γ we have δ.(cγIdγ−1)=cγδγ−1γδγ−1cγγcδ−1Idγ−1=cγδγδcδ−1Idγ−1=cγIdγ−1.
Remark 4.10**.**
If we denote γ~=cγIdγ−1, it is unfortunate that γ~ is the inverse of the element γ~G=cγ−1Idγ appearing in Definition 2.7. In the language of descent datum, γ↦γ~G is traditionally required to be an anti-homomorphism, whereas it felt more natural to use a homomorphism in Definition 4.8, so we indulge in this inconsistency.
Lemma 4.11**.**
Keeping the notations of Definition 4.3, Aut(G→Speck) is naturally isomorphic to Aut(G0→Specks≥k)Γ/Γ~.
Proof.
We have a homomorphism Aut(G0→Specks≥k)Γ→Aut(G→Speck), which maps an invariant element of Aut(G0→Specks≥k) to its descent in Aut(G→Speck) (see Lemma 2.11). Note that Γ~ is in the kernel of this map (since cγ−1Idγ=γ~G arises as a choice of base change for the identity). Now if bIdβ is in the kernel of this homomorphism, then β acts trivially on k, i.e. β=γ for some γ∈Γ, and bIdβcγIdγ−1∈AutG0 descends to the identity in AutG. But this holds if and only if bIdβcγIdγ−1 is already the identity on G0. Since bIdβcγIdγ−1=bγ−1cγ=bcγ−1−1, we conclude that bIdβ descends to the identity if and only if it is equal to cγ−1Idγ for some γ∈Γ, i.e. if and only if it belongs to Γ~.
It remains to check that the homomorphism Aut(G0→Specks≥k)Γ→Aut(G→Speck) is surjective as well. But this follows from the fact that any automorphism of k can be extended to an automorphism of ks.
∎
Note that there was nothing special about the category of algebraic k-groups, and we could as well repeat this construction for other algebraic categories over k for which descent is effective. In particular, we can repeat everything we did so far for k-schemes of based root datum. Also recall that in Theorem 3.13, still keeping the notations of Definition 4.3, the cocycle defining R(G) is obtained from c by projecting via AutG0→E. Recalling that the Galois action on the split ks-scheme of based root datum is trivial, this gives the following result.
Lemma 4.12**.**
Keep the notations of Definition 4.3. Let c~ be the projection of c under AutG0→E. Define a semilinear Galois action on Aut(Rks→Specks≥k)≅E×Aut(ks≥k) as follows:
[TABLE]
Define Γ~≤Aut(Rks→Specks≥k)Γ to be the image of the
homomorphism Γ→Aut(Rks→Specks):γ↦c~γIdγ−1. Then Aut(R(G)→Speck) is naturally isomorphic to
Aut(Rks→Specks≥k)Γ/Γ~. Furthermore, the homomorphism
Aut(G0→Specks)→Aut(Rks→Specks) induces a homomorphism Aut(G0→Specks≥k)Γ/Γ~→Aut(Rks→Specks≥k)Γ/Γ~.
We can now formulate the failure of surjectivity of the map Aut(G→Speck)→AutG(k) and of the map Aut(G→Speck)→Aut(R(G)→Speck) using a variant of Galois cohomology. We first give an approximation of this.
Proposition 4.13**.**
Keep the notations of Lemma 4.12. Endow AutG0 and (AdG0)(ks) with the Galois action given by restricting the semilinear Galois action on Aut(G0→Specks≥k)(this is just the Galois action corresponding to the form G0≅Gks).
There exists a coboundary map Aut(ks≥k)∂H1(Γ,AutG0) such that the sequence
[TABLE]
is exact.
2. 2.
There exists a coboundary map Aut(Rks→Specks≥k)Γ∂H1(Γ,(AdG0)(ks)) such that the sequence
[TABLE]
is exact.
Proof.
It is important not to confuse the two Galois actions we are considering on AutG0. One arises from the fact that we chose a form of G0 over the prime field of k, and the other is the Galois action arising from G0≅Gks. For γ∈Γ and b∈AutG0, recall that the former is denoted γb=Idγ−1bIdγ whilst the latter is denoted γ.b=cγγbcγ−1.
We have a similar remark for E=AutRks: for γ∈Γ and b∈E, we denote γb=Idγ−1bIdγ=b (the latter equality holds because any automorphism of Rks is defined over k) and γ.b=c~γγbc~γ−1=c~γbc~γ−1.
Let β−1∈Aut(ks≥k). As usual in this situation, we set ∂(β−1):Γ→AutG0:γ↦∂(β−1)γ where ∂(β−1)γ is defined by the equality (in Aut(G0→Specks≥k)) γ.Idβ=Idβ∂(β−1)γ. In other words, ∂(β−1)γ=Idβ−1γ.Idβ. Hence ∂(β−1)γ clearly belongs to AutG0. The fact that it is a cocycle follows directly from Lemma 4.5. Indeed, ∂(β−1)γγ′=Idβ−1γγ′.Idβ=Idβ−1γ.(IdβIdβ−1γ′.Idβ)=Idβ−1γ.(Idβ)γ.(Idβ−1γ′.Idβ)=∂(β−1)γγ.∂(β−1)γ′.
The sequence 1→AutG0→Aut(G0→Specks≥k)→Aut(ks≥k) is a Γ-equivariant exact sequence (where we endow Aut(ks≥k) with the trivial Γ action). Hence, taking Γ-invariant elements, it remains exact. So we just need to check exactness at Aut(ks≥k).
Let β−1∈Aut(ks≥k). Then ∂(β−1) is trivial in H1(Γ,AutG0) if and only if there exists b∈AutG0 such that for all γ∈Γ, b−1Idβ−1(γ.Idβ)(γ.b)=1. By Lemma 4.5, b−1Idβ−1(γ.Idβ)(γ.b)=(Idβb)−1γ.(Idβb), and hence ∂(β−1) is trivial if and only if there exists b∈AutG0 such that Idβb is a Γ-invariant element of Aut(G0→Specks≥k), which proves exactness at Aut(ks≥k).
2. 2.
Let bIdβ∈Aut(Rks→Specks≥k)Γ≅(E×Aut(ks≥k))Γ. As usual in this situation, we set ∂(bIdβ):Γ→AutG0:γ↦∂(bIdβ)γ where ∂(bIdβ)γ is defined by the equality (in Aut(G0→Specks≥k)) γ.(bIdβ)=bIdβ∂(bIdβ)γ. In other words, ∂(bIdβ)γ=(bIdβ)−1γ.(bIdβ). Let us check that ∂(bIdβ)γ belongs to (AdG0)(ks). For γ∈Γ, define cγ′=cγc~γ−1. Now ∂(bIdβ)γ=(bIdβ)−1cβ−1γββ−1γβbβ−1cγ−1Idβ=(bIdβ)−1cβ−1γβ′bIdβc′γ−1 because bIdβ∈Aut(Rks→Specks≥k)Γ, hence we conclude that ∂(bIdβ)γ∈(AdG0)(ks) because cγ′∈(AdG0)(ks) and (AdG0)(ks) is a normal subgroup of Aut(G0→Specks≥k).
The sequence 1→(AdG0)(ks)→Aut(G0→Specks≥k)→Aut(Rks→Specks≥k) is a Γ-equivariant exact sequence. Hence, taking Γ-invariant elements, it remains exact. So we just need to check exactness at Aut(Rks→Specks≥k)Γ.
Let bidβ∈Aut(Rks→Specks≥k)Γ≅(E×Aut(ks≥k))Γ. Then ∂(bidβ) is trivial in H1(Γ,(AdG0)(ks)) if and only if there exists g∈(AdG0)(ks) such that for all γ∈Γ, g−1(bidβ)−1γ.(bidβ)γ.g=1. But g−1(bidβ)−1γ.(bidβ)γ.g=(bIdβg)−1γ.(bIdβg) by Lemma 4.5, and hence ∂(bidβ) is trivial if and only if there exists g∈(AdG0)(ks) such that bIdβg is a Γ-invariant element of Aut(G0→Specks≥k), which proves exactness at Aut(Rks→Specks≥k)Γ. ∎
In order to prove Theorem 1.2, it suffices now to observe that in Proposition 4.13, the image of Γ~ under the coboundary operator is trivial.
The image of Γ⊴Aut(ks≥k) under Aut(ks≥k)∂H1(Γ,AutG0) is trivial.
2. 2.
The image of Γ~⊴Aut(Rks→Specks≥k)Γ under the coboundary map Aut(Rks→Specks≥k)Γ∂H1(Γ,(AdG0)(ks)) is trivial.
Proof.
The proof is just a straightforward computation, using directly the definition of the semilinear Γ-action.
Let γ∈Γ. We want to check that the cocycle Γ→AutG0:σ↦Idγ−1σ.Idγ is trivial. By definition, Idγ−1σ.Idγ=Idγ−1cγ−1σγγ−1cσ−1Idγ=γcγ−1σγcσ−1=γcγ−1cσσcγcσ−1=cγ−1σ.cγ. Since cγ belongs to AutG0, this indeed shows that ∂(γ−1) is cohomologous to the trivial cocycle.
2. 2.
Let c~γIdγ−1∈Γ~⊴Aut(Rks→Specks≥k)Γ≅(E×Aut(ks≥k))Γ. By definition, ∂(c~γIdγ−1)σ=(c~γIdγ−1)−1σ.(c~γIdγ−1). Plugging the definition of the semilinear action, we get
[TABLE]
where the last equality holds because the Galois action on E=AutRks is trivial. Since cγ−1c~γ belongs to (AdG0)(ks), this indeed shows that ∂(c~γIdγ−1) is cohomologous to the trivial cocycle. ∎
Note that by Lemma 4.11, Aut(G0→Specks≥k)Γ/Γ~ is naturally isomorphic to Aut(G→Speck). Similarly, by Lemma 4.12, Aut(Rks→Specks≥k)Γ/Γ~≅Aut(R(G)→Speck). Also note that the restriction of the semilinear Γ-action on Aut(G0→Specks≥k)Γ/Γ~ to AutG0 (respectively (AdG0)(ks)) is the natural Galois action on AutGks (respectively (AdG)(ks)). In particular, the Γ invariant elements are the elements of AutG (respectively (AdG)(k)). Finally, noting that Aut(k)≅Aut(ks≥k)/Γ and that all those identifications are natural enough, we get the result.
∎
We now describe how the coboundary map of the exact sequence 1→AutG→Aut(G→Speck)→Aut(k)→H1(k,AutGks) can be used to compute AutG(k). To illustrate this, we set the following notations for the rest of the section:
Definition 4.16**.**
D denotes a central division algebra of degree 3 over k (hence by a theorem of Wedderburn, D is cyclic). We fix a maximal Galois subfield l of D so that Gal(l/k) is cyclic of order 3 (which exists because D is cyclic). We choose a generator of Gal(l/k) that we denote γ. Choosing an element u∈D normalising l and such that its action by conjugation on l generates Gal(l/k), we set a=u3∈k. We set G:=SL1(D) to be the corresponding algebraic k-group.
2. 2.
Set G0:=SL3 (that we consider over ks, as in the beginning of this section). Recall that AdSL3=PGL3. We denote elements of PGL3(ks) as g11g21g31g12g22g32g13g23g33, which is to be read as “the equivalence class corresponding to the matrix g11g21g31g12g22g32g13g23g33∈GL3(ks)”.
3. 3.
We choose the usual pinning of SL3 where the pair (T,B) consists of diagonal matrices and of upper triangular matrices, and where we choose some generators of the corresponding “basic root groups”. Let R be the corresponding based root datum. Note that AutR is of order 2, and that if our choice of generators for the “basic root groups” is sensible enough, the splitting of AutSL3→AutR is given by the automorphism SL3→SL3:g↦atg−1, where atg denotes the anti-transposed of g, i.e. “the transposed of g along the anti-diagonal”. More formally, for i,j∈{1,2,3}, (atg)ij=g4−j;4−i. Note that taking anti-transpose commutes with taking inverse, so that there is no ambiguity in the notation atg−1.
4. 4.
Consider the homomorphism f:Gal(l/k)→PGL3(l):γ↦010001a00 (where a∈k and γ∈Gal(l/k) have been defined in the first item of these definitions). We choose the cocycle c:Γ→AutG0 defining G=SL1(D) over k to be the composition Γ→Gal(l/k)fPGL3(l)→AutG0.
Having set those notations, we are ready to start computing. The following lemmas are two special cases of [Ha07] that we recover without using any theory of division algebras.
Lemma 4.17**.**
Keep the notations of Definition 4.16 and let β∈Aut(ks≥k) be such that β(l)=l. Let α be the restriction of β to k. Then α∈AutG(k) if and only if there exists λ∈l∗ such that either aα(a)=γ2λγλλ or α(a)a=γ2λγλλ.
Proof.
Note that α∈AutG(k) if and only if α−1∈AutG(k). Using the coboundary map of Proposition 4.13, for all σ∈Γ we have ∂(β−1)σ=Idβ−1σ.Idβ=Idβ−1cβ−1σββ−1cσ−1Idβ=βcβ−1σβcσ−1. Hence by Proposition 4.13, α∈AutG(k) if and only if the cocycle σ↦βcβ−1σβcσ−1 is trivial in H1(k,AutSL3), i.e. if and only if there exists g∈PGL3(ks) and e∈AutR≤AutSL3 such that (ge)−1βcβ−1σβcσ−1σ.(ge)=1. But since γ generates Gal(l/k) and since cσ=1 for all σ acting trivially on l, this is equivalent to the existence of g∈PGL3(l) and e∈AutR≤AutSL3 such that (ge)−1βcβ−1γβcγ−1γ.(ge)=1. Recalling that γ.(ge)=cγγ(ge)cγ−1=cγγgecγ−1, this is equivalent to βcβ−1γβγgecγ−1e−1=g. Also note that ecγ−1e−1={cγ if e is non-trivialcγ−1 otherwise.
First assume that β−1γβ=γ. Then ∂(β−1) is trivial if and only if there exists g∈PGL3(l) such that either βcγγgcγ−1=g or βcγγgcγ=g. Letting g=g11g21g31g12g22g32g13g23g33∈PGL3(l), we have βcγγgcγ−1=γg33aβ(a)γg13a−1γg23a−1γg31β(a)γg11γg21γg32β(a)γg12γg22. Since g is invertible, one of g13, g23 and g33 is non-zero. Let us for example assume that g33=0. Now βcγγgcγ−1=g if and only if there exists λ∈l∗ such that γg33aβ(a)=g11λ, γg11=g22λ and γg22=g33λ. Hence γλγ(γg33aβ(a))=g22λ, and furthermore γ2λγλγ2(γg33aβ(a))=g33λ. Since the computation is similar if g13=0 or g23=0 instead, we conclude that if such a g exists, then there exists λ∈l such that aβ(a)=γ2λγλλ (because γ acts trivially on a∈k and γ3 acts trivially on g33∈l). Conversely, if there exists λ∈l∗ such that aβ(a)=γ2λγλλ, then g=γ2λγλ000γ2λ0001 is such that βcγγgcγ−1=g. A similar computation shows that there exists g∈PGL3(l) such that βcγγgcγ=g if and only if there exists λ∈l∗ such that β(a)a=γ2λγλλ.
Now assuming that β−1γβ=γ−1, ∂(β−1) is trivial if and only if there exists g∈PGL3(l) such that either βcγ−1γgcγ−1=g or βcγ−1γgcγ=g. Or equivalently if and only if there exists g∈PGL3(l) such that either βcγγ−1gcγ=g or βcγγ−1gcγ−1=g. Hence we get the same setting as for the case β−1γβ=γ up to replacing γgij with γ−1gij, which leaves the conclusion unchanged.
∎
Lemma 4.18**.**
Keep the notations of Definition 4.16 and let β∈Aut(ks≥k) be such that β(l)=l′=l. Let δ=βγβ−1(a generator of Gal(l′/k)), let K be the compositum ll′≤ks and let Gal(K/k)=Gal(l/k)×Gal(l′/k) be the corresponding decomposition of Gal(K/k). Let α be the restriction of β to k. Then α∈AutG(k) if and only if there exist λ,μ∈K∗ such that
either γ2λγλλ=a1, δ2μδμμ=β(a) and λδλ=μγμ,
2. 2.
or γ2λγλλ=a, δ2μδμμ=β(a) and λδλ=μγμ.
Proof.
Arguing as in the beginning of the proof of Lemma 4.17, α∈AutG(k) if and only if there exists g∈PGL3(K) and e∈AutR≤AutSL3 such that
[TABLE]
We first do the case e=1. Taking σ=γ in Equation 1, we get γgcγ−1=g. On the other hand, taking σ=δ in Equation 1, we get βcγδg=g. Hence Equation 1 implies that
[TABLE]
To fix ideas, assume g11=0 (the computation is similar if g21=0 or g31=0 instead). So we can further assume that g11=1. Hence there exists λ,μ∈K∗ such that
By looking at the 11 coefficient, this already implies that γ2λγλλ=a−1 and δ2μδμμ=β(a). Finally, by looking at the central coefficient, we see that λ−1γμ−1=μ−1δλ−1. Conversely, if there exists λ,μ∈K∗ such that γ2λγλλ=a1, δ2μδμμ=β(a) and λδλ=μγμ, one can check that g=1μ−1δμ−1μ−1λ−1λ−1γμ−1λ−1γ(δμ−1μ−1)γλ−1λ−1λ−1γ(λ−1γμ−1)λ−1γ(λ−1γ(δμ−1μ−1)) satisfies Equation 1.
In the case where e is the non-trivial automorphism of R, one uses the fact ecγe−1=cγ−1 and then imitates the above computation to get the second condition on λ,μ (to carry out this computation most easily, assume that g11=1 and for the last condition, consider the 23 coefficient).
∎
Remark 4.19**.**
The kind of computations we perform in Lemma 4.17 can easily be adapted for any cyclic division algebra, and the computations in Lemma 4.18 can easily be adapted to any cyclic division algebras of prime degrees. When the degree is not prime, l∩β(l) might be a non-trivial extension of k (for l a maximal cyclic subfield of D), and we did not try to overcome this complication using our methods. Note that in [Ha07]*Section 3, T. Hanke deals with this extra difficulty very efficiently.
Remark 4.20**.**
In light of the results in [Ha07], we proved that α∈AutG(k) if and only if αD≅D or αD≅Dopp (as k-algebras). This is consistent with the fact that αSL1(D)≅SL1(αD), and that for two finite dimensional central division algebras D1,D2 over k, SL1(D1)≅SL1(D2) (as algebraic k-groups) if and only if D1≅D2 or D1≅D2opp (as k-algebras).
5 Semilinear automorphisms of based root datum
We aim to give an explicit description of the short exact sequence 1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1. We base this computation on Lemma 4.12.
Recall that for Rks a split k-scheme of based root datum of type R, the Gal(ks/k)-action on AutRks is trivial, so that H1(ks/k,AutRks) is isomorphic to the set of continuous homomorphisms Hom(Gal(ks/k),AutR) up to conjugation.
Definition 5.1**.**
Let R be a k-scheme of based root datum of type R.
Fix an isomorphism Rks≅Rks and let c~:Gal(ks/k)→AutR be the corresponding cocycle. Let N⊴Gal(ks/k) be the kernel of the homomorphism c~, and let l be the Galois extension of k fixed by N. We call lthe classifying field ofR. Once a separable closure of k has been fixed, the classifying field of R is uniquely determined by R.
2. 2.
We say that R (or R) is semisimple (respectively simply connected, respectively adjoint, respectively simple) if the split connected reductive group of type R is semisimple (respectively simply connected, respectively adjoint, respectively simple).
Remark 5.2**.**
We use the following terminology: a connected reductive k-group is simple if it is non-abelian and has no non-trivial connected closed normal subgroup (some author prefer to call such groups quasi-simple).
Lemma 5.3**.**
Let R be a simple reduced based root datum and let ks be a separable closure of k. The map which associates to a ks/k-form of Rks its classifying field is a bijection between k-schemes of based root datum of type R (up to k-isomorphism) and subfields l≤ks such that l is Galois over k and Gal(l/k) is isomorphic to a subgroup of AutR.
Proof.
Let D be the Dynkin diagram associated to R. Since R is semisimple and reduced, AutR≤AutD. Furthermore, since R is simple AutD is either trivial, Z/2Z or S3. Hence, if two subgroups of AutR are isomorphic, they are actually conjugate. The result follows from the fact that the Galois action on AutR is trivial, and hence H1(ks/k,AutRks) is isomorphic to the set of continuous homomorphisms Hom(Gal(ks/k),AutR) modulo conjugation.
∎
Remark 5.4**.**
In the notations of the proof of Lemma 5.3, one might wonder when the inclusion AutR≤AutD is an equality. This is always the case, except possibly when R is not simply connected or adjoint and is of type D2n. See [Con14]*Proposition 1.5.1 for a precise statement.
Definition 5.5**.**
Let R be a simple k-scheme of based root datum, and let ks be a separable closure of k. We define the Tits index ofR to be gXn,l where
l≤ks is the classifying field of R (hence l is a finite Galois extension of k).
2. 2.
Xn is the label of the Dynkin diagram associated to R.
3. 3.
g is the order of the Galois group Gal(l/k).
Lemma 5.6**.**
Let R be a simple k-scheme of based root datum of type R with index gXn,l.
g∈{1,2,3,6}.
2. 2.
If g=1, Aut(R→Speck)≅AutR×Aut(k), and this isomorphism restricts to AutR≅AutR.
3. 3.
If g=2 or g=3, Aut(R→Speck)≅Aut(l≥k), and this isomorphism restricts to AutR≅Gal(l/k).
4. 4.
If g=6, Aut(R→Speck)≅Aut(l3≥k), where l3 is any non-normal cubic subextension of l/k. Furthermore, AutR is trivial.
Proof.
Let D be the Dynkin diagram associated to R. Since R is semisimple and reduced, AutR≤AutD. Furthermore, since R is simple AutD is either trivial, Z/2Z or S3. It follows that g∈{1,2,3,6}.
2. 2.
The case g=1 means that R is a split k-scheme of based root datum. Hence, AutR≅AutR (because the functor of constant objects is fully faithfull). Furthermore the short exact sequence 1→AutR→Aut(R→Speck)→Aut(k)→1 splits. Also note that Aut(k) acts trivially on AutR, so that the result follows.
3. 3.
Recall that by Lemma 4.12, Aut(R→Speck)≅(AutR×Aut(ks≥k))Γ/Γ~, where AutR×Aut(ks≥k) is endowed with a semilinear Γ-action arising from a choice of cocycle c~:Γ→AutR defining R. For β∈Aut(l≥k), let β~ denote an extension of β to an element of Aut(ks≥k). Let also s∈AutR be an element of order 2 (note that the only case where the existence of such an element is not clear is in type 3D4, in which case it follows from Lemma 5.7). We define a map
[TABLE]
We first check that Φ is well-defined. If β~ and β~′ are two extensions of β, we have to check that Idβ~′Idβ~−1 belongs to Γ~. But (β~′)−1β~ acts trivially on l, hence the image of (β~′)−1β~ under Γ→(AutR×Aut(ks≥k))Γ:δ↦c~δIdδ−1 is indeed equal to Id(β~′)−1β~−1=Idβ~′Idβ~−1.
We now check that the image of Φ is Γ-invariant. Let δ↦δˉ denotes the projection Aut(ks/k)→Aut(l/k). When βγβ−1=γ for all γ∈Gal(l/k), δ.Idβ~−1=c~β~δβ~−1c~δ−1Idβ~−1=c~βδˉβ−1c~δˉ−1Idβ~−1=c~δˉc~δˉ−1Idβ~−1=Idβ~−1 for all δ∈Gal(ks/k). On the other hand, when βγβ−1=γ for γ a generator of Gal(l/k), we have
[TABLE]
for all δ∈Gal(ks/k).
It is readily checked that Φ is a homomorphism, so it remains to check that Φ is bijective. If Φ(β) is trivial, then Idβ~−1 or sIdβ~−1 belongs to Γ~, i.e. there exists δ∈Γ such that either Idβ~−1 or sIdβ~−1 is equal to c~δIdδ−1. This implies that c~δ is trivial, so that δ acts trivially on l, and hence β is trivial.
Finally, we check that Φ is surjective. Let bIdβ~∈(AutR×Aut(ks≥k))Γ. We claim that β~ preserves l. Indeed, for all δ∈Γ, δ.(bIdβ~)=c~β~−1δβ~bc~δ−1Idβ~. Hence bIdβ~ is Γ-invariant if and only if bc~δ=c~β~−1δβ~b for all δ∈Γ. But if β~ does not preserve l, there exists δ∈Γ such that c~δ=1=c~β~−1δβ~, a contradiction. Hence the claim is proved. To conclude, note that if bIdβ~ is Γ-invariant, β~ preserves l and hence up to an element in the image of Φ, we can assume that β~ acts trivially on l. Hence, since bIdβ~ is Γ-invariant, either b is trivial, or b commutes with the image of c~, and hence belongs to the image of c~. In the first case, bIdβ~=Idβ~ is in Γ~. In the second case, bIdβ~=c~γIdγ~−1Idγ~Idβ~ for some γ∈Gal(l/k). But this is in the image of Φ because c~γ~Idγ~−1 and Idβ~ are in Γ~, whilst Idγ~=Φ(γ−1).
For the last statement, note that under the isomorphism Aut(l≥k)≅Aut(R→Speck), the algebraic automorphisms are the one acting trivially on k, i.e. we have AutR≅Aut(l/k).
4. 4.
We begin by proving the following claim.
Claim 1**.**
Any automorphism β∈Aut(l3≥k) has a unique extension β0∈Aut(l≥k) such that for all γ∈Gal(l/k), β0−1γβ0=γ.
Proof of the claim: Let β∈Aut(l3≥k) and let β~∈Aut(ks/k) be an extension to ks. Since β preserves l3 and since l is the normal closure of l3, β~ preserves l. Let l3′ and l3′′ be the two other degree 3 extension of k contained in l. Either β~(l3′)=l3′, or β~(l3′)=l3′′. In the latter case, replace β~ by β~γ0, where γ0∈Gal(l/k) acts trivially on l3 and exchanges l3′ and l3′′. Hence we can assume that β~ preserves l3, l3′ and l3′′. But now the restriction of β~ to l has the desired property. For uniqueness, note that if β0′ is another such extension, then β0′β0−1 is an element of Gal(l/k) preserving l3, l3′ and l3′′, hence β0′β0−1=1.
■
For β∈Aut(l3≥k), we denote by β0 the unique extension of β to an element of Aut(l≥k) provided by Claim 1, and by β0~ an extension of β0 to Aut(ks/k). Now the proof follows the same line as the previous proof of the previous item, and we discuss it more briefly. We define a map
[TABLE]
The proof that Φ(β) does not depend on a lift of β0 and that Idβ~0−1 is Γ-invariant follows the same line as in the previous item. Furthermore, Φ is clearly a homomorphism.
Assume now that Φ(β) is trivial. Hence there exists δ∈Γ such that Idβ~0−1=c~δIdδ−1. Hence c~δ is trivial, which implies that δ acts trivially on l, so that β was trivial. Hence Φ is injective. Let us now prove surjectivity. Let bIdβ~∈(AutR×Aut(ks≥k))Γ. Since c~:Gal(ks/k)→AutR is surjective and since we are working modulo Γ~, we can assume that b=1. We claim that β~ preserves l and that β~−1γβ~=γ for all γ∈Aut(l/k). Indeed, for all δ∈Γ, δ.Idβ~=c~β~−1δβ~c~δ−1Idβ~. Hence Idβ~ is Γ-invariant if and only if c~δ=c~β~−1δβ~ for all δ∈Γ. But if β~ does not preserve l, there exists δ∈Γ such that c~δ=1=c~β~−1δβ~, a contradiction. The fact that β~−1γβ~=γ for all γ∈Aut(l/k) also follows directly, and the claim is proved.
To conclude, note that the claim implies that β~ preserves l3, and hence up to an element in the image of Φ, we can assume that β~ acts trivially on l, so that Idβ~ is trivial modulo Γ~, as wanted. ∎
In the proof of Lemma 5.6, we needed the following lemma.
Lemma 5.7**.**
Let R be a simple based root datum of type R with Tits index 3D4,l. Then R is simply connected or adjoint, and hence AutR contains an element of order 2.
Proof.
If R is neither simply connected nor adjoint, the corresponding split connected reductive group is the split SO8 (there are actually three proper subgroups in the center of the split Spin8, but the corresponding intermediate quotients are all isomorphic). But the split SO8 does not have an outer automorphism of order 3, contradicting the fact that the Tits index of R is 3D4,l. The last part of the lemma follows from the fact that if R is simply connected or adjoint, AutR=AutD4 (see [Con14]*Proposition 1.5.1) and the fact that AutD4=S3.
∎
Corollary 5.8**.**
Let R be a simple k-scheme of based root datum with classifying field l. If Aut(l/k)≆S3, then AutR(k)≅{α∈Aut(k)\leavevmode∣\leavevmodethere exists α~∈Aut(l) extending α}. While if Aut(l/k)≅S3, then AutR(k)≅{α∈Aut(k)\leavevmode∣\leavevmodethere exists α~∈Aut(l3) extending α}, where l3 is a chosen non-normal cubic subextension of l/k.
Proof.
This follows from the surjectivity of Aut(R→Speck)→AutR(k) and from the description of Aut(R→Speck) contained in Lemma 5.6.
∎
In view of Corollary 5.8, it is useful to introduce the following notation.
Definition 5.9**.**
Let l≥k be a field extension of k. We denote by Autl(k) the group of automorphisms of k which extend to an automorphism of l, i.e. Autl(k)={α∈Aut(k)\leavevmode∣\leavevmodethere exists α~∈Aut(l) extending α}.
Using the identifications we made in Lemma 5.6 and Corollary 5.8, we can rewrite in a very explicit form the short exact sequence 1→AutR(G)→Aut(R(G)→Speck)→AutR(G)(k)→1.
Proposition 5.10**.**
Let R be a simple k-scheme of based root datum of type R with Tits index gXn,l.
If g=1, the short exact sequence 1→AutR→Aut(R→Speck)→AutR(k)→1 is isomorphic to the short exact sequence 1→AutR→AutR×Aut(k)→Aut(k)→1. In particular, it always splits.
2. 2.
If g=2 or g=3, the short exact sequence 1→AutR→Aut(R→Speck)→AutR(k)→1 is isomorphic to 1→Gal(l/k)→Aut(l≥k)→Autl(k)→1.
3. 3.
If g=6, let l3 be a (non normal) cubic subextension of l/k. The short exact sequence 1→AutR→Aut(R→Speck)→AutR(k)→1 is isomorphic to 1→1→Aut(l3≥k)→Autl3(k)→1. In particular, it always splits.
Proof.
This is a direct consequence of Lemma 5.6 and Corollary 5.8. Note that in each case, the map Aut(l≥k)→Autl(k) is given by restriction to k. Also note that when g=6, and since l3 is a non normal cubic extension of k, the group Aut(l3/k) is trivial, and Aut(l3≥k)≅Autl3(k).
∎
We end this discussion with examples where the short exact sequence 1→AutR→Aut(R→Speck)→AutR(k)→1 does not split.
Definition 5.11**.**
The field k is called rigid if for any finite Galois extension k′ of k such that k′ is not algebraically closed, every automorphism of k′ fixes k pointwise.
Definition 5.12**.**
A prime field is either the field of rational numbers of a finite field of order p for some prime p.
Examples of rigid fields include prime fields and Qp (the field of p-adic numbers) for any prime p. Let us give a reference for this latter assertion.
Lemma 5.13**.**
Let p be a prime number and let Qp be the field of p-adic numbers. Let Qp≤k′ be a finite Galois extension. Then every automorphism of k′ fixes pointwise Qp.
Proof.
The field k′ is complete and non algebraically closed. Hence by [Sch33], all complete norms on k′ are equivalent. Hence an automorphism of k′ has to preserve the norm, which is to say that it has to be continuous. But since any automorphism acts trivially on Q, by continuity it also has to act trivially on Qp.
∎
Corollary 5.14**.**
Assume that k is a finite (respectively possibly infinite) Galois extension of a rigid (respectively prime) field k0. Let G be a connected reductive k-group which is quasi-split and absolutely simple. Assume that R(G) has Tits index gXn,l, with g=2 or g=3. Further assume that l is a Galois extension of k0. Then AutG(k)=Aut(k) and the short exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1 splits if and only if 1→Gal(l/k)→Gal(l/k0)→Gal(k/k0)→1 splits.
Proof.
In view of Theorem 1.3 and Proposition 5.10, the short exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1 splits if and only if the short exact sequence 1→Gal(l/k)→Aut(l≥k)→Autl(k)→1 splits. Since k0 is rigid (or even prime if k is an infinite Galois extension) and k is a normal extension, Aut(l≥k)=Gal(l/k0). Furthermore, Aut(k)=Gal(k/k0), and since l/k0 is Galois, every element of Gal(k/k0) extends to Gal(l/k0). Hence Autl(k)=Gal(k/k0), as wanted.
∎
Remark 5.15**.**
Corollary 5.14 directly implies the corollary stated at the beginning of the
introduction of this paper. Indeed, Q is a prime field and Qp is rigid by Lemma 5.13. Furthermore, Autabstract(G(k))=Aut(G→Speck) by the Borel–Tits theorem that we stated at the very beginning of the introduction. For the ease of non-expert readers, let us also give an explicit realisation of the quasi-split, absolutely simple, adjoint algebraic k-group of type 2An−1 with corresponding quadratic separable extension l: denote the Galois conjugation on l by x↦xˉ, and for g∈PGLn(l), set (atgˉ)ij=gˉn+1−j;n+1−i (i.e. the anti-transposed conjugated matrix). We define PGUn(k)={g∈PGLn(l)\leavevmode∣\leavevmodeatgˉg=1}. This is easily interpreted as the k-rational points of an algebraic k-group, and one readily sees that this algebraic k-group is the quasi-split, absolutely simple, adjoint algebraic k-group of type 2An−1 with corresponding quadratic separable extension l (because the corresponding cocycle is g↦atg−1, which is an outer automorphism of PGLn preserving its Borel subgroup consisting of upper triangular matrices).
6 The SLn(D) case over a local field
6.1 Outer automorphisms of finite dimensional central simple algebras over local fields
We now explore the same question for algebraic groups of the form SLn(D). First, we need to be a bit more precise and make a distinction between the algebraic k-group and its group of k-rational points.
Definition 6.1**.**
Let A be a finite dimensional central simple k-algebra. Following the notation of [KMRT98], we denote the corresponding algebraic k-group of “reduced norm 1 elements” by SL1(A). The k-rational points of SL1(A) are the elements of A of reduced norm 1, and we denote this group by SL1(A). When A=Mn(A′) for some finite dimensional central simple k-algebra A′, we also denote SL1(A) (respectively SL1(A)) by SLn(A′) (respectively SLn(A′)).
Remark 6.2**.**
Note that for A a finite dimensional central simple k-algebra and α∈Aut(k), αSLn(A) is naturally isomorphic (as an algebraic k-group) to SLn(αA). Hence by (a slightly enhanced version of) [KMRT98]*Remark 26.11, α∈AutSLn(A)(k) if and only if A≅αA or Aopp≅αA (as k-algebras).
We will restrict ourselves to working over a local field. For us, a local field is a non-archimedean non-discrete topological field which is locally compact (or equivalently, a field isomorphic to Fpn((T)) or a finite extension of Qp for some prime number p). For the rest of the paper, the letter K exclusively stands for a local field. Let us begin by recalling the classification of central simple algebras over local fields.
Definition 6.3**.**
Let k be a field and let l/k be a finite cyclic extension of degree d. Let σ∈Gal(l/k) be a generator of the cyclic group Gal(l/k), let a∈k and let u be an abstract symbol. The cyclic algebra A(l/k,σ,a,u) is defined as follows: as a k-vector space, A(l/k,σ,a,u)≅i=0⨁d−1uil, and the multiplication is defined by using the relations ud=a and u−1xu=σ(x) for all x∈l. We also denote it A(l/k,σ,a).
We recall that the algebra A(l/k,σ,a,u) of Definition 6.3 is always central simple over k, and that it is isomorphic to the k-algebra Mn(k) if and only if a is the norm of an element in l.
Definition 6.4**.**
Let K be a local field and let d,r∈N with d≥1. Let Kd be the unramified extension of K of degree d, let σ∈Gal(Kd/K) be the Frobenius automorphism (i.e. the automorphism inducing the Frobenius automorphism on Gal(Kd/K)), and let π be a uniformiser of K. We define A(d,r) to be the cyclic algebra A(Kd/K,σ,πr).
Note that up to isomorphism, A(d,r) does not depend on the choice of π. In fact, given two uniformisers π and π~, an explicit isomorphism (Kd/K,σ,πr)≅(Kd/K,σ,π~r) having the same form as the one appearing in Lemma 6.5 can be given.
Lemma 6.5**.**
Let K be a local field. Let A=A(d,r) and Kd,σ,π be as in Definition 6.4. Let α be an automorphism of Kd such that α(K)=K, and assume that there exists an element x in Kd such that NKd/K(x)=πrα(πr). Then the map ϕ(α,x):A→A:i=0∑d−1uiai↦i=0∑d−1(ux)iα(ai) is a ring automorphism of A.
Proof.
We view A as a quotient of the twisted polynomial ring Kd[u;σ] (see [Jac96]*Section 1.1 for the definition of a twisted polynomial ring) modulo the relation ud=πr. Given an automorphism α in Aut(Kd), we can define a map fα:Kd[u;σ]→Kd[u;σ]:{u↦uxa↦α(a) for all a∈Kd. By [Jac96]*Proposition 4.6.20, fα is a ring automorphism as soon as ασ=σα. Recall that by assumption, α(K)=K. Hence σ−1ασα−1 belongs to Gal(Kd/K), and its induced automorphism on the residue field Kd is a commutator in Aut(Kd), thus trivial (note that since every automorphism of a local field is continuous, it always induces an automorphism of the residue field). We conclude that σ−1ασα−1 itself was trivial by [S79]*Chapter III, §5, Theorem 3. Hence, fα is indeed a ring automorphism.
Furthermore, if it passes to the quotient, fα induces the automorphism ϕ(α,x). Hence it suffices to check that fα preserves the relation. But we have fα(ud−πr)=(ux)d−α(πr)=udNKd/K(x)−α(πr)=(ud−πr)πrα(πr), as wanted.
∎
For α an automorphism of a (non-necessarily commutative) ring R, we denote by α~ the corresponding automorphism of Mn(R) (the algebra of n×n matrices with coefficient in R) obtained by applying α coefficient by coefficient. Also, for A a finite dimensional central simple algebra over a field k, we denote by Nrd:A→k its reduced norm.
Lemma 6.6**.**
Let k be a field and let A be a central simple k-algebra. For every ring automorphism α of A and x∈A,
[TABLE]
Proof.
Let ks be a separable closure of k. Every automorphism α
of A preserves the center k; the restriction α∣k
extends to an automorphism β of ks, and we may consider the
tensor product
[TABLE]
Since ks splits A, we may also consider an isomorphism of
ks-algebras f:A⊗kks→Md(ks). The ring
automorphism f∘(α⊗β)∘f−1 of Md(ks)
restricts to β on the center ks, hence
f∘(α⊗β)∘f−1∘β~−1 is the
identity on ks. Since every ks-automorphism of Md(ks) is
inner, we may find g∈GLd(ks) such that
[TABLE]
The following diagram then commutes:
[TABLE]
Since Nrd=det∘f, the lemma follows.
∎
We set some notations that we use for the rest of the paper.
Definition 6.7**.**
Let K be a local field. Let A(d,r) and Kd,σ,π be as in Definition 6.4. Let α be an automorphism of Kd such that α(K)=K, and assume that there exists an element x in Kd such that NKd/K(x)=πrα(πr). The map ϕ~(α,x):Mn(A)→Mn(A) corresponding to the automorphism ϕ(α,x):A→A from Lemma 6.5 preserves elements of reduced norm 1 by Lemma 6.6. We again denote its restriction to SLn(A) by ϕ~(α,x).
Remark 6.8**.**
In the notations of Definition 6.7, ϕ~(α,x) is an isomorphism of k-algebras Mn(A)≅α−1Mn(A). Hence, by [KMRT98]*Theorem 26.9, ϕ~(α,x) corresponds to a unique k-isomorphism of algebraic groups SLn(A)≅α−1SLn(A). More concretely, this can also be seen by using a representation of A in Md2(K) (where d is the degree of A).
The following observation explains in part why the local field case is so much simpler than say the global field case (see also the end of Remark 6.11).
Lemma 6.9**.**
Let K be a local field and let Kd be a finite dimensional unramified extension of K. Any automorphism of K extends to an automorphism of Kd.
Proof.
Let α∈Aut(K). There exists an extension β of α to the separable closure of K. Note that if Kd≅K[X]/(f), then β(Kd)≅K[X]/(αf), where αf is the polynomial obtained from f by applying α to its coefficients. But α is continuous, and an extension is unramified if and only if it is isomorphic to K[X]/(g) for some polynomial g whose coefficients are all of valuation [math]. Hence by uniqueness of unramified extensions of a given degree, β preserves Kd.
∎
Corollary 6.10**.**
Let A be a finite dimensional central simple algebra over a local field K. Every automorphism of K extends to an automorphism of A. Hence, AutSLn(A)(K)=Aut(K).
Proof.
By Theorem A.1, the central simple algebra A is an algebra of the form A(d,r), i.e. a cyclic algebra of the form (Kd/K,σ,πr) with Kd,σ,π as in Definition 6.4.
Let α∈Aut(K). By Lemma 6.9, there exists β∈Aut(Kd) extending α. Also, by [S79]*Chapter V,§2, Corollary, NKd/K is surjective on OK×. Furthermore, any automorphism of a local field preserves the valuation. Hence there exists x∈Kd such that NKd/K(x)=πrα(πr). Then the automorphism ϕ(β,x) defined in Lemma 6.5 is an extension of α to A. Finally, ϕ~(β,x) from Definition 6.7 is defined over α−1, so that the last claim follows from Remark 6.8.
∎
Remark 6.11**.**
If α∈Aut(K) is of finite order, the result in Corollary 6.10 asserting that α extends to an automorphism of A is an old result. Indeed, using Lemma A.4, it is a direct consequence of [EML48]*Corollary 7.3 (see also [Han07]*Theorem 5.6) and the fact that A=Mn(D) for some division algebra D. This already settles the question in characteristic [math]. In positive characteristic, Lemma 6.10 can be seen as a direct corollary of the results in [Ha07]. Note that the fact that any extension of α∈Aut(K) to the separable closure of K preserves Kd simplifies matters (compare with Lemma 4.18 when the extension β does not preserve the chosen maximal subfield l).
6.2 Sufficient condition for the exact sequence not to split
We turn to the splitting question for the exact sequence 1→AutG→Aut(G→Speck)→AutG(k)→1, still assuming G=SLn(A) over a local field. Let us introduce another notation for a subgroup of the group of semilinear automorphisms, which allow us to introduce a “ground field”.
Definition 6.12**.**
Let G be a k-group scheme. Let k′ be a subfield of k. We denote by Aut(G→Speck/k′) the subgroup of Aut(G→Speck) consisting of semilinear automorphisms over an automorphism α belonging to Aut(k/k′). Furthermore, we denote by AutG(k/k′) the image of Aut(G→Speck/k′) under the map Aut(G→Speck)→AutG(k).
Theorem 6.13**.**
Let D be a central division algebra of degree d over a local field K and let G=SLn(D). Let K′ be a subfield of K such that K/K′ is a finite Galois extension. Then the short exact sequence 1→AutG→Aut(G→SpecK/K′)→AutG(K/K′)→1 splits if and only if gcd(nd,[K:\nolinebreakK′]) divides n.
Proof.
By Corollary 6.10, AutG(K)=Aut(K). Hence, since Gal(K/K′) is contained in AutG(K), the short exact sequence splits if and only if G is defined over K′ (see Theorem 2.5). Let H be this hypothetical form of G over K′.
The case d=1 being obviously true, let us assume that d≥2. Now, by the classification of simple groups over local fields (see [Tits77]*Section 4.2 and 4.3), the Tits index of H is of the form 1A(d′) or 2A(1), since these are the only groups of type A over local fields. Note that a distinguished orbit has to remain distinguished after scalar extension, because a non-trivial root remains non-trivial after scalar extension. Hence H cannot be of type 2A(1), because groups of type 2A(1) have extremal roots that are distinguished, whereas G has undistinguished extremal roots when d≥2. But the only groups of type 1A(d′) are groups of the form SLn′(D′) where n′≥1 and D′ is a division algebra over K′. So we conclude that H is of this form.
We use the notation inv for the map classifying division algebras over local fields (see Theorem A.1 for a precise definition of inv). Let d′ be the degree of D′ over K′, and let r′ be such that [d′r′]=inv([D′]) in Q/Z. Also, let a=gcd(d′,[K:K′]). The base change of SLn′(D′) from K′ to K is the algebraic group SLan′(A(ad′,a[K:K′]r′)) by Proposition A.5. Since H is isomorphic to G over K, an′=n and ad=d′. Hence, a=gcd(ad,[K:K′]), which implies that gcd(adn′,[K:K′]) divides an′. Now, the equation an′=n already proves that if H exists, then gcd(nd,[K:K′]) divides n.
Conversely, let a=gcd(nd,[K:K′]), and assume that a divides n. We then set n′=an, d′=ad and r′ such that a[K:K′]r′−r∈dZ (such an r′ exists because a[K:K′] is prime to d). With those parameters, the algebraic group SLn′(A(d′,r′)) is a form of G over K′, as wanted.
∎
Remark 6.14**.**
The condition that gcd(nd,[K:\nolinebreakK′]) divides n is equivalent to require that for all primes p dividing d, the p-adic valuation of [K:K′] is less than or equal to the p-adic valuation of n.
Corollary 6.15**.**
Let D be a central division algebra of degree d over a local field K and let G=SLn(D). The short exact sequence 1→AutG→Aut(G→SpecK)→AutG(K)→1 does not split if there exists a subfield K′≤K such that K/K′ is finite Galois and gcd(nd,[K:K′]) does not divide n.
Proof.
1→AutG→Aut(G→SpecK/K′)→AutG(K/K′)→1 does not split by Theorem 6.13, hence neither does 1→AutG→Aut(G→SpecK)→AutG(K)→1.
∎
6.3 Sufficient condition for the exact sequence to split
In characteristic [math], it is actually straightforward to prove the converse of Corollary 6.15.
Theorem 6.16**.**
Let D be a central division algebra of degree d over a local field K of characteristic [math] and let G=SLn(D). The short exact sequence 1→AutG→Aut(G→SpecK)→AutG(K)→1 does not split only if there exists a subfield K′≤K such that K/K′ is finite Galois and gcd(nd,[K:K′]) does not divide n.
Proof.
By Corollary 6.10, AutG(K)=Aut(K). Since K is of characteristic [math], it is a finite extension of Qp for some prime p. But every automorphism of K acts trivially on Qp by Lemma 5.13. Hence, by Galois theory, Aut(K) is a finite group. Furthermore, letting KAut(K) be the subfield of K fixed by Aut(K), the extension K/KAut(K) is Galois with Galois group Aut(K).
Let a=gcd(nd,[K:KAut(K)]). Assuming that there does not exist a subfield K′≤K such that K/K′ is finite Galois and such that gcd(nd,[K:K′]) does not divide n, we have in particular that a divides n. Also, let r∈N be such that [dr]=inv([D]). Since a[K:KAut(K)] is prime to d, there exists r′∈N such that a[K:KAut(K)]r′−r∈dZ. Hence, by Proposition A.5, the algebraic group SLan(A(ad,r′)) is a form of G over KAut(K), because gcd(ad,[K:KAut(K)])=a. But in view of Lemma 2.4, this implies that the homomorphism Aut(G→SpecK)→Aut(K)=Gal(K/KAut(K)) has a section, as wanted.
∎
Remark 6.17**.**
Putting Corollary 6.15 and Theorem 6.16 together already proves Theorem 1.5 in characteristic [math]. In particular, the sequence always splits for K=Qp (this actually directly follows from the rigidity of Qp, which was used in the proof of Theorem 6.16). For a more interesting example, if K is a Galois extension of Qp of degree pi for some prime p and some i∈N, then Theorem 1.5 asserts that the following are equivalent:
The sequence 1→AutSLn(D)→Aut(SLn(D)→SpecK)→AutSLn(D)(K)→1 splits.
2. 2.
If n is not divisible by pi, the degree of D is not divisible by p.
We now aim to prove an analogue of Theorem 6.16 but in positive characteristic. When K is of positive characteristic, the fixed field KAut(K) is finite and K/KAut(K) is not Galois. Thus we cannot use the same method than in characteristic [math].
Instead, the strategy goes as follows: we decompose Aut(K) in various pieces, we give a section of Aut(SLn(D)→SpecK)→Aut(K) separately for each pieces and then we check that everything can be glued. Let us begin by decomposing Aut(K).
Lemma 6.18**.**
Let K=Fpi((T)). Since Fpi is the algebraic closure in K of the prime field of K, Fpi is preserved by any automorphism of K. Let N(K)={α∈Aut(K)\leavevmode∣\leavevmodeα acts trivially on Fpi}. We have Aut(K)≅N(K)⋊Gal(K/Fp((T))).
Proof.
We want to show that the short exact sequence 1→N(K)→Aut(K)fGal(Fpi/Fp)→1 splits. But by [S79]*Chapter III, §5, Theorem 3, f maps Gal(K/Fp((T))) isomorphically onto Gal(Fpi/Fp), hence the result.
∎
We furthermore decompose the group N(K). Since automorphisms of K are continuous, an element α of N(K) is therefore determined by its action on T, and we have α(T)=j=1∑∞ajTj, where a1∈Fpi× and aj∈Fpi for all j≥2.
Definition 6.19**.**
Let J(K)={α∈N(K)\leavevmode∣\leavevmodeα(T)=T+j=2∑∞ajTj,\leavevmodeaj∈Fpi} and let Cpi−1={α∈N(K)\leavevmode∣\leavevmodeα(T)=aT,\leavevmodea∈Fpi×}. With those notations, the group N(K) is isomorphic to J(K)⋊Fpi×. For x∈Fpi×, we denote by ev(xT) the corresponding element of Aut(K).
In summary, we have decomposed Aut(K) as the group (J(K)⋊Fpi×)⋊Gal(K/Fp((T))). We go on by giving a section to Aut(SLn(D)→SpecK)→Aut(K) for each component of Aut(K), one at a time. In doing so, we will at the same time take care that the given section glues well with the other sections (though each are studied separately). Hence, a given formula for a section on one component of Aut(K) will at times be slightly more complicated than a formula one would naturally consider if one was not aiming for a global section. In each case, we write a remark to explain how the given formula could be simplified if not aiming for a global splitting.
We need to set a few notations.
Definition 6.20**.**
Let Fpalg be an algebraic closure of Fp. We denote by F the Frobenius automorphism of Fpalg((T)) (i.e. the automorphism of Fpalg((T)) fixing Fp((T)) and inducing the Frobenius automorphism on Fpalg). For any finite extension extension L of Fp, we also denote by F the restriction of F to L and to L((T)).
2. 2.
We fix p a prime number, i,n,d,r∈N>0 such that gcd(d,r)=1 and two symbols u,T. We set K=Fpi((T)), E=Fpid((T)) and D=(E/K,Fi,Tr,u) (a cyclic division algebra of degree d over K with symbol u as in Definition 6.4). Furthermore, we let G be the algebraic K-group SLn(D).
3. 3.
For α∈N(K) we define its extension αE to Aut(E) as follows: αE acts trivially on the residue field, while αE(T)=α(T). We thus get an injective homomorphism N(K)→N(E):α↦αE. Abusing notations, we again denote αE by α.
4. 4.
We fix a,b∈N such that ab=pi−1, gcd(dpi−1,pi−1)=gcd(db,b)=b and gcd(d,a)=1.
5. 5.
We fix a′,b′∈N such that a′b′=i, gcd(di,i)=gcd(di,b′)=b′ and gcd(d,a′)=1.
6. 6.
We choose a generator ζ of the multiplicative group Fpi×.
7. 7.
For g∈PGLn(D), we denote by int(g) the automorphism by conjugation of g on G, i.e. int(g):G→G:h↦ghg−1.
Remark 6.21**.**
The natural numbers a,b,a′,b′ are uniquely determined by their definition. Note that we have in particular gcd(a,b)=1=gcd(a′,b′). Also note that by Definition 6.4, u−1xu=Fi(x) for all x∈E.
We will further make use of the following notation: if l,m∈N and A1,…,Al are m×m matrices, we denote Diag(A1,…,Al) the corresponding block diagonal lm×lm matrix. Furthermore, the m×m identity matrix is denoted Idm. We will denote the cyclic group of order m by Cm.
Proposition 6.22**.**
Keep the notations of Definition 6.20. Assume that gcd(p,d)=1 and that bb′ divides n. For α∈J(K), there exists a unique xα∈1+TFpi[[T]] such that xαdb′=Trα(Tr). Let M=Diag(Idb,xαIdb,xα2Idb,…,xαb′−1Idb)(so that M is a bb′×bb′ matrix which is block diagonal) and let Xα=Diag(M,…,M) where we have bb′n terms (so that Xα is a n×n matrix which is block diagonal with coefficients in 1+TFpi[[T]]). Recalling the notation introduced in Remark 6.8, the map
[TABLE]
is a homomorphism whose composition with the map Aut(G→SpecK)→AutG(K) is the identity on J(K).
Proof.
Note that gcd(p,d)=1 and gcd(db′,b′)=b′ implies gcd(p,b′)=1, so that gcd(p,db′)=1. Hence, for α∈J(K) the existence and uniqueness of xα in 1+TFpi[[T]] such that xαdb′=Trα(Tr) follows directly from Hensel’s lemma. We claim that for α,β∈J(K), xβ∘α=xβ.β(xα). By uniqueness, this equation holds if and only if Tr(β∘α)(Tr)=[xβ.β(xα)]db′. But the right hand side is equal to Trβ(Tr).β(Trα(Tr)), which is indeed equal to Tr(β∘α)(Tr). Checking that fJ(K) is a homomorphism is now straightforward:
[TABLE]
Note that if we were not aiming to define a global section of Aut(G→SpecK)→AutG(K), we could just as well get rid of the factor int(Xα) and hence we would not need the assumption that bb′ divides n. In light of this, the next proposition really is a converse to Proposition 6.22.
Proposition 6.23**.**
Keep the notations of Definition 6.20. If gcd(p,d)=1, there does not exist a homomorphism J(K)→Aut(G→SpecK) whose composition with Aut(G→SpecK)→AutG(K) is the identity on J(K).
Proof.
By Theorem 6.13, it suffices to prove that there exists K′≤K such that K/K′ is finite Galois with Gal(K/K′)≤J(K) and such that gcd(nd,[K:K′]) does not divide n. Let H be a group of order pn. By [C97]*Theorem 3, there exists an injective homomorphism H↪J(Fp((T))). Also note that J(Fp((T))) can be seen as a subgroup of J(K) in a natural way, so that J(K) has a subgroup of order pn, that we again denote by H. Now, let K′=KH={x∈K\leavevmode∣\leavevmodeα(x)=x for all α∈H}. Hence, K/K′ is a Galois extension with Gal(K/K′)=H≤J(K) and gcd(nd,[K:K′])=gcd(nd,pn) does not divide n because gcd(p,d)=1, as wanted.
∎
We now construct a section of Aut(G→SpecK)→Aut(K) for Fpi×. In fact, using the same line of argument as for Theorem 6.13, we know that a section for Fpi× exists if and only if gcd(nd,pi−1) divides n (where d and n appear in the form of G=SLn(D), d denoting as usual the degree of D). But we need to have an explicit formula, since we want to ensure that it glues well with the map fJ(K) constructed in Proposition 6.22. We found those explicit formulas by working out by hand some low degree examples for which we could follow explicitly what the theory was predicting, and then by generalising our findings to any degree. Again, we give a section which is going to be slightly more complicated than necessary, because we aim to define a global section in the end.
We first need a (db′)-th root of ζbr.
Lemma 6.24**.**
Keep the notations of Definition 6.20 and let Ca be the group generated by ζb in Fpi×. There exists a unique z∈Ca such that zdb′=ζbr.
Proof.
Note that gcd(d,a)=1 and gcd(db′,b′)=b′ implies gcd(b′,a)=1, so that gcd(db′,a)=1. Hence the result follows from the fact that db′ is invertible in the cyclic group of order a.
∎
Proposition 6.25**.**
Keep the notations of Definition 6.20 and of Lemma 6.24, so that zdb′=ζbr. Assume that bb′ divides n. Let M=Diag(Idb,zIdb,z2Idb,…,zb′−1Idb)(so that M is a bb′×bb′ matrix which is block diagonal) and let Z=Diag(M,…,M) where we have bb′n terms (so that Z is a n×n matrix which is block diagonal with coefficients in Fpi). Recalling the notation introduced in Remark 6.8, the map
[TABLE]
is a homomorphism whose composition with the map Aut(G→SpecK)→AutG(K) is the identity on Ca.
Proof.
Note that Trev(ζbjT)(Tr)=ζbrj=(zb′j)d=NE/K(zb′j), so that we can indeed use Definition 6.7. With these definitions, for all j,j′∈N, we have
[TABLE]
Hence the fact that fCa is well-defined follows from za=1 (which holds because za is the unique (db′)-th root in Ca of ζabr=1).
∎
Remark 6.26**.**
In the proof of Proposition 6.25, we needed to show that fCa(ev(ζbT))a is a trivial element of Aut(G→SpecK). We proved it by showing that this algebraic automorphism of SLn(D) induces a trivial automorphism of SLn(D), hence is itself trivial by the density of rational points for G. This will be used repeatedly to show that K-automorphisms of G are trivial. In using that argument, it is also important to notice that a semilinear automorphism of the form int(g)ϕ~(α,x) is algebraic if and only if α acts trivially on K.
Remark 6.27**.**
Note that in Proposition 6.25, the factor int(Zj) is unnecessary if one is just interested in a section defined on Ca alone. Hence, a section of Aut(G→SpecK)→AutG(K) only defined on Ca always exists (i.e. one does not need to assume that bb′ divides n).
Proposition 6.28**.**
Keep the notations of Definition 6.20 and assume that b divides n. Let Cb be the group generated by ζa in Fpi×. There exists an element y∈Fpidb such that yFid(y)=ζar. Choosing a Fpid-basis of Fpidb, we obtain an embedding φ:Fpidb→Mb(Fpid). Let g=φ(y−1) and let Y=Diag(g,…,g) where we have bn terms (so that Y is a n×n matrix which is block diagonal with coefficients in Fpid). Recalling the notation introduced in Remark 6.8, the map
[TABLE]
is a homomorphism whose composition with the map Aut(G→SpecK)→AutG(K) is the identity on Cb.
Proof.
For the existence of y∈Fpidb such that yFid(y)=ζar, note that NFpidb/Fpid(ζar)=ζabr=1. Also note that the extension Fpidb/Fpid is Galois cyclic, and that Fid generates its Galois group. Hence, by Hilbert’s Theorem 90, there indeed exists y∈Fpidb such that yFid(y)=ζar. For the rest of the proof, we choose such an y.
From yFid(y)=ζar, it readily follows that Fi(y)y−1 and yb belong to Fpid, since they are both invariant under Fid. Note that Trev(ζajT)(Tr)=ζajr=(yFid(y))j=NE/K((yFi(y))j), so that we can indeed use Definition 6.7.
It remains to check that fCb is well-defined and is a homomorphism. Note that for all j,j′∈N, we have
[TABLE]
Hence, it suffices to check that int(Yb)ϕ~(ev(ζabT),(Fi(y)y−1)b) is the identity on SLn(D). But since yb∈Fpid, gb and Yb are diagonal and by definition of Y, y−bY−b=1. Furthermore, recall that u−1Ybu=Fi(Yb) (see Remark 6.21). Hence int(Yb)ϕ~(1,(Fi(y)y−1)b)(u.Idn)=Yb(u(Fi(y)y−1)bIdn)Y−b=uFi(Yb)Fi(yb)y−bY−b=u.Idn. Since int(Yb)ϕ~(1,(Fi(y)y−1)b) also acts trivially on SLn(E)≤SLn(D), this concludes the proof.
∎
Remark 6.29**.**
When trying to find a section of Aut(G→SpecK)→AutG(K) only defined on Cb, this is the only formula we could come up with. Otherwise stated, the complicatedness of the formula defining fCb does not come from the need to adjust it to other partial sections of Aut(G→SpecK)→AutG(K).
Though not needed, we check that the automorphism int(Yj)ϕ~(ev(ζajT),(Fi(y)y−1)j) appearing in Proposition 6.28 does not depend on the choice of y.
Lemma 6.30**.**
Keep the notations of Proposition 6.28. Let y′∈Fpidb such that y′Fid(y′)=ζar. Let g′=φ(y′−1) and let Y′=Diag(g′,…,g′) where we have bn terms. Then fCb(ev(ζajT))=int(Y′j)ϕ~(ev(ζajT),(y′Fi(y′))j).
Proof.
Those two elements of Aut(G→SpecK) differ by int(YjY′−j)ϕ~(1,(Fi(y′)y′Fi(y)y′)j). Let x=yy′−1. Note that x belongs to Fpid because x is invariant under Fid, and hence YjY′−j=Diag(gg′−1,…,gg′−1)j is actually the diagonal matrix xj.Idn.
Hence int(YjY′−j)ϕ~(1,(Fi(y′)y′Fi(y)y′)j)=int(xj.Idn)ϕ~(1,(xFi(x))j). But this automorphism is trivial, since int(xj.Idn)ϕ~(1,(xFi(x))j)(u.Idn)=xj.u(xFi(x))j.x−jIdn=u.Idn.
∎
As before, we can also prove a converse to Proposition 6.28.
Proposition 6.31**.**
Keep the notations of Proposition 6.28. If b does not divide n, there does not exist a homomorphism Cb→Aut(G→SpecK) whose composition with Aut(G→SpecK)→AutG(K) is the identity on Cb.
Proof.
By Theorem 6.13, it suffices to prove that there exists K′≤K such that K/K′ is finite Galois with Gal(K/K′)≤Cb and such that gcd(nd,[K:K′]) does not divide n. Recall (see Definition 6.20) that a is prime to b with ab=pi−1 so that ζa is a b-th primitive root of unity of K. Hence, K′=Fpi((Tb)) is such that K/K′ is Galois of degree b, and Gal(K/K′) is generated by the automorphism of K sending T to ζaT, so that Gal(K/K′)=Cb. Finally, gcd(nd,[K:K′])=gcd(nd,b) does not divide n because by definition b=gcd(db,b).
∎
Finally, we construct a section to Aut(G→SpecK)→Aut(K) for Gal(Fpi((T))/Fp((T))).
Proposition 6.32**.**
Keep the notations of Definition 6.20. Let Ca′ be the group generated by Fb′ in Gal(K/Fp((T))). Let c∈N be such that ca′+1∈dZ(which exists because gcd(a′,d)=1). Recalling the notation introduced in Remark 6.8, the map
[TABLE]
is a homomorphism. Furthermore, its composition with the map Aut(G→SpecK)→AutG(K) is the identity on Ca′.
Proof.
Since Fi acts trivially on K, Fj(ci+b′) is indeed an extension of Fjb′ (seen as restricted to K) to E. Furthermore, Fa′(ci+b′) acts trivially on E=Fpid((T)), because a′(ci+b′)=i(ca′+1)∈idZ by definition of c. Hence, fCa′ is indeed a well-defined homomorphism.
∎
We need one more bit of notation before defining the last portion of the section Aut(G→SpecK)→AutG(K) on Gal(K/Fp((T))).
Definition 6.33**.**
With the notations of Definition 6.20, let 0b be the zero b×b matrix, and let w be the following bb′×bb′ matrix:
[TABLE]
Proposition 6.34**.**
Keep the notations of Definition 6.20. Assume that bb′ divides n. Let Cb′ be the group generated by Fa′ in Gal(K/Fp((T))). With the notations of Definition 6.33, let W=Diag(w,…,w) where we have bb′n terms (so that W is a n×n matrix which is block diagonal with coefficients in the set {0,1,u}). Recalling the notation introduced in Remark 6.8, the map
[TABLE]
is a homomorphism. Furthermore, its composition with the map Aut(G→SpecK)→AutG(K) is the identity on Cb′.
Proof.
The only assertion that requires a justification is that the map is well-defined, i.e. we have to check that (int(W)ϕ~(Fa′,1))b′ is the identity on SLn(D). By definition, Wb′ is the scalar matrix u.Idn. Hence (int(W)ϕ~(Fa′,1))b′=int(Wb′)ϕ~(Fa′b′,1)=int(u.Idn)ϕ~(Fi,1), which indeed acts as the identity on SLn(D) because for all x∈E, uxu−1=F−i(x) (see Remark 6.21).
∎
Remark 6.35**.**
Note that if one is just interested in a section defined on Cb′ alone, one can take b=1 in Proposition 6.34. Hence, a section of Aut(G→SpecK)→AutG(K) only defined on Cb′ exists if and only if b′ divides n (i.e. the stronger assumption that bb′ divides n is there to ensure that we can glue fCb′ with fCb).
As before, we have a converse to Proposition 6.34.
Proposition 6.36**.**
Keep the notations of Proposition 6.34. If b′ does not divide n, there does not exist a homomorphism Cb′→Aut(G→SpecK) whose composition with Aut(G→SpecK)→AutG(K) is the identity on Cb′.
Proof.
By Theorem 6.13, it suffices to prove that there exists K′≤K such that K/K′ is finite Galois, Gal(K/K′)≤Cb′ and gcd(nd,[K:K′]) does not divide n. But K′=Fpa′((T)) is such a subfield.
∎
We can finally glue all the previous constructions to obtain a global splitting of the initial short exact sequence.
Theorem 6.37**.**
Keep the notations of Definition 6.20. Assume that for all subfields K′≤K such that K/K′ is finite Galois, gcd(nd,[K:K′]) divides n. Then the short exact sequence 1→AutG→Aut(G→SpecK)→AutG(K)→1 splits.
Proof.
In view of Proposition 6.38, the hypotheses imply that gcd(d,p)=1 and gcd(nd,i(pi−1)) divides n. Hence bb′ divides n and we can apply Propositions 6.22, 6.25, 6.28, 6.32 and 6.34. For the rest of the proof, we strictly adhere to the notations that are introduced in the statements of those propositions.
Recall that AutG(K)=Aut(K) (Corollary 6.10). Also recall that we decomposed Aut(K) as (J(K)⋊(Ca×Cb))⋊(Ca′×Cb′), where
(i)
Ca≤Fpi× is generated by ζb.
2. (ii)
Cb≤Fpi× is generated by ζa.
3. (iii)
Ca′≤Gal(K/Fp((T))) is generated by Fb′ restricted to K.
4. (iv)
Cb′≤Gal(K/Fp((T))) is generated by Fa′ restricted to K.
We define a map
[TABLE]
We claim that f is a homomorphism. To prove this claim, it suffices to compute various commutators in Aut(G→SpecK). To carry the computation, we pick j,j′∈N.
The images of fCa and fCb commute. Indeed, int(Zj)ϕ~(ev(ζbjT),zb′j) readily commutes with int(Yj′)ϕ~(ev(ζaj′T),(yFi(y))j′) (note that Y and Z are both b×b block diagonal matrices, and that the blocks defining Z are scalars).
2. 2.
Let α∈J(K). We compute fCa(ev(ζbjT))fJ(K)(α)fCa(ev(ζ−bjT)):
[TABLE]
where the last equality follows from the fact that Z and Xα commutes because they are block diagonal matrices, together with the equality α(Z−j)=Z−j which holds because Z has coefficients in Fpi.
But ev(ζbjT)(xα)=xev(ζbjT)∘α∘ev(ζ−bjT), because ev(ζbjT)(xα) belongs to 1+TFpi[[T]], and
The equality fCb(ev(ζajT))fJ(K)(α)fCb(ev(ζ−ajT))=fJ(K)(ev(ζajT)∘α∘ev(ζ−ajT)) is proved by doing a similar computation than in the previous item.
4. 4.
The images of fCa′ and fCb′ commute. Indeed, ϕ~(Fj(ci+b′),1) readily commutes with int(Wj′)ϕ~(Fa′j′,1) (recall that W has coefficients in {0,1,u}).
5. 5.
We check that fCa′(Fb′j)fCb(ev(ζaj′T))fCa′(F−b′j)=fCb(Fb′j∘ev(ζaj′T)∘F−b′j). We have
[TABLE]
Noting that Fj(ci+b′)∘ev(ζaj′T)∘F−j(ci+b′)=ev(Fj(ci+b′)(ζaj′)T), the desired equality follows from the fact that the Frobenius automorphism on Fpid is just elevating to the power p.
6. 6.
One readily check that fCa′(Fb′j)fCa(ev(ζbj′T))fCa′(F−b′j)=fCa(Fb′j∘ev(ζbj′T)∘F−b′j).
7. 7.
We have fCa′(Fb′j)fJ(K)(α)fCa′(F−b′j)=fJ(K)(Fb′j∘α∘F−b′j). Indeed, Fj(ci+b′)(xα) belongs to 1+TFpi[[T]], and Fj(ci+b′)(xα)b′d=Fj(ci+b′)(Trα(Tr))=TrFj(ci+b′)αF−j(ci+b′)(Tr) because F acts trivially on T. Hence
[TABLE]
as wanted.
8. 8.
We check that fCb′(Fa′j)fCb(ev(ζaj′T))fCb′(F−a′j)=fCb(Fa′j∘ev(ζaj′T)∘F−a′j). It is obviously enough to check this when j=j′=1. Then
[TABLE]
Again, since Fa′∘ev(ζaT)∘F−a′=ev(Fa′(ζa)T), it suffices to show that the matrix appearing in the argument of int() is equal to Fa′(Y). Since W is made up of bb′×bb′ block matrices, whilst Y is made up of b×b block matrices, we can work with one block at a time. Otherwise stated, we may assume that bb′=n. Now ϕ~(ev(ζaT),yFi(y))(W−1) is the matrix
[TABLE]
so that the matrix appearing in the argument of int() is the n×n block diagonal matrix Diag(uFa′(g(uyFi(y))−1),Fa′(g),…,Fa′(g)). But uFa′(g(uyFi(y))−1)=Fa′(ugFi(y)yu−1). Recalling the embedding φ:Fpidb→Mb(Fpid) of Proposition 6.28, we have
[TABLE]
We conclude that the argument of int() is indeed Diag(Fa′(g),Fa′(g),…,Fa′(g))=Fa′(Y), as wanted.
9. 9.
Let us check that fCb′(Fa′j)fCa(ev(ζbj′T))fCb′(F−a′j)=fCa(Fa′j∘ev(ζbj′T)∘F−a′j). It is obviously enough to check this when j=j′=1. Then
[TABLE]
Again, since Fa′∘ev(ζbT)∘F−a′=ev(Fa′(ζb)T), it suffices to show that the matrix appearing in the argument of int() is equal to Fa′(Z). As in the previous item, we can assume that bb′=n, and doing the same kind of computation as in the previous item, we find that the matrix in the argument of int() is Fa′(Diag(uz−1u−1Idb,Idb,zIdb,…,zb′−2Idb)). Since z∈Fpid, uz−1u−1=z−1, and we conclude that multiplication by the scalar matrix zIdn (which belongs to the center of GLn(D) because z∈Fpi), the argument appearing in int() is equal to Fa′(Z), as wanted.
10. 10.
Checking that fCb′(Fa′j)fJ(K)(α)fCb′(F−a′j)=fJ(K)(Fa′j∘α∘F−a′j) is a similar computation than in the previous item.
We conclude that f is indeed a homomorphism. The fact that f is a splitting of the short exact sequence in the statement of the proposition follows from the fact that the restriction of f to each component is locally a section of Aut(G→SpecK)→AutG(K).
∎
The first step in the proof of Theorem 6.37 is to translate the existence of Galois subfields of some degree into some divisibility relations between p,d,i and pi−1. We now prove the ad hoc proposition. We warn the reader that the notations of Definition 6.20 (and of the subsequent propositions) are not in use any more.
Proposition 6.38**.**
Let K=Fpi((T)), let q be a prime number and let a∈N. There exists a subfield K′ such that K/K′ is finite Galois and qa divides [K:K′] if and only if q=p or qa divides i(pi−1).
Proof.
First assume that such a K′ exists. Since K/K′ is Galois and qa divides [K:K′], there exists K~ such that K/K~ is Galois and [K:K~]=qa. Up to replacing K′ by K~, we can thus assume that [K:K′]=qa. Let also Kur′ be the maximal unramified extension of K′ inside K.
Note that K′ and Kur′ are local fields, so that in particular K′≅Fpj((T)) and Kur′≅Fpi((T)). Since [Kur′:K′] divides qa, there exists a1 such that qa1=ji. Letting a2=a−a1, we have that K/Kur′ is a totally ramified extension of degree qa2.
If p=q, the proposition is proved, hence there just remains to investigate the case p=q. In this case, K is a tamely totally ramified extension of Kur′. Thus, K is isomorphic to Kur′[X]/(Xqa2−π) for some uniformiser π∈Fpi((T)). But K is a Galois extension, and hence this implies that Fpi((T)) has a primitive qa2-th root of unity, so that qa2 divides pi−1, as wanted.
To prove the converse, we use a classical fact from local class field theory: there exists an extension Kπ of K which is Galois and totally ramified, and such that Gal(Kπ/K) is isomorphic to the group of invertible elements Fpi[[T]]× of Fpi[[T]] (see for example [Iwa86]*Section 5.3). Note that the degree of Fpi×+Ta+1Fpi[[T]] in Fpi[[T]]× is equal to pa. Let L1 be the Galois extension of K corresponding to Fpi×+Ta+1Fpi[[T]]. Let also L2 be the splitting field of Xpi−1−T over Fp((T)). For j=1 or 2, Lj is totally ramified of finite degree over K, so that there exists an isomorphism ϕj:K→Lj. Hence K1=ϕ1−1(K) (respectively K2=ϕ2−1(Fp((T)))) is such that K/K1 (respectively K/K2) is Galois, and [K:K1]=pa (respectively [K:K2]=i(pi−1)), which concludes the proof.
∎
Appendix A Base change of the algebraic group SLn(D)
We begin by recalling some classical facts about finite dimensional central simple algebras over local fields.
Theorem A.1**.**
Let K be a local field. Every central simple algebra over K is isomorphic to an algebra of the form A(d,r) as in Definition 6.4. Furthermore, the map inv:Br(K)→Q/Z:[A(d,r)]↦[dr] is an isomorphism of groups.
Proof.
See for example [Mor97]*Theorem 8 for the first assertion, while the second is precisely the content of [Pie82]*Chapter 17, §10, Theorem.∎
Corollary A.2**.**
Let K be a local field and let d,r∈N with d≥1. Let a=gcd(d,r). Then A(d,r) is a division algebra if and only if a=1, and A(d,r)≅Ma(A(ad,ar)).
Proof.
The central simple algebra A(d,r) is a division algebra if and only if all central simple algebras over K in the same Brauer class have a higher degree. In view of Theorem A.1, it readily implies that A(d,r) is a division algebra if and only if a=1. Furthermore, by Wedderburn’s theorem, A(d,r) is isomorphic to Mn(D) for some division algebra D and some 1≤n∈N, and by definition of the Brauer group, [D]=[A(d,r)]. Hence, using the first part of the Theorem, D≅A(ad,ar). Now, comparing degrees readily imply that n=a, and the result is proved.
∎
We now study the base change of the algebraic group SLn(A).
Lemma A.3**.**
Let A be a central simple algebra over a field k, and let SL1(A) be the corresponding algebraic k-group (see Definition 6.1). For k′ a field extension of k, SL1(A)k′=SL1(A⊗kk′).
Proof.
Let k′ be an algebraic closure of k′. Since k′ splits A, the reduced norm is the map f:A→A⊗kk′≅Mn(k′)detk′. Let φ denotes the isomorphism A⊗kk′≅Mn(k′). If we take a k-basis of A to get coordinates on A⊗kk′, the map det∘φ is actually a polynomial map on A⊗kk′ with coefficients in k, by [Bourb73]*Chapitre VIII, §12, Proposition 11. Hence, fk′=det∘φ. This implies that fk′:A⊗kk′→k′ is just the composition A⊗kk′→A⊗kk′≅Mn(k′)detk′, i.e. fk′ is the reduced norm map of the algebra A⊗kk′, as wanted.
∎
Before giving the formula for the base change of SLn(A), we recall the effect of extending scalars for central simple algebras over local fields.
Lemma A.4**.**
Let K be a local field and let A(d,r) be the central simple algebra over K defined in Definition 6.4. Let L be a finite extension of K. Then A(d,r)⊗KL≅A(d,r[L:K]).
Proof.
By Wedderburn’s theorem, a central simple algebra over a field is uniquely determined by its degree and its Brauer class. By [Pie82]*Chapter 17, Section 17.10, Proposition, we have inv([A(d,r)⊗KL])=[L:K].inv([A(d,r)]. Hence A(d,r[L:K]) and A(d,r)⊗KL are in the same Brauer class. Since they have the same degree as well, this concludes the proof.
∎
Proposition A.5**.**
Let A(d′,r′) be a division algebra over a local field K′ as in Definition 6.4. Let K/K′ be a finite field extension and let a=gcd(d′,[K,K′]). Then the base change of SLn′(A(d′,r′)) to K is isomorphic to SLan′(A(ad′,a[K:K′]r′)).
Proof.
The base change of SLn′(A(d′,r′))=SL1(Mn′(A(d′,r′))) to K is isomorphic to the algebraic group SL1(Mn′(A(d′,r′))⊗K′K)≅SLn′(A(d′,r′)⊗K′K) by Lemma A.3. But by Corollary A.2 and Lemma A.4, A(d′,r′)⊗K′K≅Ma(A(ad′,a[K:K′]r′)). To conclude, note that for any central simple algebra A, SLn′(Ma(A))≅SLan′(A).
∎