DOCSLIB.ORG

Linear Algebraic Groups I (Stanford, Winter 2010)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Linear Algebraic Groups I (Stanford, Winter 2010) Linear Algebraic Groups I (Stanford, Winter 2010) notes typed by Sam Lichtenstein, lectures and editing by Brian Conrad February 8, 2020 Please send any errata (typos, math errors, etc.) to [email protected]. The sequel course \Linear Algebraic Groups II" treats the Borel-Tits structure theory of reductive groups over general fields (assuming knowledge of schemes, as in this course). Contents 1 January 4 4 1.1 Some Definitions . 4 1.2 Smoothness . 5 1.3 Connectedness . 5 1.4 Examples . 6 2 January 6 7 2.1 Translations . 7 2.2 Homomorphisms . 7 2.3 Normal subgroups . 8 2.4 Further discussion of examples . 8 2.5 How far is a general smooth connected algebraic group from being either affine (i.e. linear algebraic) or projective (i.e. an abelian variety)? . 9 3 January 8 10 3.1 How do linear algebraic groups arise in nature? . 10 3.2 Zariski closures of subgroups . 10 4 January 11 (Substitute lecture by A. Venkatesh) 12 4.1 Tori . 12 4.2 Maximal split tori . 12 4.3 Building up groups from tori . 13 4.3.1 Construction of Φ ...................................... 14 5 January 13 14 5.1 Mapping Ga and Gm into a reductive group . 14 5.2 Classification of 1-dimensional connected linear algebraic groups . 15 5.3 Examples of non-split 1-dimensional linear algebraic k-groups . 15 5.4 Start of proof of the classification theorem . 16 6 January 20 (Substitute lecture by A. Venkatesh) 16 6.1 End of proof of classification of 1-dimensional connected linear algebraic groups . 16 6.2 Smoothness criteria . 17 1 7 January 22 18 7.1 More on forms . 18 7.2 A loose end concerning smoothness . 19 7.3 How to apply Grothendieck's smoothness criterion . 20 7.4 How to show algebraic k-groups are smooth . 20 7.4.1 Smoothness of GLn; SLn in coordinates, via matrices . 20 7.4.2 Smoothness of GL(V); SL(V) without using coordinates (much) . 21 8 January 25 21 8.1 How to Show Connectedness . 21 8.2 Connectedness of SLn ........................................ 22 8.2.1 Method 1 - Flag varieties . 22 8.2.2 Method 2 - Projective Space . 22 8.3 Smoothness of Sp2n ......................................... 22 9 January 29 25 9.1 A little more about Sp2n ...................................... 25 9.2 Actions, Centralizers and Normalizers . 26 9.3 Closed orbit lemma . 26 9.4 Start of proof of closed orbit lemma (Theorem 9.3.5) . 27 10 February 1 28 10.1 Conclusion of proof of closed orbit lemma (Theorem 9.3.5) . 28 10.2 Criterion for a k-homomorphism of k-groups to be a closed immersion . 29 11 February 3 29 11.1 Proof of Proposition 10.2.1 . 29 11.2 Embedding linear algebraic groups in GLn ............................. 31 12 February 5 31 12.1 Actions of affine finite type k-groups on coordinate rings of affine k-schemes . 31 12.1.1 Application to embedding a smooth linear algebraic group into GLn . 31 12.2 Proof of Theorem 12.1.1 . 32 13 February 8 33 13.1 Jordan decomposition . 33 14 February 10 35 14.1 All subgroups of a smooth finite type k-group are stabilizers of a line . 35 15 February 12 36 15.1 Unipotent groups . 36 15.2 Proof of Theorem 15.1.8 on representations of unipotent groups . 37 15.3 Remaining ingredients necessary for structure theory . 38 16 February 17 38 16.1 Some motivation: a key calculation on SL2(k) ........................... 38 16.2 Subgroups generated by connected varieties . 39 16.3 Proof of Proposition 16.2.1 . 40 16.4 Improvements on Proposition 16.2.1 . 41 17 February 19 41 17.1 Conclusion of proof of Proposition 16.4.2 . 41 17.2 Solvable groups . 42 17.3 Structure of smooth connected commutative affine k-groups . 42 17.4 Coset spaces for closed subgroups (that is, quotients) . 43 2 18 February 22 45 18.1 Existence of quotients (of smooth affine groups) . 45 18.2 Lie algebras . 46 18.2.1 Functoriality of Lie(·) .................................... 47 19 February 24 47 19.1 Linear representations of split tori, over general rings . 47 19.2 Proof of Theorem 19.1.2 . 49 20 February 26 50 20.1 k-split solvable groups . 50 20.2 Borel Fixed Point Theorem . 52 21 March 1 52 21.1 Remark on quotients . 52 21.2 Lie-Kolchin Corollary 20.2.4 . 53 21.3 Structure theory of solvable groups . 53 21.4 Unipotent radical . 54 21.5 Reductive groups . 55 22 March 3 56 22.1 Borel subgroups . 56 23 March 5 58 23.1 Properties of parabolics . 58 23.2 Conjugacy of maximal tori . 59 24 March 8 60 24.1 Proof of Proposition 23.2.1 . 60 24.2 Cartan subgroups . 61 24.3 PG(λ);UG(λ);ZG(λ) for a 1-parameter subgroup λ ........................ 61 25 March 10 62 25.1 Proof of Lemma 24.3.3 on PG;UG;ZG ............................... 62 25.1.1 Proof that (i)+(ii) (iii) [except unipotence of UG(λ)].................. 62 25.1.2 Proof of (i) . 62 25.1.3 Proof of (ii) and unipotence) of UG(λ) ........................... 63 26 March 12 64 26.1 Classification of split reductive groups of rank 1 . 64 A Properties of Orthogonal Groups 67 A.1 Basic definitions . 67 A.2 Even rank . 69 A.3 Odd rank . 72 A.4 Center . 75 A.5 Accidental isomorphisms . 76 B Existence of Jordan decomposition 78 B.1 Variants in linear algebra over arbitrary fields . 78 C Affine quotients 79 C.1 Introduction . 79 C.2 Line stabilizers . 80 3 D Quotient formalism 80 D.1 Coset spaces and isomorphism theorems . 81 D.2 Classifying some extension structures . 84 D.3 Structure of split solvable groups . 86 E Grothendieck's theorem on tori 88 E.1 Introduction . 88 E.2 Start of proof of Theorem E.1.1 . 89 E.3 The case of infinite k ......................................... 91 E.4 Hypothesis (?) for G implies the existence of a nontrivial k-torus.
Load more

