DOCSLIB.ORG

Degree of a Field Extension

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Degree of a Field Extension Degree of a field extension From Wikipedia, the free encyclopedia Contents 1 Abstract algebra 1 1.1 History ................................................. 1 1.1.1 Early group theory ...................................... 1 1.1.2 Modern algebra ........................................ 3 1.2 Basic concepts ............................................. 4 1.3 Applications .............................................. 4 1.4 See also ................................................ 5 1.5 References ............................................... 5 1.6 Sources ................................................ 5 1.7 External links ............................................. 5 2 Adjunction (field theory) 6 2.1 Definition ............................................... 6 2.2 Notes ................................................. 6 2.3 Examples ............................................... 6 2.4 Properties ............................................... 6 2.5 References ............................................... 7 3 Algebraic element 8 3.1 Examples ............................................... 8 3.2 Properties ............................................... 8 3.3 See also ................................................ 8 3.4 References ............................................... 9 4 Algebraic extension 10 4.1 Properties ............................................... 10 4.2 Generalizations ............................................ 11 4.3 See also ................................................ 11 4.4 Notes ................................................. 11 4.5 References ............................................... 11 5 Algebraic structure 12 5.1 Introduction .............................................. 12 5.2 Examples ............................................... 12 i ii CONTENTS 5.2.1 One set with operations .................................... 12 5.2.2 Two sets with operations ................................... 14 5.3 Hybrid structures ........................................... 15 5.4 Universal algebra ........................................... 15 5.5 Category theory ............................................ 16 5.6 See also ................................................ 16 5.7 References ............................................... 16 5.8 External links ............................................. 17 6 Arity 18 6.1 Examples ............................................... 18 6.1.1 Nullary ............................................ 18 6.1.2 Unary ............................................. 19 6.1.3 Binary ............................................. 19 6.1.4 Ternary ............................................ 19 6.1.5 n-ary ............................................. 19 6.1.6 Variable arity ......................................... 19 6.2 Other names .............................................. 19 6.3 See also ................................................ 20 6.4 References ............................................... 20 6.5 External links ............................................. 21 7 Closure (mathematics) 22 7.1 Basic properties ............................................ 22 7.2 Closed sets ............................................... 22 7.3 P closures of binary relations ..................................... 23 7.4 Closure operator ............................................ 23 7.5 Examples ............................................... 24 7.6 See also ................................................ 24 7.7 Notes ................................................. 24 7.8 References ............................................... 25 8 Degree of a field extension 26 8.1 Definition and notation ........................................ 26 8.2 The multiplicativity formula for degrees ............................... 26 8.2.1 Proof of the multiplicativity formula in the finite case .................... 27 8.2.2 Proof of the formula in the infinite case ........................... 27 8.3 Examples ............................................... 28 8.4 Generalization ............................................ 28 8.5 References .............................................. 28 9 Field (mathematics) 29 9.1 Definition and illustration ....................................... 29 CONTENTS iii 9.1.1 First example: rational numbers ............................... 30 9.1.2 Second example: a field with four elements .......................... 31 9.1.3 Alternative axiomatizations .................................. 31 9.2 Related algebraic structures ...................................... 31 9.2.1 Remarks ........................................... 31 9.3 History ................................................. 32 9.4 Examples ............................................... 32 9.4.1 Rationals and algebraic numbers ............................... 32 9.4.2 Reals, complex numbers, and p-adic numbers ........................ 32 9.4.3 Constructible numbers .................................... 33 9.4.4 Finite fields .......................................... 33 9.4.5 Archimedean fields ...................................... 34 9.4.6 Field of functions ....................................... 34 9.4.7 Local and global fields .................................... 34 9.5 Some first theorems .......................................... 34 9.6 Constructing fields ........................................... 35 9.6.1 Closure operations ...................................... 35 9.6.2 Subfields and field extensions ................................. 35 9.6.3 Rings vs fields ......................................... 36 9.6.4 Ultraproducts ......................................... 36 9.7 Galois theory ............................................. 36 9.8 Generalizations ............................................ 37 9.8.1 Exponentiation ........................................ 37 9.9 Applications .............................................. 37 9.10 See also ................................................ 37 9.11 Notes ................................................. 38 9.12 References ............................................... 38 9.13 Sources ................................................ 38 9.14 External links ............................................. 39 10 Field extension 40 10.1 Definitions .............................................. 40 10.2 Caveats ................................................ 40 10.3 Examples ............................................... 41 10.4 Elementary properties ......................................... 41 10.5 Algebraic and transcendental elements and extensions ........................ 41 10.6 Normal, separable and Galois extensions ............................... 42 10.7 Generalizations ............................................ 43 10.8 Extension of scalars .......................................... 43 10.9 See also ................................................ 43 10.10Notes ................................................. 43 10.11References ............................................... 43 iv CONTENTS 10.12External links ............................................. 43 11 Function (mathematics) 44 11.1 Introduction and examples ....................................... 46 11.2 Definition ............................................... 47 11.3 Notation ................................................ 48 11.4 Specifying a function ......................................... 49 11.4.1 Graph ............................................. 49 11.4.2 Formulas and algorithms ................................... 49 11.4.3 Computability ......................................... 50 11.5 Basic properties ............................................ 50 11.5.1 Image and preimage ...................................... 50 11.5.2 Injective and surjective functions ............................... 51 11.5.3 Function composition ..................................... 51 11.5.4 Identity function ....................................... 53 11.5.5 Restrictions and extensions .................................. 53 11.5.6 Inverse function ........................................ 53 11.6 Types of functions ........................................... 53 11.6.1 Real-valued functions ..................................... 54 11.6.2 Further types of functions ................................... 54 11.7 Function spaces ............................................ 54 11.7.1 Currying ........................................... 55 11.8 Variants and generalizations ...................................... 55 11.8.1 Alternative definition of a function .............................. 55 11.8.2 Partial and multi-valued functions .............................. 55 11.8.3 Functions with multiple inputs and outputs .......................... 56 11.8.4 Functors ............................................ 57 11.9 History ................................................. 57 11.10See also ................................................ 57 11.11Notes ................................................. 57 11.12References ............................................... 58 11.13Further reading ............................................ 58 11.14External links ............................................. 59 12 Galois theory 60 12.1 Application to classical problems ................................... 60 12.2 History ................................................ 60 12.2.1 Pre-history .......................................... 60 12.2.2 Galois’ writings ........................................ 62 12.2.3 Aftermath .........................................
Load more

