DOCSLIB.ORG

The R1 and S1 Properties for Linear Algebraic Groups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The R1 and S1 Properties for Linear Algebraic Groups J. Group Theory 19 (2016), 901–921 DOI 10.1515/jgth-2016-0004 © de Gruyter 2016 The R and S properties for 1 1 linear algebraic groups Alexander Fel’shtyn and Timur Nasybullov Communicated by Evgenii I. Khukhro Abstract. In this paper we study twisted conjugacy classes and isogredience classes for automorphisms of reductive linear algebraic groups. We show that reductive linear alge- braic groups over some fields of zero characteristic possess the R and S properties. 1 1 1 Introduction Let ' G G be an endomorphism of a group G. Then two elements x; y of W ! G are said to be twisted '-conjugate if there exists a third element z G such 2 that x zy'.z/ 1. The equivalence classes of this relation are called the twisted D conjugacy classes or the Reidemeister classes of '. The Reidemeister number of ' denoted by R.'/, is the number of twisted conjugacy classes of '. This number is either a positive integer or and we do not distinguish different infi- 1 nite cardinal numbers. An infinite group G possesses the R -property if for every automorphism ' of G the Reidemeister number of ' is infinite.1 The interest in twisted conjugacy relations has its origins, in particular, in Nielsen–Reidemeister fixed point theory (see, e.g. [7, 34]), in Arthur–Selberg the- ory (see, e.g. [1,50]), in algebraic geometry (see, e.g. [28]), in Galois cohomology [49] and in the theory of linear algebraic groups (see, e.g. [52]). In representation theory twisted conjugacy probably occurs first in Gantmacher’s paper [20] (see, e.g. [45, 51]). The problem of determining which classes of discrete infinite groups have the R -property is an area of active research initiated by Fel’shtyn and Hill in 1994 (see1 [13]). Later, it was shown by various authors that the following groups have the R -property: non-elementary Gromov hyperbolic groups (see [8, 38]); rela- tively1 hyperbolic groups (see [9]); Baumslag–Solitar groups BS.m; n/ except for BS.1; 1/ (see [10]), generalized Baumslag–Solitar groups, that is, finitely gener- ated groups which act on a tree with all edge and vertex stabilizers infinite cyclic (see [37]); the solvable generalization of BS.1; n/ given by the short exact sequence 1 ZŒ 1 Zk 1 (see [53]); a wide class of saturated weakly ! n ! ! ! The second author is supported by Russian Science Foundation (project 14-21-00065). 902 A. Fel’shtyn and T. Nasybullov branch groups (including the Grigorchuk group (see [27]) and the Gupta–Sidki group (see [29])) (see [15]), Thompson’s groups F (see [2]) and T (see[3, 22]); the generalized Thompson groups Fn; 0 and their finite direct products (see [21]); Houghton’s groups (see [23,35]); symplectic groups Sp.2n; Z/, the mapping class groups ModS of a compact oriented surface S with genus g and p boundary com- ponents, 3g p 4 > 0, and the full braid groups Bn.S/ on n > 3 strands of C a compact surface S in the cases where S is either the compact disk D, or the sphere S 2 (see [11]); some classes of Artin groups of infinite type (see [36]); exten- sions of SL.n; Z/, PSL.n; Z/, GL.n; Z/, PGL.n; Z/, Sp.2n; Z/, PSp.2n; Z/, for n > 2, by a countable abelian group, and normal subgroups of SL.n; Z/, n > 2, not contained in the center (see [40]); GL.n; K/, SL.n; K/, Sp.2n; K/ and On.K/ if n > 2 and K is an infinite integral domain which has zero characteristic and for which Aut.K/ is periodic (see [42,44]); Chevalley groups over fields of zero char- acteristic which have finite transcendence degree over Q (see [43]); irreducible lattices in a connected semisimple Lie group G with finite center and real rank at least 2 (see [41]); non-amenable, finitely generated residually finite groups (see [17]) (this class gives a lot of new examples of groups with the R -property); n Ì 1 n Ì 1 some metabelian groups of the form Q Z and ZŒ p Z (see [12]); lamp- lighter groups Zn Z if and only if 2 n or 3 n (see [25]); free nilpotent groups Nrc o j j of rank r 2 and class c 9 (see [26]), Nrc of rank r 2 or r 3 and class D D D c 4r; or rank r 4 and class c 2r; any group N2c for c 4, every free solv- able group S2t of rank 2 and class t 2, any free solvable group Srt of rank r 2 and class t big enough (see [47]); some crystallographic groups (see [6,39]). Recently, in [5] it was proven that Nrc, r > 1 possesses the R -property if and only if c 2r. 1 Let ‰ be an element of Out.G/ Aut.G/=Inn.G/ (we consider ‰ as a col- D lection of ordinary automorphisms a Aut.G/). We say that two automorphisms 2 a; b ‰ are similar (or isogredient) if b ' a' 1 for some h G, where 2 D h h 2 ' .g/ hgh 1 is an inner automorphism induced by the element h (see [38]). h D Let S.‰/ be the set of isogredience classes of automorphisms representing ‰. Denote by S.‰/ the cardinality of the set S.‰/. The group G is said to possess the S -property if for every ‰ the set S.‰/ is infinite, i.e. S.‰/ (see [18]). 1 D 1 In this paper we study the R and S properties for linear algebraic groups. The first results in this direction1 were1 obtained for some classes of Chevalley groups by Nasybullov in [43]. In Section 3 we extend the previous result from [43] and prove the following. Theorem 3.2. Let G be a Chevalley group of type ˆ over a field F of zero char- acteristic. If the transcendence degree of F over Q is finite, then G possesses the R -property. 1 The R and S properties for linear algebraic groups 903 1 1 The following main theorem is proved in Section 4. Theorem 4.1. Let F be an algebraically closed field of zero characteristic such that the transcendence degree of F over Q is finite. If a reductive linear algebraic group G over the field F has a nontrivial quotient group G=R.G/, where R.G/ is the radical of G, then G possesses the R -property. 1 These theorems cannot be generalized to groups over a field of non-zero char- acteristic, by the following theorem of Steinberg [52, Theorem 10.1]. Theorem. Let G be a connected linear algebraic group and let ' be an endomor- phism of G onto G. If ' has a finite number of fixed points, then G x'.x 1/ x G : D ¹ W 2 º Indeed, any semisimple linear algebraic group over an algebraically closed field of positive characteristic possesses an automorphism ' with finitely many fixed points (the Frobenius morphism, see [48, Section 3.2]), therefore, this group coin- 1 cides with the set x'.x / x G Œe', hence R.'/ 1 and such a group ¹ W 2 º D D cannot possess the R -property. Throughout the paper,1 by an automorphism of a linear algebraic group G we mean an automorphism of the abstract group underlying G (without any extra conditions). If T1;T2;::: are algebraically independent over Q, the fields Q, Q.T1;:::;Tk/ .k 1/ are algebraically closed fields of zero characteristic with the finite tran- scendence degree over Q. Then reductive linear algebraic groups over these fields possess the R -property. In Section1 5 we prove that an infinite reductive linear algebraic group G over a field F of zero characteristic and finite transcendence degree over Q which pos- sesses an automorphism ' with finite Reidemeister number is a torus. In Section 6 we prove the following theorem. Theorem 6.3. Let F be an algebraically closed field of zero characteristic such that the transcendence degree of F over Q is finite. If a reductive linear alge- braic group G over the field F has a nontrivial quotient group G=R.G/, then G possesses the S -property. 1 2 Preliminaries In this section we recall some preliminary statements which are used in the paper. A lot of the results we use are thoroughly presented in [43], this can be used as background material. 904 A. Fel’shtyn and T. Nasybullov The symbols In and On m indicate the identity n n matrix and the n m matrix with zero entries, respectively. If A is an n n matrix and B is an m m matrix, then the symbol A B denotes the direct sum of the matrices A and B, ˚ i.e. the block-diagonal .m n/ .m n/ matrix C C ! A On m : Om n B It is obvious that for a pair of n n matrices A1;A2 and for a pair of m m matrices B1;B2 we have 1 1 1 .A1 B1/.A2 B2/ A1A2 B1B2 and .A1 B1/ A B : ˚ ˚ D ˚ ˚ D 1 ˚ 1 The symbols G H and G H denote the direct product and the central prod- ı uct of the groups G and H, respectively. If g is an element of a group G, then 'g denotes the inner automorphism in- duced by the element g. The following lemma can be found in [16, Corollary 2.5]. Lemma 2.1. Let ' be an automorphism of a group G and let 'g be an inner auto- morphism of the group G.
Load more