Recommended publications
  • Group Homomorphisms
    1-17-2018 Group Homomorphisms Here are the operation tables for two groups of order 4: · 1 a a2 + 0 1 2 1 1 a a2 0 0 1 2 a a a2 1 1 1 2 0 a2 a2 1 a 2 2 0 1 There is an obvious sense in which these two groups are “the same”: You can get the second table from the first by replacing 0 with 1, 1 with a, and 2 with a2. When are two groups the same? You might think of saying that two groups are the same if you can get one group’s table from the other by substitution, as above. However, there are problems with this. In the first place, it might be very difficult to check — imagine having to write down a multiplication table for a group of order 256! In the second place, it’s not clear what a “multiplication table” is if a group is infinite. One way to implement a substitution is to use a function. In a sense, a function is a thing which “substitutes” its output for its input. I’ll define what it means for two groups to be “the same” by using certain kinds of functions between groups. These functions are called group homomorphisms; a special kind of homomorphism, called an isomorphism, will be used to define “sameness” for groups. Definition. Let G and H be groups. A homomorphism from G to H is a function f : G → H such that f(x · y)= f(x) · f(y) forall x,y ∈ G.
    [Show full text]
  • The Fundamental Group
    The Fundamental Group Tyrone Cutler July 9, 2020 Contents 1 Where do Homotopy Groups Come From? 1 2 The Fundamental Group 3 3 Methods of Computation 8 3.1 Covering Spaces . 8 3.2 The Seifert-van Kampen Theorem . 10 1 Where do Homotopy Groups Come From? 0 Working in the based category T op∗, a `point' of a space X is a map S ! X. Unfortunately, 0 the set T op∗(S ;X) of points of X determines no topological information about the space. The same is true in the homotopy category. The set of `points' of X in this case is the set 0 π0X = [S ;X] = [∗;X]0 (1.1) of its path components. As expected, this pointed set is a very coarse invariant of the pointed homotopy type of X. How might we squeeze out some more useful information from it? 0 One approach is to back up a step and return to the set T op∗(S ;X) before quotienting out the homotopy relation. As we saw in the first lecture, there is extra information in this set in the form of track homotopies which is discarded upon passage to [S0;X]. Recall our slogan: it matters not only that a map is null homotopic, but also the manner in which it becomes so. So, taking a cue from algebraic geometry, let us try to understand the automorphism group of the zero map S0 ! ∗ ! X with regards to this extra structure. If we vary the basepoint of X across all its points, maybe it could be possible to detect information not visible on the level of π0.
    [Show full text]
  • Math 5111 (Algebra 1) Lecture #14 of 24 ∼ October 19Th, 2020
    Math 5111 (Algebra 1) Lecture #14 of 24 ∼ October 19th, 2020 Group Isomorphism Theorems + Group Actions The Isomorphism Theorems for Groups Group Actions Polynomial Invariants and An This material represents x3.2.3-3.3.2 from the course notes. Quotients and Homomorphisms, I Like with rings, we also have various natural connections between normal subgroups and group homomorphisms. To begin, observe that if ' : G ! H is a group homomorphism, then ker ' is a normal subgroup of G. In fact, I proved this fact earlier when I introduced the kernel, but let me remark again: if g 2 ker ', then for any a 2 G, then '(aga−1) = '(a)'(g)'(a−1) = '(a)'(a−1) = e. Thus, aga−1 2 ker ' as well, and so by our equivalent properties of normality, this means ker ' is a normal subgroup. Thus, we can use homomorphisms to construct new normal subgroups. Quotients and Homomorphisms, II Equally importantly, we can also do the reverse: we can use normal subgroups to construct homomorphisms. The key observation in this direction is that the map ' : G ! G=N associating a group element to its residue class / left coset (i.e., with '(a) = a) is a ring homomorphism. Indeed, the homomorphism property is precisely what we arranged for the left cosets of N to satisfy: '(a · b) = a · b = a · b = '(a) · '(b). Furthermore, the kernel of this map ' is, by definition, the set of elements in G with '(g) = e, which is to say, the set of elements g 2 N. Thus, kernels of homomorphisms and normal subgroups are precisely the same things.
    [Show full text]
  • Classification of Finite Abelian Groups
    Math 317 C1 John Sullivan Spring 2003 Classification of Finite Abelian Groups (Notes based on an article by Navarro in the Amer. Math. Monthly, February 2003.) The fundamental theorem of finite abelian groups expresses any such group as a product of cyclic groups: Theorem. Suppose G is a finite abelian group. Then G is (in a unique way) a direct product of cyclic groups of order pk with p prime. Our first step will be a special case of Cauchy’s Theorem, which we will prove later for arbitrary groups: whenever p |G| then G has an element of order p. Theorem (Cauchy). If G is a finite group, and p |G| is a prime, then G has an element of order p (or, equivalently, a subgroup of order p). ∼ Proof when G is abelian. First note that if |G| is prime, then G = Zp and we are done. In general, we work by induction. If G has no nontrivial proper subgroups, it must be a prime cyclic group, the case we’ve already handled. So we can suppose there is a nontrivial subgroup H smaller than G. Either p |H| or p |G/H|. In the first case, by induction, H has an element of order p which is also order p in G so we’re done. In the second case, if ∼ g + H has order p in G/H then |g + H| |g|, so hgi = Zkp for some k, and then kg ∈ G has order p. Note that we write our abelian groups additively. Definition. Given a prime p, a p-group is a group in which every element has order pk for some k.
    [Show full text]
  • Categories of Sets with a Group Action
    Categories of sets with a group action Bachelor Thesis of Joris Weimar under supervision of Professor S.J. Edixhoven Mathematisch Instituut, Universiteit Leiden Leiden, 13 June 2008 Contents 1 Introduction 1 1.1 Abstract . .1 1.2 Working method . .1 1.2.1 Notation . .1 2 Categories 3 2.1 Basics . .3 2.1.1 Functors . .4 2.1.2 Natural transformations . .5 2.2 Categorical constructions . .6 2.2.1 Products and coproducts . .6 2.2.2 Fibered products and fibered coproducts . .9 3 An equivalence of categories 13 3.1 G-sets . 13 3.2 Covering spaces . 15 3.2.1 The fundamental group . 15 3.2.2 Covering spaces and the homotopy lifting property . 16 3.2.3 Induced homomorphisms . 18 3.2.4 Classifying covering spaces through the fundamental group . 19 3.3 The equivalence . 24 3.3.1 The functors . 25 4 Applications and examples 31 4.1 Automorphisms and recovering the fundamental group . 31 4.2 The Seifert-van Kampen theorem . 32 4.2.1 The categories C1, C2, and πP -Set ................... 33 4.2.2 The functors . 34 4.2.3 Example . 36 Bibliography 38 Index 40 iii 1 Introduction 1.1 Abstract In the 40s, Mac Lane and Eilenberg introduced categories. Although by some referred to as abstract nonsense, the idea of categories allows one to talk about mathematical objects and their relationions in a general setting. Its origins lie in the field of algebraic topology, one of the topics that will be explored in this thesis. First, a concise introduction to categories will be given.
    [Show full text]
  • Mathematics 310 Examination 1 Answers 1. (10 Points) Let G Be A
    Mathematics 310 Examination 1 Answers 1. (10 points) Let G be a group, and let x be an element of G. Finish the following definition: The order of x is ... Answer: . the smallest positive integer n so that xn = e. 2. (10 points) State Lagrange’s Theorem. Answer: If G is a finite group, and H is a subgroup of G, then o(H)|o(G). 3. (10 points) Let ( a 0! ) H = : a, b ∈ Z, ab 6= 0 . 0 b Is H a group with the binary operation of matrix multiplication? Be sure to explain your answer fully. 2 0! 1/2 0 ! Answer: This is not a group. The inverse of the matrix is , which is not 0 2 0 1/2 in H. 4. (20 points) Suppose that G1 and G2 are groups, and φ : G1 → G2 is a homomorphism. (a) Recall that we defined φ(G1) = {φ(g1): g1 ∈ G1}. Show that φ(G1) is a subgroup of G2. −1 (b) Suppose that H2 is a subgroup of G2. Recall that we defined φ (H2) = {g1 ∈ G1 : −1 φ(g1) ∈ H2}. Prove that φ (H2) is a subgroup of G1. Answer:(a) Pick x, y ∈ φ(G1). Then we can write x = φ(a) and y = φ(b), with a, b ∈ G1. Because G1 is closed under the group operation, we know that ab ∈ G1. Because φ is a homomorphism, we know that xy = φ(a)φ(b) = φ(ab), and therefore xy ∈ φ(G1). That shows that φ(G1) is closed under the group operation.
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • THE UPPER BOUND of COMPOSITION SERIES 1. Introduction. a Composition Series, That Is a Series of Subgroups Each Normal in the Pr
    THE UPPER BOUND OF COMPOSITION SERIES ABHIJIT BHATTACHARJEE Abstract. In this paper we prove that among all finite groups of or- α1 α2 αr der n2 N with n ≥ 2 where n = p1 p2 :::pr , the abelian group with elementary abelian sylow subgroups, has the highest number of composi- j Pr α ! Qr Qαi pi −1 ( i=1 i) tion series and it has i=1 j=1 Qr distinct composition pi−1 i=1 αi! series. We also prove that among all finite groups of order ≤ n, n 2 N α with n ≥ 4, the elementary abelian group of order 2 where α = [log2 n] has the highest number of composition series. 1. Introduction. A composition series, that is a series of subgroups each normal in the previous such that corresponding factor groups are simple. Any finite group has a composition series. The famous Jordan-Holder theo- rem proves that, the composition factors in a composition series are unique up to isomorphism. Sometimes a group of small order has a huge number of distinct composition series. For example an elementary abelian group of order 64 has 615195 distinct composition series. In [6] there is an algo- rithm in GAP to find the distinct composition series of any group of finite order.The aim of this paper is to provide an upper bound of the number of distinct composition series of any group of finite order. The approach of this is combinatorial and the method is elementary. All the groups considered in this paper are of finite order. 2. Some Basic Results On Composition Series.
    [Show full text]
  • The Tate–Oort Group Scheme Top
    The Tate{Oort group scheme TOp Miles Reid In memory of Igor Rostislavovich Shafarevich, from whom we have all learned so much Abstract Over an algebraically closed field of characteristic p, there are 3 group schemes of order p, namely the ordinary cyclic group Z=p, the multiplicative group µp ⊂ Gm and the additive group αp ⊂ Ga. The Tate{Oort group scheme TOp of [TO] puts these into one happy fam- ily, together with the cyclic group of order p in characteristic zero. This paper studies a simplified form of TOp, focusing on its repre- sentation theory and basic applications in geometry. A final section describes more substantial applications to varieties having p-torsion in Picτ , notably the 5-torsion Godeaux surfaces and Calabi{Yau 3-folds obtained from TO5-invariant quintics. Contents 1 Introduction 2 1.1 Background . 3 1.2 Philosophical principle . 4 2 Hybrid additive-multiplicative group 5 2.1 The algebraic group G ...................... 5 2.2 The given representation (B⊕2)_ of G .............. 6 d ⊕2 _ 2.3 Symmetric power Ud = Sym ((B ) ).............. 6 1 3 Construction of TOp 9 3.1 Group TOp in characteristic p .................. 9 3.2 Group TOp in mixed characteristic . 10 3.3 Representation theory of TOp . 12 _ 4 The Cartier dual (TOp) 12 4.1 Cartier duality . 12 4.2 Notation . 14 4.3 The algebra structure β : A_ ⊗ A_ ! A_ . 14 4.4 The Hopf algebra structure δ : A_ ! A_ ⊗ A_ . 16 5 Geometric applications 19 5.1 Background . 20 2 5.2 Plane cubics C3 ⊂ P with free TO3 action .
    [Show full text]
  • The Fundamental Groupoid of the Quotient of a Hausdorff
    The fundamental groupoid of the quotient of a Hausdorff space by a discontinuous action of a discrete group is the orbit groupoid of the induced action Ronald Brown,∗ Philip J. Higgins,† Mathematics Division, Department of Mathematical Sciences, School of Informatics, Science Laboratories, University of Wales, Bangor South Rd., Gwynedd LL57 1UT, U.K. Durham, DH1 3LE, U.K. October 23, 2018 University of Wales, Bangor, Maths Preprint 02.25 Abstract The main result is that the fundamental groupoidof the orbit space of a discontinuousaction of a discrete groupon a Hausdorffspace which admits a universal coveris the orbit groupoid of the fundamental groupoid of the space. We also describe work of Higgins and of Taylor which makes this result usable for calculations. As an example, we compute the fundamental group of the symmetric square of a space. The main result, which is related to work of Armstrong, is due to Brown and Higgins in 1985 and was published in sections 9 and 10 of Chapter 9 of the first author’s book on Topology [3]. This is a somewhat edited, and in one point (on normal closures) corrected, version of those sections. Since the book is out of print, and the result seems not well known, we now advertise it here. It is hoped that this account will also allow wider views of these results, for example in topos theory and descent theory. Because of its provenance, this should be read as a graduate text rather than an article. The Exercises should be regarded as further propositions for which we leave the proofs to the reader.
    [Show full text]
  • Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 2, February 1986 NORMAL SUBGROUPS OF THE GENERAL LINEAR GROUPS OVER VON NEUMANN REGULAR RINGS L. N. VASERSTEIN1 ABSTRACT. Let A be a von Neumann regular ring or, more generally, let A be an associative ring with 1 whose reduction modulo its Jacobson radical is von Neumann regular. We obtain a complete description of all subgroups of GLn A, n > 3, which are normalized by elementary matrices. 1. Introduction. For any associative ring A with 1 and any natural number n, let GLn A be the group of invertible n by n matrices over A and EnA the subgroup generated by all elementary matrices x1'3, where 1 < i / j < n and x E A. In this paper we describe all subgroups of GLn A normalized by EnA for any von Neumann regular A, provided n > 3. Our description is standard (see Bass [1] and Vaserstein [14, 16]): a subgroup H of GL„ A is normalized by EnA if and only if H is of level B for an ideal B of A, i.e. E„(A, B) C H C Gn(A, B). Here Gn(A, B) is the inverse image of the center of GL„(,4/S) (when n > 2, this center consists of scalar invertible matrices over the center of the ring A/B) under the canonical homomorphism GL„ A —►GLn(A/B) and En(A, B) is the normal subgroup of EnA generated by all elementary matrices in Gn(A, B) (when n > 3, the group En(A, B) is generated by matrices of the form (—y)J'lx1'Jy:i''1 with x € B,y £ A,l < i ^ j < n, see [14]).
    [Show full text]
  • Symmetries on the Lattice
    Symmetries On The Lattice K.Demmouche January 8, 2006 Contents Background, character theory of finite groups The cubic group on the lattice Oh Representation of Oh on Wilson loops Double group 2O and spinor Construction of operator on the lattice MOTIVATION Spectrum of non-Abelian lattice gauge theories ? Create gauge invariant spin j states on the lattice Irreducible operators Monte Carlo calculations Extract masses from time slice correlations Character theory of point groups Groups, Axioms A set G = {a, b, c, . } A1 : Multiplication ◦ : G × G → G. A2 : Associativity a, b, c ∈ G ,(a ◦ b) ◦ c = a ◦ (b ◦ c). A3 : Identity e ∈ G , a ◦ e = e ◦ a = a for all a ∈ G. −1 −1 −1 A4 : Inverse, a ∈ G there exists a ∈ G , a ◦ a = a ◦ a = e. Groups with finite number of elements → the order of the group G : nG. The point group C3v The point group C3v (Symmetry group of molecule NH3) c ¡¡AA ¡ A ¡ A Z ¡ A Z¡ A Z O ¡ Z A ¡ Z A ¡ Z A Z ¡ Z A ¡ ZA a¡ ZA b G = {Ra(π),Rb(π),Rc(π),E(2π),R~n(2π/3),R~n(−2π/3)} noted G = {A, B, C, E, D, F } respectively. Structure of Groups Subgroups: Definition A subset H of a group G that is itself a group with the same multiplication operation as G is called a subgroup of G. Example: a subgroup of C3v is the subset E, D, F Classes: Definition An element g0 of a group G is said to be ”conjugate” to another element g of G if there exists an element h of G such that g0 = hgh−1 Example: on can check that B = DCD−1 Conjugacy Class Definition A class of a group G is a set of mutually conjugate elements of G.
    [Show full text]