Recommended publications
  • AN INTRODUCTION to P-ADIC HODGE THEORY Contents
    AN INTRODUCTION TO p-ADIC HODGE THEORY DENIS BENOIS Abstract. These notes provide an introduction to p-adic Hodge theory. They are based on the series of lectures given by the author at the International Center of Theoretical Sciences of Tata Institute in 2019. Contents Introduction 3 1. Local fields. Preliminaries 4 1.1. Non-archimedean fields 4 1.2. Local fields 6 1.3. Ramification filtration 10 1.4. Norms and traces 13 1.5. Witt vectors 14 1.6. Non-abelian cohomology 19 2. Galois groups of local fields 21 2.1. Unramified and tamely ramified extensions 21 2.2. Local class field theory 22 2.3. The absolute Galois group of a local field 22 3. Zp-extensions 24 3.1. The different in Zp-extensions 24 3.2. The normalized trace 27 3.3. Application to continuous cohomology 29 4. Deeply ramified extensions 30 4.1. Deeply ramified extensions 30 4.2. Almost etale´ extensions 34 4.3. Continuous cohomology of GK 36 5. From characteristic 0 to characteristic p and vice versa I: perfectoid fields 38 5.1. Perfectoid fields 38 5.2. Tilting 38 5.3. The ring Ainf(E) 40 5.4. The tilting equivalence 42 6. From characteristic 0 to characteristic p and vice versa II: the field of norms 46 2010 Mathematics Subject Classification. 11F85, 11S15, 11S31, 11G20. Key words and phrases. local field, ramification groups, p-adic representation. 1 2 DENIS BENOIS 6.1. Arithmetically profinite extensions 46 6.2. The field of norms 48 6.3. Functorial properties 52 6.4.
    [Show full text]
  • Grothendieck-Type Inequalities in Combinatorial Optimization
    GROTHENDIECK-TYPE INEQUALITIES IN COMBINATORIAL OPTIMIZATION SUBHASH KHOT AND ASSAF NAOR Abstract. We survey connections of the Grothendieck inequality and its variants to com- binatorial optimization and computational complexity. Contents 1. Introduction 2 1.1. Assumptions from computational complexity 3 1.2. Convex and semidefinite programming 4 2. Applications of the classical Grothendieck inequality 5 2.1. Cut norm estimation 5 2.1.1. Szemer´edipartitions 8 2.1.2. Frieze-Kannan matrix decomposition 10 2.1.3. Maximum acyclic subgraph 11 2.1.4. Linear equations modulo 2 14 2.2. Rounding 16 3. The Grothendieck constant of a graph 18 3.1. Algorithmic consequences 20 3.1.1. Spin glasses 20 3.1.2. Correlation clustering 20 arXiv:1108.2464v1 [cs.DS] 11 Aug 2011 4. Kernel clustering and the propeller conjecture 21 5. The Lp Grothendieck problem 25 6. Higher rank Grothendieck inequalities 28 7. Hardness of approximation 29 References 31 S. K. was partially supported by NSF CAREER grant CCF-0833228, NSF Expeditions grant CCF- 0832795, an NSF Waterman award, and BSF grant 2008059. A. N. was partially supported by NSF Expe- ditions grant CCF-0832795, BSF grant 2006009, and the Packard Foundation. 1 1. Introduction The Grothendieck inequality asserts that there exists a universal constant K 2 (0; 1) such that for every m; n 2 N and every m × n matrix A = (aij) with real entries we have ( m n ) X X m n n+m−1 max aijhxi; yji : fxigi=1; fyjgj=1 ⊆ S i=1 j=1 ( m n ) X X m n 6 K max aij"iδj : f"igi=1; fδjgj=1 ⊆ {−1; 1g : (1) i=1 j=1 k Pk Here, and in what follows, the standard scalar product on R is denoted hx; yi = i=1 xiyi k k−1 k Pk 2 and the Euclidean sphere in R is denoted S = fx 2 R : i=1 xi = 1g.
    [Show full text]
  • An Exploration on the Hamiltonicity of Cayley Digraphs
    AN EXPLORATION ON THE HAMILTONICITY OF CAYLEY DIGRAPHS by Erica Bajo Calderon Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in the Mathematics Program YOUNGSTOWN STATE UNIVERSITY May, 2021 An Exploration on Hamiltonicity of Cayley Digraphs Erica Bajo Calderon I hereby release this thesis to the public. I understand that this thesis will be made available from the OhioLINK ETD Center and the Maag Library Circulation Desk for public access. I also authorize the University or other individuals to make copies of this thesis as needed for scholarly research. Signature: Erica Bajo Calderon, Student Date Approval: Dr. A. Byers, Thesis Advisor Date Dr. T. Madsen, Committee Member Date Dr. A. O’Mellan, Committee Member Date Dr. Salvatore A. Sanders, Dean of Graduate Studies Date ABSTRACT In 1969, Lászlo Lovász launched a conjecture that remains open to this day. Throughout the years, variations of the conjecture have surfaced; the version we used for this study is: “Every finite connected Cayley graph is Hamiltonian”. Several studies have determined and proved Hamiltonicity for the Cayley graphs of specific types of groups with a minimal generating set. However, there are few results on the Hamiltonicity of the directed Cayley graphs. In this thesis, we look at some of the cases for which the Hamiltonicity on Cayley digraphs has been determined and we prove that the Cayley digraph of group G such that G = Zp2 × Zq is non-Hamiltonian with a standard generating set. iii ACKNOWLEDGEMENTS First, I would like to thank Dr. Byers who has put a considerable amount of time and effort into helping me succeed as a graduate student at YSU even before she was my thesis advisor.
    [Show full text]
  • Grothendieck's Theorem, Past and Present
    Grothendieck’s Theorem, past and present by Gilles Pisier∗ Texas A&M University College Station, TX 77843, U. S. A. and Universit´eParis VI Equipe d’Analyse, Case 186, 75252 Paris Cedex 05, France January 26, 2011 Abstract Probably the most famous of Grothendieck’s contributions to Banach space theory is the result that he himself described as “the fundamental theorem in the metric theory of tensor products”. That is now commonly referred to as “Grothendieck’s theorem” (GT in short), or sometimes as “Grothendieck’s inequality”. This had a major impact first in Banach space theory (roughly after 1968), then, later on, in C∗-algebra theory, (roughly after 1978). More recently, in this millennium, a new version of GT has been successfully developed in the framework of “operator spaces” or non-commutative Banach spaces. In addition, GT independently surfaced in several quite unrelated fields: in connection with Bell’s inequality in quantum mechanics, in graph theory where the Grothendieck constant of a graph has been introduced and in computer science where the Grothendieck inequality is invoked to replace certain NP hard problems by others that can be treated by “semidefinite programming’ and hence solved in polynomial time. In this expository paper, we present a review of all these topics, starting from the original GT. We concentrate on the more recent developments and merely outline those of the first Banach space period since detailed accounts of that are already available, for instance the author’s 1986 CBMS notes. ∗Partially supported by NSF grant 0503688 Contents 1 Introduction 1 2 Classical GT 7 3 The Grothendieck constants 15 4 The Hahn-Banach argument 17 5 The “little” GT 20 6 Banach spaces satisfying GT and operator ideals 22 7 Non-commutative GT 23 8 Non-commutative “little GT” 25 9 Non-commutative Khintchine inequality 26 10 Maurey factorization 32 11 Best constants (Non-commutative case) 33 12 C∗-algebra tensor products, Nuclearity 35 13 Operator spaces, c.b.
    [Show full text]
  • Notes and Solutions to Exercises for Mac Lane's Categories for The
    Stefan Dawydiak Version 0.3 July 2, 2020 Notes and Exercises from Categories for the Working Mathematician Contents 0 Preface 2 1 Categories, Functors, and Natural Transformations 2 1.1 Functors . .2 1.2 Natural Transformations . .4 1.3 Monics, Epis, and Zeros . .5 2 Constructions on Categories 6 2.1 Products of Categories . .6 2.2 Functor categories . .6 2.2.1 The Interchange Law . .8 2.3 The Category of All Categories . .8 2.4 Comma Categories . 11 2.5 Graphs and Free Categories . 12 2.6 Quotient Categories . 13 3 Universals and Limits 13 3.1 Universal Arrows . 13 3.2 The Yoneda Lemma . 14 3.2.1 Proof of the Yoneda Lemma . 14 3.3 Coproducts and Colimits . 16 3.4 Products and Limits . 18 3.4.1 The p-adic integers . 20 3.5 Categories with Finite Products . 21 3.6 Groups in Categories . 22 4 Adjoints 23 4.1 Adjunctions . 23 4.2 Examples of Adjoints . 24 4.3 Reflective Subcategories . 28 4.4 Equivalence of Categories . 30 4.5 Adjoints for Preorders . 32 4.5.1 Examples of Galois Connections . 32 4.6 Cartesian Closed Categories . 33 5 Limits 33 5.1 Creation of Limits . 33 5.2 Limits by Products and Equalizers . 34 5.3 Preservation of Limits . 35 5.4 Adjoints on Limits . 35 5.5 Freyd's adjoint functor theorem . 36 1 6 Chapter 6 38 7 Chapter 7 38 8 Abelian Categories 38 8.1 Additive Categories . 38 8.2 Abelian Categories . 38 8.3 Diagram Lemmas . 39 9 Special Limits 41 9.1 Interchange of Limits .
    [Show full text]
  • Generalized Dedekind Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNALOFALGEBRA 17,310-316(1971) Generalized Dedekind Groups D. CAPPITT University of Kent at Canterbury Communicated by J. A. Green Received August 7, 1969 A group G is called a Dedekind group if every subgroup is normal. Equiv- alently, it may be defined as a group, G, in which the intersection of the non- normal subgroups is G, or one in which the subgroup they generate is trivial. In [l], Blackburn considered a generalization in terms of the first of these two definitions, namely to groups in which the intersection of non-normal subgroups is non-trivial. In this paper we take the second definition and determine some of the properties of groups in which the non-normal sub- groups generate a proper subgroup. For any group G, define S(G) to be the subgroup of G generated by all the subgroups which are not normal in G. G is a Dedekind group if and only if S(G) = 1. S(G) is a characteristic subgroup of G, and the quotient group of G by S(G) is a Dedekind group. THEOREM 1. If G is a group in which S(G) # G, then G can be expressed as a direct product H x K where H is a p-group for some prime p, S(H) # H, and K is a Dedekind group containing no element of order p. If, further, G is a non-abelian p-group, then the derived group G’ is cyclic and central, and either G has finite exponent or G has an infinite locally cyclic subgroup Z and the quotient group G/Z has finite exponent.
    [Show full text]
  • Semimodular Lattices Theory and Applications
    P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Semimodular Lattices Theory and Applications MANFRED STERN P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE The Pitt Building, Trumpington Street, Cambridge, United Kingdom CAMBRIDGE UNIVERSITY PRESS The Edinburgh Building, Cambridge CB2 2RU, UK http://www.cup.cam.ac.uk 40 West 20th Street, New York, NY 10011-4211, USA http://www.cup.org 10 Stamford Road, Oakleigh, Melbourne 3166, Australia c Cambridge University Press 1999 This book is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 1999 Printed in the United States of America Typeset in 10/13 Times Roman in LATEX2ε[TB] A catalog record for this book is available from the British Library. Library of Congress Cataloging-in-Publication Data Stern, Manfred. Semimodular lattices: theory and applications. / Manfred Stern. p. cm. – (Encyclopedia of mathematics and its applications ; v. 73) Includes bibliographical references and index. I. Title. II. Series. QA171.5.S743 1999 511.303 – dc21 98-44873 CIP ISBN 0 521 46105 7 hardback P1: SDY/SIL P2: SDY/SJS QC: SSH/SDY CB178/Stern CB178-FM March 3, 1999 9:46 Contents Preface page ix 1 From Boolean Algebras to Semimodular Lattices 1 1.1 Sources of Semimodularity
    [Show full text]
  • Lecture 2: Spaces of Maps, Loop Spaces and Reduced Suspension
    LECTURE 2: SPACES OF MAPS, LOOP SPACES AND REDUCED SUSPENSION In this section we will give the important constructions of loop spaces and reduced suspensions associated to pointed spaces. For this purpose there will be a short digression on spaces of maps between (pointed) spaces and the relevant topologies. To be a bit more specific, one aim is to see that given a pointed space (X; x0), then there is an entire pointed space of loops in X. In order to obtain such a loop space Ω(X; x0) 2 Top∗; we have to specify an underlying set, choose a base point, and construct a topology on it. The underlying set of Ω(X; x0) is just given by the set of maps 1 Top∗((S ; ∗); (X; x0)): A base point is also easily found by considering the constant loop κx0 at x0 defined by: 1 κx0 :(S ; ∗) ! (X; x0): t 7! x0 The topology which we will consider on this set is a special case of the so-called compact-open topology. We begin by introducing this topology in a more general context. 1. Function spaces Let K be a compact Hausdorff space, and let X be an arbitrary space. The set Top(K; X) of continuous maps K ! X carries a natural topology, called the compact-open topology. It has a subbasis formed by the sets of the form B(T;U) = ff : K ! X j f(T ) ⊆ Ug where T ⊆ K is compact and U ⊆ X is open. Thus, for a map f : K ! X, one can form a typical basis open neighborhood by choosing compact subsets T1;:::;Tn ⊆ K and small open sets Ui ⊆ X with f(Ti) ⊆ Ui to get a neighborhood Of of f, Of = B(T1;U1) \ ::: \ B(Tn;Un): One can even choose the Ti to cover K, so as to `control' the behavior of functions g 2 Of on all of K.
    [Show full text]
  • Modular Galois Represemtations
    Modular Galois Represemtations Manal Alzahrani November 9, 2015 Contents 1 Introduction: Last Formulation of QA 1 1.1 Absolute Galois Group of Q :..................2 1.2 Absolute Frobenius Element over p 2 Q :...........2 1.3 Galois Representations : . .4 2 Modular Galois Representation 5 3 Modular Galois Representations and FLT: 6 4 Modular Artin Representations 8 1 Introduction: Last Formulation of QA Recall that the goal of Weinstein's paper was to find the solution to the following simple equation: QA: Let f(x) 2 Z[x] irreducible. Is there a "rule" which determine whether f(x) split modulo p, for any prime p 2 Z? This question can be reformulated using algebraic number theory, since ∼ there is a relation between the splitting of fp(x) = f(x)(mod p) and the splitting of p in L = Q(α), where α is a root of f(x). Therefore, we can ask the following question instead: QB: Let L=Q a number field. Is there a "rule" determining when a prime in Q split in L? 1 0 Let L =Q be a Galois closure of L=Q. Since a prime in Q split in L if 0 and only if it splits in L , then to answer QB we can assume that L=Q is Galois. Recall that if p 2 Z is a prime, and P is a maximal ideal of OL, then a Frobenius element of Gal(L=Q) is any element of FrobP satisfying the following condition, FrobP p x ≡ x (mod P); 8x 2 OL: If p is unramifed in L, then FrobP element is unique.
    [Show full text]
  • A Note on the Non-Existence of Prime Models of Theories of Pseudo-Finite
    A note on the non-existence of prime models of theories of pseudo-finite fields Zo´eChatzidakis∗ DMA (UMR 8553), Ecole Normale Sup´erieure CNRS, PSL Research University September 23, 2020 Abstract We show that if a field A is not pseudo-finite, then there is no prime model of the theory of pseudo-finite fields over A. Assuming GCH, we generalise this result to κ-prime models, for κ a regular uncountable cardinal or . ℵε Introduction In this short note, we show that prime models of the theory of pseudo-finite fields do not exist. More precisely, we consider the following theory T (A): F is a pseudo-finite field, A a relatively algebraically closed subfield of F, and T (A) is the theory of the field F in the language of rings augmented by constant symbols for the elements of A. Our first result is: Theorem 2.5. Let T (A) be as above. If A is not pseudo-finite, then T (A) has no prime model. The proof is done by constructing 2|A|+ℵ0 non-isomorphic models of T (A), of transcendence degree 1 over A (Proposition 2.4). Next we address the question of existence of κ-prime models of T (A), where κ is a regular uncountable cardinal or ε. We assume GCH, and again show non-existence of κ-prime models arXiv:2004.05593v2 [math.LO] 22 Sep 2020 ℵ of T (A), unless A < κ or A is κ-saturated when κ 1, and when the transcendence degree of A is infinite when| | κ = (Theorem 3.4).
    [Show full text]
  • Groups with Almost Modular Subgroup Lattice Provided by Elsevier - Publisher Connector
    Journal of Algebra 243, 738᎐764Ž. 2001 doi:10.1006rjabr.2001.8886, available online at http:rrwww.idealibrary.com on View metadata, citation and similar papers at core.ac.uk brought to you by CORE Groups with Almost Modular Subgroup Lattice provided by Elsevier - Publisher Connector Francesco de Giovanni and Carmela Musella Dipartimento di Matematica e Applicazioni, Uni¨ersita` di Napoli ‘‘Federico II’’, Complesso Uni¨ersitario Monte S. Angelo, Via Cintia, I 80126, Naples, Italy and Yaroslav P. Sysak1 Institute of Mathematics, Ukrainian National Academy of Sciences, ¨ul. Tereshchenki¨ska 3, 01601 Kie¨, Ukraine Communicated by Gernot Stroth Received November 14, 2000 DEDICATED TO BERNHARD AMBERG ON THE OCCASION OF HIS 60TH BIRTHDAY 1. INTRODUCTION A subgroup of a group G is called modular if it is a modular element of the lattice ᑦŽ.G of all subgroups of G. It is clear that everynormal subgroup of a group is modular, but arbitrarymodular subgroups need not be normal; thus modularitymaybe considered as a lattice generalization of normality. Lattices with modular elements are also called modular. Abelian groups and the so-called Tarski groupsŽ i.e., infinite groups all of whose proper nontrivial subgroups have prime order. are obvious examples of groups whose subgroup lattices are modular. The structure of groups with modular subgroup lattice has been described completelybyIwasawa wx4, 5 and Schmidt wx 13 . For a detailed account of results concerning modular subgroups of groups, we refer the reader towx 14 . 1 This work was done while the third author was visiting the Department of Mathematics of the Universityof Napoli ‘‘Federico II.’’ He thanks the G.N.S.A.G.A.
    [Show full text]
  • Group Theory
    Group Theory Hartmut Laue Mathematisches Seminar der Universit¨at Kiel 2013 Preface These lecture notes present the contents of my course on Group Theory within the masters programme in Mathematics at the University of Kiel. The aim is to introduce into concepts and techniques of modern group theory which are the prerequisites for tackling current research problems. In an area which has been studied with extreme intensity for many decades, the decision of what to include or not under the time limits of a summer semester was certainly not trivial, and apart from the aspect of importance also that of personal taste had to play a role. Experts will soon discover that among the results proved in this course there are certain theorems which frequently are viewed as too difficult to reach, like Tate’s (4.10) or Roquette’s (5.13). The proofs given here need only a few lines thanks to an approach which seems to have been underestimated although certain rudiments of it have made it into newer textbooks. Instead of making heavy use of cohomological or topological considerations or character theory, we introduce a completely elementary but rather general concept of normalized group action (1.5.4) which serves as a base for not only the above-mentioned highlights but also for other important theorems (3.6, 3.9 (Gasch¨utz), 3.13 (Schur-Zassenhaus)) and for the transfer. Thus we hope to escape the cartesian reservation towards authors in general1, although other parts of the theory clearly follow well-known patterns when a major modification would not result in a gain of clarity or applicability.
    [Show full text]