Recommended publications
  • On Automorphisms and Endomorphisms of Projective Varieties
    On automorphisms and endomorphisms of projective varieties Michel Brion Abstract We first show that any connected algebraic group over a perfect field is the neutral component of the automorphism group scheme of some normal pro- jective variety. Then we show that very few connected algebraic semigroups can be realized as endomorphisms of some projective variety X, by describing the structure of all connected subsemigroup schemes of End(X). Key words: automorphism group scheme, endomorphism semigroup scheme MSC classes: 14J50, 14L30, 20M20 1 Introduction and statement of the results By a result of Winkelmann (see [22]), every connected real Lie group G can be realized as the automorphism group of some complex Stein manifold X, which may be chosen complete, and hyperbolic in the sense of Kobayashi. Subsequently, Kan showed in [12] that we may further assume dimC(X) = dimR(G). We shall obtain a somewhat similar result for connected algebraic groups. We first introduce some notation and conventions, and recall general results on automorphism group schemes. Throughout this article, we consider schemes and their morphisms over a fixed field k. Schemes are assumed to be separated; subschemes are locally closed unless mentioned otherwise. By a point of a scheme S, we mean a Michel Brion Institut Fourier, Universit´ede Grenoble B.P. 74, 38402 Saint-Martin d'H`eresCedex, France e-mail: [email protected] 1 2 Michel Brion T -valued point f : T ! S for some scheme T .A variety is a geometrically integral scheme of finite type. We shall use [17] as a general reference for group schemes.
    [Show full text]
  • Commensurators of Finitely Generated Non-Free Kleinian Groups. 1
    Commensurators of finitely generated non-free Kleinian groups. C. LEININGER D. D. LONG A.W. REID We show that for any finitely generated torsion-free non-free Kleinian group of the first kind which is not a lattice and contains no parabolic elements, then its commensurator is discrete. 57M07 1 Introduction Let G be a group and Γ1; Γ2 < G. Γ1 and Γ2 are called commensurable if Γ1 \Γ2 has finite index in both Γ1 and Γ2 . The Commensurator of a subgroup Γ < G is defined to be: −1 CG(Γ) = fg 2 G : gΓg is commensurable with Γg: When G is a semi-simple Lie group, and Γ a lattice, a fundamental dichotomy es- tablished by Margulis [26], determines that CG(Γ) is dense in G if and only if Γ is arithmetic, and moreover, when Γ is non-arithmetic, CG(Γ) is again a lattice. Historically, the prominence of the commensurator was due in large part to its density in the arithmetic setting being closely related to the abundance of Hecke operators attached to arithmetic lattices. These operators are fundamental objects in the theory of automorphic forms associated to arithmetic lattices (see [38] for example). More recently, the commensurator of various classes of groups has come to the fore due to its growing role in geometry, topology and geometric group theory; for example in classifying lattices up to quasi-isometry, classifying graph manifolds up to quasi- isometry, and understanding Riemannian metrics admitting many “hidden symmetries” (for more on these and other topics see [2], [4], [17], [18], [25], [34] and [37]).
    [Show full text]
  • Automorphism Groups of Free Groups, Surface Groups and Free Abelian Groups
    Automorphism groups of free groups, surface groups and free abelian groups Martin R. Bridson and Karen Vogtmann The group of 2 × 2 matrices with integer entries and determinant ±1 can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional torus. Thus this group is the beginning of three natural sequences of groups, namely the general linear groups GL(n, Z), the groups Out(Fn) of outer automorphisms of free groups of rank n ≥ 2, and the map- ± ping class groups Mod (Sg) of orientable surfaces of genus g ≥ 1. Much of the work on mapping class groups and automorphisms of free groups is motivated by the idea that these sequences of groups are strongly analogous, and should have many properties in common. This program is occasionally derailed by uncooperative facts but has in general proved to be a success- ful strategy, leading to fundamental discoveries about the structure of these groups. In this article we will highlight a few of the most striking similar- ities and differences between these series of groups and present some open problems motivated by this philosophy. ± Similarities among the groups Out(Fn), GL(n, Z) and Mod (Sg) begin with the fact that these are the outer automorphism groups of the most prim- itive types of torsion-free discrete groups, namely free groups, free abelian groups and the fundamental groups of closed orientable surfaces π1Sg. In the ± case of Out(Fn) and GL(n, Z) this is obvious, in the case of Mod (Sg) it is a classical theorem of Nielsen.
    [Show full text]
  • Isomorphisms and Automorphisms
    Isomorphisms and Automorphisms Definition As usual an isomorphism is defined as a map between objects that preserves structure, for general designs this means: Suppose (X,A) and (Y,B) are two designs. They are said to be isomorphic if there exists a bijection α: X → Y such that if we apply α to the elements of any block of A we obtain a block of B and all blocks of B are obtained this way. Symbolically we can write this as: B = [ {α(x) | x ϵ A} : A ϵ A ]. The bijection α is called an isomorphism. Example We've seen two versions of a (7,4,2) symmetric design: k = 4: {3,5,6,7} {4,6,7,1} {5,7,1,2} {6,1,2,3} {7,2,3,4} {1,3,4,5} {2,4,5,6} Blocks: y = [1,2,3,4] {1,2} = [1,2,5,6] {1,3} = [1,3,6,7] {1,4} = [1,4,5,7] {2,3} = [2,3,5,7] {2,4} = [2,4,6,7] {3,4} = [3,4,5,6] α:= (2576) [1,2,3,4] → {1,5,3,4} [1,2,5,6] → {1,5,7,2} [1,3,6,7] → {1,3,2,6} [1,4,5,7] → {1,4,7,2} [2,3,5,7] → {5,3,7,6} [2,4,6,7] → {5,4,2,6} [3,4,5,6] → {3,4,7,2} Incidence Matrices Since the incidence matrix is equivalent to the design there should be a relationship between matrices of isomorphic designs.
    [Show full text]
  • Automorphisms of Group Extensions
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 155, Number t, March 1971 AUTOMORPHISMS OF GROUP EXTENSIONS BY CHARLES WELLS Abstract. If 1 ->■ G -í> E^-Tt -> 1 is a group extension, with i an inclusion, any automorphism <j>of E which takes G onto itself induces automorphisms t on G and a on n. However, for a pair (a, t) of automorphism of n and G, there may not be an automorphism of E inducing the pair. Let à: n —*■Out G be the homomorphism induced by the given extension. A pair (a, t) e Aut n x Aut G is called compatible if a fixes ker á, and the automorphism induced by a on Hü is the same as that induced by the inner automorphism of Out G determined by t. Let C< Aut IT x Aut G be the group of compatible pairs. Let Aut (E; G) denote the group of automorphisms of E fixing G. The main result of this paper is the construction of an exact sequence 1 -» Z&T1,ZG) -* Aut (E; G)-+C^ H*(l~l,ZG). The last map is not surjective in general. It is not even a group homomorphism, but the sequence is nevertheless "exact" at C in the obvious sense. 1. Notation. If G is a group with subgroup H, we write H<G; if H is normal in G, H<¡G. CGH and NGH are the centralizer and normalizer of H in G. Aut G, Inn G, Out G, and ZG are the automorphism group, the inner automorphism group, the outer automorphism group, and the center of G, respectively.
    [Show full text]
  • Free and Linear Representations of Outer Automorphism Groups of Free Groups
    Free and linear representations of outer automorphism groups of free groups Dawid Kielak Magdalen College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2012 This thesis is dedicated to Magda Acknowledgements First and foremost the author wishes to thank his supervisor, Martin R. Bridson. The author also wishes to thank the following people: his family, for their constant support; David Craven, Cornelia Drutu, Marc Lackenby, for many a helpful conversation; his office mates. Abstract For various values of n and m we investigate homomorphisms Out(Fn) ! Out(Fm) and Out(Fn) ! GLm(K); i.e. the free and linear representations of Out(Fn) respectively. By means of a series of arguments revolving around the representation theory of finite symmetric subgroups of Out(Fn) we prove that each ho- momorphism Out(Fn) ! GLm(K) factors through the natural map ∼ πn : Out(Fn) ! GL(H1(Fn; Z)) = GLn(Z) whenever n = 3; m < 7 and char(K) 62 f2; 3g, and whenever n + 1 n > 5; m < 2 and char(K) 62 f2; 3; : : : ; n + 1g: We also construct a new infinite family of linear representations of Out(Fn) (where n > 2), which do not factor through πn. When n is odd these have the smallest dimension among all known representations of Out(Fn) with this property. Using the above results we establish that the image of every homomor- phism Out(Fn) ! Out(Fm) is finite whenever n = 3 and n < m < 6, and n of cardinality at most 2 whenever n > 5 and n < m < 2 .
    [Show full text]
  • A Survey on Automorphism Groups of Finite P-Groups
    A Survey on Automorphism Groups of Finite p-Groups Geir T. Helleloid Department of Mathematics, Bldg. 380 Stanford University Stanford, CA 94305-2125 [email protected] February 2, 2008 Abstract This survey on the automorphism groups of finite p-groups focuses on three major topics: explicit computations for familiar finite p-groups, such as the extraspecial p-groups and Sylow p-subgroups of Chevalley groups; constructing p-groups with specified automorphism groups; and the discovery of finite p-groups whose automorphism groups are or are not p-groups themselves. The material is presented with varying levels of detail, with some of the examples given in complete detail. 1 Introduction The goal of this survey is to communicate some of what is known about the automorphism groups of finite p-groups. The focus is on three topics: explicit computations for familiar finite p-groups; constructing p-groups with specified automorphism groups; and the discovery of finite p-groups whose automorphism groups are or are not p-groups themselves. Section 2 begins with some general theorems on automorphisms of finite p-groups. Section 3 continues with explicit examples of automorphism groups of finite p-groups found in the literature. This arXiv:math/0610294v2 [math.GR] 25 Oct 2006 includes the computations on the automorphism groups of the extraspecial p- groups (by Winter [65]), the Sylow p-subgroups of the Chevalley groups (by Gibbs [22] and others), the Sylow p-subgroups of the symmetric group (by Bon- darchuk [8] and Lentoudis [40]), and some p-groups of maximal class and related p-groups.
    [Show full text]
  • Representing Groups on Graphs
    Representing groups on graphs Sagarmoy Dutta and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India 208016 {sagarmoy,ppk}@cse.iitk.ac.in Abstract In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism, even when the group is presented as a permutation group via generators. On the other hand, the representability problem for general groups on trees is equivalent to checking, given a group G and n, whether a nontrivial homomorphism from G to Sn exists. There does not seem to be a polynomial time algorithm for this problem, in spite of the fact that tree isomorphism has polynomial time algorithm. 1 Introduction Representation theory of groups is a vast and successful branch of mathematics with applica- tions ranging from fundamental physics to computer graphics and coding theory [5]. Recently representation theory has seen quite a few applications in computer science as well. In this article, we study some of the questions related to representation of finite groups on graphs. A representation of a group G usually means a linear representation, i.e. a homomorphism from the group G to the group GL (V ) of invertible linear transformations on a vector space V . Notice that GL (V ) is the set of symmetries or automorphisms of the vector space V . In general, by a representation of G on an object X, we mean a homomorphism from G to the automorphism group of X.
    [Show full text]
  • Math 311: Complex Analysis — Automorphism Groups Lecture
    MATH 311: COMPLEX ANALYSIS | AUTOMORPHISM GROUPS LECTURE 1. Introduction Rather than study individual examples of conformal mappings one at a time, we now want to study families of conformal mappings. Ensembles of conformal mappings naturally carry group structures. 2. Automorphisms of the Plane The automorphism group of the complex plane is Aut(C) = fanalytic bijections f : C −! Cg: Any automorphism of the plane must be conformal, for if f 0(z) = 0 for some z then f takes the value f(z) with multiplicity n > 1, and so by the Local Mapping Theorem it is n-to-1 near z, impossible since f is an automorphism. By a problem on the midterm, we know the form of such automorphisms: they are f(z) = az + b; a; b 2 C; a 6= 0: This description of such functions one at a time loses track of the group structure. If f(z) = az + b and g(z) = a0z + b0 then (f ◦ g)(z) = aa0z + (ab0 + b); f −1(z) = a−1z − a−1b: But these formulas are not very illuminating. For a better picture of the automor- phism group, represent each automorphism by a 2-by-2 complex matrix, a b (1) f(z) = ax + b ! : 0 1 Then the matrix calculations a b a0 b0 aa0 ab0 + b = ; 0 1 0 1 0 1 −1 a b a−1 −a−1b = 0 1 0 1 naturally encode the formulas for composing and inverting automorphisms of the plane. With this in mind, define the parabolic group of 2-by-2 complex matrices, a b P = : a; b 2 ; a 6= 0 : 0 1 C Then the correspondence (1) is a natural group isomorphism, Aut(C) =∼ P: 1 2 MATH 311: COMPLEX ANALYSIS | AUTOMORPHISM GROUPS LECTURE Two subgroups of the parabolic subgroup are its Levi component a 0 M = : a 2 ; a 6= 0 ; 0 1 C describing the dilations f(z) = ax, and its unipotent radical 1 b N = : b 2 ; 0 1 C describing the translations f(z) = z + b.
    [Show full text]
  • Groups, Triality, and Hyperquasigroups
    GROUPS, TRIALITY, AND HYPERQUASIGROUPS JONATHAN D. H. SMITH Abstract. Hyperquasigroups were recently introduced to provide a more symmetrical approach to quasigroups, and a far-reaching implementation of triality (S3-action). In the current paper, various connections between hyper- quasigroups and groups are examined, on the basis of established connections between quasigroups and groups. A new graph-theoretical characterization of hyperquasigroups is exhibited. Torsors are recognized as hyperquasigroups, and group representations are shown to be equivalent to linear hyperquasi- groups. The concept of orthant structure is introduced, as a tool for recovering classical information from a hyperquasigroup. 1. Introduction This paper is concerned with the recently introduced algebraic structures known as hyperquasigroups, which are intended as refinements of quasigroups. A quasi- group (Q; ·) was first understood as a set Q with a binary multiplication, denoted by · or mere juxtaposition, such that in the equation x · y = z ; knowledge of any two of x; y; z specifies the third uniquely. To make a distinction with subsequent concepts, it is convenient to describe a quasigroup in this original sense as a combinatorial quasigroup (Q; ·). A loop (Q; ·; e) is a combinatorial quasi- group (Q; ·) with an identity element e such that e·x = x = x·e for all x in Q. The body of the multiplication table of a combinatorial quasigroup of finite order n is a Latin square of order n, an n × n square array in which each row and each column contains each element of an n-element set exactly once. Conversely, each Latin square becomes the body of the multiplication table of a combinatorial quasigroup if distinct labels from the square are attached to the rows and columns of the square.
    [Show full text]
  • Lattices in Lie Groups
    Lattices in Lie groups Dave Witte Morris Lattices in Lie groups 1: Introduction University of Lethbridge, Alberta, Canada http://people.uleth.ca/ dave.morris What is a lattice subgroup? ∼ [email protected] Arithmetic construction of lattices. Abstract Compactness criteria. During this mini-course, the students will learn the Classical simple Lie groups. basic theory of lattices in semisimple Lie groups. Examples will be provided by simple arithmetic constructions. Aspects of the geometric and algebraic structure of lattices will be discussed, and the Superrigidity and Arithmeticity Theorems of Margulis will be described. Dave Witte Morris (U of Lethbridge) Lattices 1: Introduction CIRM, Jan 2019 1 / 18 Dave Witte Morris (U of Lethbridge) Lattices 1: Introduction CIRM, Jan 2019 2 / 18 A simple example. Z2 is a cocompact lattice in R2. 2 2 R is a connected Lie group Replace R with interesting group G. group: (x1,x2) (y1,y2) (x1 y1,x2 y2) + = + + Riemannian manifold (metric space, connected) is a cocompact lattice in G: (discrete subgroup) distance is right-invariant: d(x a, y a) d(x, y) + + = Every pt in G is within bounded distance of . group ops (x y and x) continuous (differentiable) Γ + − g cγ where c is bounded — in cpct set 2 = Z is a discrete subgroup (no accumulation points) compact C G, G C . Γ Every point in R2 is within ∃ ⊆ = G/ is cpct. (gn g ! γn , gnγn g) 2 bdd distance C √2 of Z → Γ ∃{ } → = 2 Z is a cocompact lattice is a latticeΓ in G: Γ Γ ⇒ 2 in R . only require C (or G/ ) to have finite volume.
    [Show full text]
  • Elements of Quasigroup Theory and Some Its Applications in Code Theory and Cryptology
    Elements of quasigroup theory and some its applications in code theory and cryptology Victor Shcherbacov 1 1 Introduction 1.1 The role of definitions. This course is an extended form of lectures which author have given for graduate students of Charles University (Prague, Czech Republic) in autumn of year 2003. In this section we follow books [56, 59]. In mathematics one should strive to avoid ambiguity. A very important ingredient of mathematical creativity is the ability to formulate useful defi- nitions, ones that will lead to interesting results. Every definition is understood to be an if and only if type of statement, even though it is customary to suppress the only if. Thus one may define: ”A triangle is isosceles if it has two sides of equal length”, really meaning that a triangle is isosceles if and only if it has two sides of equal length. The basic importance of definitions to mathematics is also a structural weakness for the reason that not every concept used can be defined. 1.2 Sets. A set is well-defined collection of objects. We summarize briefly some of the things we shall simply assume about sets. 1. A set S is made up of elements, and if a is one of these elements, we shall denote this fact by a ∈ S. 2. There is exactly one set with no elements. It is the empty set and is denoted by ∅. 3. We may describe a set either by giving a characterizing property of the elements, such as ”the set of all members of the United State Senate”, or by listing the elements, for example {1, 3, 4}.
    [Show full text]