DOCSLIB.ORG

Commutator Properties and Relative Theories in Communication with Solvable Groups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Commutator Properties and Relative Theories in Communication with Solvable Groups ORIGINAL ARTICLE Commutator properties and relative theories in communication with solvable groups Md Taufiq Nasseef Md Taufiq Nasseef. Commutator properties and relative theories in branches of Mathematics, has developed in many different directions. It becomes communication with solvable groups. J Pur Appl Math. 2018;2(2):14-21. of prime importance in many Mathematical disciplines. Here, I have studied an essential part of groups called Commutators related to solvable groups. In this ABSTRACT study, I have discussed Commutator properties and intend to present some relative The study of groups arose from the theory equations; more specifically form the noteworthy theorems of commutators in connection with solvable groups. I have attempt to find roots of a polynomial in terms of its coefficients, early in the 19th assumed the group G to be finite group throughout the whole work. century. The theory of groups itself, which had already been applied in almost all Key Words: Finite group; Commutator; Commutator subgroup; Solvable groups Definition of a commutator Let x,y,z ∈G be elements of a group G then (a) Let G be a group. If a and b are elements of a group G, then ab=bac for (xy,z) = (x,z)y(y,z) = (x,z)(x,z,y)(y,z) [4] some c∈G. If a and b commute, then, of course, c=e. In general c ≠ e and c −− Proof: = a11 b ab . An element of this form is called a commutator and is usually denoted by (a,b). Consider, (xy,z) = (xy)-1z-1(xy)z = y-1x-1z-1xyz (b) We also define commutators of higher order by the recursive rule: Consider, (x,z)y(y,z) = y-1(x,z)y(y,z) −−11 = y-1x-1z-1xzyy-1z-1yz ( xx12,, xxnn−− 1 ,) = (( xx12 ,, xn 1) , x n) =( Xx , n) = XxXx nn [1] = y-1x-1z-1xyz Where Again, (x,z)(x,z,y)(y,z) These are called simple commutators. = x-1z-1xz(x,z)-1y-1(x,z)yy-1z-1yz (c) The set of all elements which can be obtained by successive commutation = x-1z-1xzz-1x-1zxy-1x-1z-1xzyy-1z-1yz are called complex commutators. = y-1x-1z-1xyz (d) Let G be a group. Let A and B be subgroups by the notation (A,B), we Hence, (xy,z) = (x,z)y(y,z) = (x,z)(x,z,y)(y,z) mean the group generated by all commutators. (a,b) with a∈A, b∈B. Property-3:Let x,y,z be elements of a group G. Then (e) If A1, A2,……An-1 , An are subgroups of a group G, then we define z (A1,A2,……An-1,An) = ((A1,A2,……An-1),An) [2] (x,yz)=(x,z)(x,y) =(x,z)(x,y)(x,y,z) [5] (f) We shall represent conjugation by an exponent ax=x-1ax where x is fixed Proof: in G and for all x∈G. [1] Consider, (x,yz) = x-1(yz)-1xyz = x-1z-1y-1xyz Definition of commutator subgroup Consider, (x,z)(x,y)z = (x,z)z-1(x,y)z Let G be a group. Let us denote by the subgroup generated by the set of all -1 -1 -1 -1 -1 commutators (a,b )= a-1b-1 of G, for all a,b ∈G, then is called the commutator = x z xzz x y xyz subgroup of G′ [1, 7-11]. = x-1z-1y-1xyz Note: G′ is normal in G. Again (x,z)(x,y)(x,y,z) = x-1z-1xzx-1y-1xyx-1(y,z)-1x(y,z) =x-1z-1xzx-1y-1xyy-1x-1yxz-1x-1y-1xyz Some properties of commutators = x-1z-1y-1xyz Note: Let x,y ∈G then (x,y)=e the identity of G if and only if xy = yx, the proof follows directly from the definition of a commutation [1-11]. Hence, (x,yz) = (x,z)(x,y)z = (x,z)(x,y)(x,y,z) Property-1:Let xy∈G be elements of a group G, the (y,x) = (x,y)-1 [3] Property-4: Proof: Let x,y,z be elements of a group G, Then L.H.S: (y,x) = y-1x-1yx = ( x-1y-1xy)-1 = y-1x-1yx (x,y-1,z)y(y,z-1,x)z(z,x-1,y)x = e, the identity of G. [6] Hence, (y,x) = (x,y)-1 Proof: Property-2: Consider (x,y-1,z)y = y-1(x,y-1,z)y Douglas Mental Health University Institute, 6875 Lasalle Blvd. H4H 1R3, Montreal, Quebec, Canada. Correspondence: Md Taufiq Nasseef, Douglas Mental Health University Institute, 6875 Lasalle Blvd. H4H 1R3, Montreal, Quebec, Canada. Tel: 5148626907; email: [email protected] Received: July 18, 2018, Accepted: August 17, 2018, Published: August 23, 2018 This open-access article is distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC) (http:// creativecommons.org/licenses/by-nc/4.0/), which permits reuse, distribution and reproduction of the article, provided that the original work is properly cited and the reuse is restricted to noncommercial purposes. For commercial reuse, contact [email protected] J Pur Appl Math Vol 2 No 2 August 2018 18 Nasseef = y-1(x,y-1)-1z-1(x,y-1)zy Property-7: = y-1yx-1yxz-1x-1yxy-1zy Let x,y be elements of a group G and suppose that z = (x,y) commutes with both x and y = x-1yxz-1x-1y xy-1zy (a) Then (xi,yj) = zij for all j [9] Similarly, (y,z-1,x)z = z-1(y,z-1,x)z (i) 1 i ii(− 1) = z-1(y,z-1)-1x-1(y,z-1)xz (ii) ( yx) = z2 yii x for all I [10] = z-1zy-1z-1yx-1y-1zyz-1xz Proof: =y-1z-1yx-1y-1zyz-1xz (b) Again, -1 -1 -1 -1 i -1 i i i i (z,x-1,y)x = x-1(z,x-1,y)x Since x y xy = z, then we have y xy = xz where y x y = (y xy) = (xz) = x z as x and z commute. Conjugating by y which gives that = x-1(z,x-1)-1y-1(z,x-1)yx y-1(y-1xiy)y = y-1 (xizi)y = (xizi)zi = xiz2i = x-1xz-1x-1zy-1z-1xzx-1yx as y and z commute. =z-1x-1zy-1z-1xzx-1yx (c) Repeating this argument j times. We conclude that Now, Combining (a),(b),(c), we get y-jxiyj = xizij and (xi,yj) = zij x-1y-1xz-1x-1yxy-1zy y-1z-1yx-1y-1zyz-1xz z-1x-1zy-1z-1xzx-1yx =e(identity) Again, (ii) holds, for j=1, assuming the result for (i-1), we have -1 y -1 z -1 x Hence, (x,y ,z) (y,z ,x) (z,x ,y) = e, the identity of G. 1 i i-1 (ii−− 1)( 2) (yx) = (yx) (yx) = z2 yii−−11 x yx i Property-5: Since, by then follows at once, that is, Let x,y,z be elements of a group G, then x y x y 1 (x,y,z)(y,z,x)(z,x,y)=(y,x)(z,x)(z,y) (x,y)(x,z) (y,z) (x,z)(z,x) [7] i ii(− 1) Hence ( yx) = z2 yii x for all i Proof: L.H.S. (x,y,z)(y,z,x)(z,x,y) Property-8: = (x,y)-1z-1(x,y)z(y,z)-1x-1(y,z)x(z,x)-1y-1(z,x)y Let x,y,z be element of a group G then = y-1x-1yxz-1x-1y-1xyzz-1y-1zyx-1y-1z-1yzxx-1z-1xzy-1z-1x-1zxy (i) If is commutes with z and if (x,G) is abelian then = y-1x-1yxz-1x-1y-1xzyx-1y-1z-1yxzy-1z-1x-1zxy (x,y,z)=(x,z,y) [11] R.H.S. (y,x)(z,x)(z,y)x(x,y)(x,z)y(y,z)x(x,z)(z,x)y (ii) If (x,y) commutes with both x and y then = (y,x)(z,x)x-1(z,y)x(x,y)y-1(x,z)yx-1(y,z)x(x,z)y-1(z,x)y (xy-1)-1=(x-1,y)=(x,y-1) [12] = y-1x-1yxz-1x-1zxx-1z-1y-1zyxx-1y-1xyy-1x-1z-1xzyx-1y-1z-1yzxx-1z-1xzy-1z-1x-1zxy Proof: = y-1x-1yxz-1x-1y-1xzyx-1y-1z-1yxzy-1z-1x-1zxy First (x,y,z ) = (x,y)-1z-1(x,y)(z) Therefore, L.H.S. = R.H.S = y-1x-1yxz-1x-1y-1xyz Property-6: = x-1(xy-1x-1y)(xz-1x-1z)(z-1y-1xyz) Let x,y,z be elements of a group G, then Furthermore, xy-1xy = (x-1,y) = (xm,y) for some positive integer m, we conclude easily by p-2 that (xm,y)∈(x,G) . (x,y,z) = ((z,x-1,y-1)xy)-1((y-1,z-1,x)zy)-1 [8] Thus, xy-1x-1y, and likewise xz-1x-1z lies in (x,G). Proof: Hence, by hypothesis these two elements commute. It follows, therefore, -1 -1 L.H.S (x,y,z) = (x,y) z (x,y)z that -1 -1 -1 -1 -1 = y x yxz x y xyz (x,y,z) = x-1(xy-1x-1y)(xz-1x-1z)(z-1y-1xyz) -1 -1 xy -1 -1 -1 -1 -1 R.H.S.
Load more

Recommended publications
  • Math 602, Fall 2002. BIII (A). We First Prove the Following Proposition
    Homework I (due September 30), Math 602, Fall 2002. BIII (a). We first prove the following proposition: Proposition 1.1 Given a group G, for any finite normal subgroup, H, of G and any p-Sylow subgroup P of H, we have G = NG(P )H. Proof . For every g ∈ G, clearly, g−1P g is a subgroup of g−1Hg = H, since H is normal in G. Since |g−1P g| = |P |, the subgroup g−1P g is also a p-Sylow subgroup of H. By Sylow II, g−1P g is some conjugate of P in H, i.e., g−1P g = hP h−1 for some h ∈ H. −1 −1 Thus, ghP h g = P , which implies that gh ∈ NG(P ), so g ∈ NG(P )H. Since the reasoning holds for every g ∈ G, we get G = NG(P )H. Now, since H is normal in G, by the second homomorphism theorem, we know that ∼ G/H = (NG(P )H)/H = NG(P )/(NG(P ) ∩ H). Moreover, it is clear that NG(P ) ∩ H = ∼ NH (P ), so G/H = NG(P )/NH (P ), as desired. (b) We shall prove that every p-Sylow subgroup of Φ(G) is normal in Φ(G) (and in fact, in G). From this, we will deduce that Φ(G) has property (N). Indeed, if we inspect the proof of the proposition proved in class stating that if G is a finite group that has (N), then G is isomorphic to the product of its p-Sylow subgroups, we see that this proof only depends on the fact that every p-Sylow subgroup of G is normal in G.
    [Show full text]
  • An Introduction to Quantum Field Theory
    AN INTRODUCTION TO QUANTUM FIELD THEORY By Dr M Dasgupta University of Manchester Lecture presented at the School for Experimental High Energy Physics Students Somerville College, Oxford, September 2009 - 1 - - 2 - Contents 0 Prologue....................................................................................................... 5 1 Introduction ................................................................................................ 6 1.1 Lagrangian formalism in classical mechanics......................................... 6 1.2 Quantum mechanics................................................................................... 8 1.3 The Schrödinger picture........................................................................... 10 1.4 The Heisenberg picture............................................................................ 11 1.5 The quantum mechanical harmonic oscillator ..................................... 12 Problems .............................................................................................................. 13 2 Classical Field Theory............................................................................. 14 2.1 From N-point mechanics to field theory ............................................... 14 2.2 Relativistic field theory ............................................................................ 15 2.3 Action for a scalar field ............................................................................ 15 2.4 Plane wave solution to the Klein-Gordon equation ...........................
    [Show full text]
  • The Quaternionic Commutator Bracket and Its Implications
    S S symmetry Article The Quaternionic Commutator Bracket and Its Implications Arbab I. Arbab 1,† and Mudhahir Al Ajmi 2,* 1 Department of Physics, Faculty of Science, University of Khartoum, P.O. Box 321, Khartoum 11115, Sudan; [email protected] 2 Department of Physics, College of Science, Sultan Qaboos University, P.O. Box 36, P.C. 123, Muscat 999046, Sultanate of Oman * Correspondence: [email protected] † Current address: Department of Physics, College of Science, Qassim University, Qassim 51452, Saudi Arabia. Received: 11 August 2018; Accepted: 9 October 2018; Published: 16 October 2018 Abstract: A quaternionic commutator bracket for position and momentum shows that the i ~ quaternionic wave function, viz. ye = ( c y0 , y), represents a state of a particle with orbital angular momentum, L = 3 h¯ , resulting from the internal structure of the particle. This angular momentum can be attributed to spin of the particle. The vector y~ , points in an opposite direction of~L. When a charged particle is placed in an electromagnetic field, the interaction energy reveals that the magnetic moments interact with the electric and magnetic fields giving rise to terms similar to Aharonov–Bohm and Aharonov–Casher effects. Keywords: commutator bracket; quaternions; magnetic moments; angular momentum; quantum mechanics 1. Introduction In quantum mechanics, particles are described by relativistic or non-relativistic wave equations. Each equation associates a spin state of the particle to its wave equation. For instance, the Schrödinger equation applies to the spinless particles in the non-relativistic domain, while the appropriate relativistic equation for spin-0 particles is the Klein–Gordon equation.
    [Show full text]
  • A CHARACTERISTIC SUBGROUP of a P-GROUP
    Pacific Journal of Mathematics A CHARACTERISTIC SUBGROUP OF A p-GROUP CHARLES RAY HOBBY Vol. 10, No. 3 November 1960 A CHARACTERISTIC SUBGROUP OF A p-GROVP CHARLES HOBBY If x, y are elements and H, K subsets of the p-group G, we shall denote by [x, y] the element y~px~p(xy)p of G, and by [H, K] the sub- group of G generated by the set of all [h, k] for h in H and k in K. We call a p-group G p-abelίan if (xy)p = xpyp for all elements x, y of G. If we let Θ(G) — [G, G] then #(G) is a characteristic subgroup of G and Gjθ{G) is p-abelian. In fact, Θ(G) is the minimal normal subgroup N of G for which G/AΓ is p-abelian. It is clear that Θ(G) is contained in the derived group of G, and G/Θ(G) is regular in the sense of P. Hall [3] Theorem 1 lists some elementary properties of p-abelian groups. These properties are used to obtain a characterization of p-groups G (for p > 3) in which the subgroup generated by the pth powers of elements of G coincides with the Frattini subgroup of G (Theorems 2 and 3). A group G is said to be metacyclic if there exists a cyclic normal sub- group N with G/N cyclic. Theorem 4 states that a p-group G, for p > 2, is metacyclic if and only if Gjθ(G) is metacyclic.
    [Show full text]
  • Categories, Functors, and Natural Transformations I∗
    Lecture 2: Categories, functors, and natural transformations I∗ Nilay Kumar June 4, 2014 (Meta)categories We begin, for the moment, with rather loose definitions, free from the technicalities of set theory. Definition 1. A metagraph consists of objects a; b; c; : : :, arrows f; g; h; : : :, and two operations, as follows. The first is the domain, which assigns to each arrow f an object a = dom f, and the second is the codomain, which assigns to each arrow f an object b = cod f. This is visually indicated by f : a ! b. Definition 2. A metacategory is a metagraph with two additional operations. The first is the identity, which assigns to each object a an arrow Ida = 1a : a ! a. The second is the composition, which assigns to each pair g; f of arrows with dom g = cod f an arrow g ◦ f called their composition, with g ◦ f : dom f ! cod g. This operation may be pictured as b f g a c g◦f We require further that: composition is associative, k ◦ (g ◦ f) = (k ◦ g) ◦ f; (whenever this composition makese sense) or diagrammatically that the diagram k◦(g◦f)=(k◦g)◦f a d k◦g f k g◦f b g c commutes, and that for all arrows f : a ! b and g : b ! c, we have 1b ◦ f = f and g ◦ 1b = g; or diagrammatically that the diagram f a b f g 1b g b c commutes. ∗This talk follows [1] I.1-4 very closely. 1 Recall that a diagram is commutative when, for each pair of vertices c and c0, any two paths formed from direct edges leading from c to c0 yield, by composition of labels, equal arrows from c to c0.
    [Show full text]
  • Commutator Groups of Monomial Groups
    Pacific Journal of Mathematics COMMUTATOR GROUPS OF MONOMIAL GROUPS CALVIN VIRGIL HOLMES Vol. 10, No. 4 December 1960 COMMUTATOR GROUPS OF MONOMIAL GROUPS C. V. HOLMES This paper is a study of the commutator groups of certain general- ized permutation groups called complete monomial groups. In [2] Ore has shown that every element of the infinite permutation group is itsself a commutator of this group. Here it is shown that every element of the infinite complete monomial group is the product of at most two commutators of the infinite complete monomial group. The commutator subgroup of the infinite complete monomial group is itself, as is the case in the infinite symmetric group, [2]. The derived series is determined for a wide class of monomial groups. Let H be an arbitrary group, and S a set of order B, B ^ d, cZ = ^0. Then one obtains a monomial group after the manner described in [1], A monomial substitution over H is a linear transformation mapping each element x of S in a one-to-one manner onto some element of S multi- plied by an element h of H, the multiplication being formal. The ele- ment h is termed a factor of the substitution. If substitution u maps xi into hjXj, while substitution v maps xό into htxt, then the substitution uv maps xt into hόhtxt. A substitution all of whose factor are the iden- tity β of H is called a permutation and the set of all permutations is a subgroup which is isomorphic to the symmetric group on B objects.
    [Show full text]
  • Commutator Theory for Congruence Modular Varieties Ralph Freese
    Commutator Theory for Congruence Modular Varieties Ralph Freese and Ralph McKenzie Contents Introduction 1 Chapter 1. The Commutator in Groups and Rings 7 Exercise 10 Chapter 2. Universal Algebra 11 Exercises 19 Chapter 3. Several Commutators 21 Exercises 22 Chapter 4. One Commutator in Modular Varieties;Its Basic Properties 25 Exercises 33 Chapter 5. The Fundamental Theorem on Abelian Algebras 35 Exercises 43 Chapter 6. Permutability and a Characterization ofModular Varieties 47 Exercises 49 Chapter 7. The Center and Nilpotent Algebras 53 Exercises 57 Chapter 8. Congruence Identities 59 Exercises 68 Chapter 9. Rings Associated With Modular Varieties: Abelian Varieties 71 Exercises 87 Chapter 10. Structure and Representationin Modular Varieties 89 1. Birkhoff-J´onsson Type Theorems For Modular Varieties 89 2. Subdirectly Irreducible Algebras inFinitely Generated Varieties 92 3. Residually Small Varieties 97 4. Chief Factors and Simple Algebras 102 Exercises 103 Chapter 11. Joins and Products of Modular Varieties 105 Chapter 12. Strictly Simple Algebras 109 iii iv CONTENTS Chapter 13. Mal’cev Conditions for Lattice Equations 115 Exercises 120 Chapter 14. A Finite Basis Result 121 Chapter 15. Pure Lattice Congruence Identities 135 1. The Arguesian Equation 139 Related Literature 141 Solutions To The Exercises 147 Chapter 1 147 Chapter 2 147 Chapter 4 148 Chapter 5 150 Chapter 6 152 Chapter 7 156 Chapter 8 158 Chapter 9 161 Chapter 10 165 Chapter 13 165 Bibliography 169 Index 173 Introduction In the theory of groups, the important concepts of Abelian group, solvable group, nilpotent group, the center of a group and centraliz- ers, are all defined from the binary operation [x, y]= x−1y−1xy.
    [Show full text]
  • Commutator Formulas
    Commutator formulas Jack Schmidt This expository note mentions some interesting formulas using commutators. It touches on Hall's collection process and the associated Hall polynomials. It gives an alternative expression that is linear in the number of commutators and shows how to find such a formula using staircase diagrams. It also shows the shortest possible such expression. Future versions could touch on isoperimetric inequalities in geometric group theory, powers of commutators and Culler's identity as well as its effect on Schur's inequality between [G : Z(G)] and jG0j. 1 Powers of products versus products of powers In an abelian group one has (xy)n = xnyn so in a general group one has (xy)n = n n x y dn(x; y) for some product of commutators dn(x; y). This section explores formulas for dn(x; y). 1.1 A nice formula in a special case is given by certain binomial coefficients: n (n) (n) (n) (n) (n) (n) (xy) = x 1 y 1 [y; x] 2 [[y; x]; x] 3 [[[y; x]; x]; x] 4 ··· [y; n−1x] n The special case is G0 is abelian and commutes with y. The commutators involved are built inductively: From y and x, one gets [y; x]. From [y; x] and x, one gets [[y; x]; x]. From [y; n−2x] and x, one gets [y; n−1; x]. In general, one would also need to consider [y; x] and [[y; x]; x], but the special case assumes commutators commute, so [[y; x]; [[y; x]; x]] = 1. In general, one would also need to consider [y; x] and y, but the special case assumes commutators commute with y, so [[y; x]; y] = 1.
    [Show full text]
  • GROUPS with MINIMAX COMMUTATOR SUBGROUP Communicated by Gustavo A. Fernández-Alcober 1. Introduction a Group G Is Said to Have
    International Journal of Group Theory ISSN (print): 2251-7650, ISSN (on-line): 2251-7669 Vol. 3 No. 1 (2014), pp. 9-16. c 2014 University of Isfahan www.theoryofgroups.ir www.ui.ac.ir GROUPS WITH MINIMAX COMMUTATOR SUBGROUP F. DE GIOVANNI∗ AND M. TROMBETTI Communicated by Gustavo A. Fern´andez-Alcober Abstract. A result of Dixon, Evans and Smith shows that if G is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian, then G itself has this property, i.e. the commutator subgroup of G has finite rank. It is proved here that if G is a locally (soluble-by-finite) group whose proper subgroups have minimax commutator subgroup, then also the commutator subgroup G0 of G is minimax. A corresponding result is proved for groups in which the commutator subgroup of every proper subgroup has finite torsion-free rank. 1. Introduction A group G is said to have finite rank r if every finitely generated subgroup of G can be generated by at most r elements, and r is the least positive integer with such property. It follows from results of V.V. Belyaev and N.F. Sesekin [1] that if G is any (generalized) soluble group of infinite rank whose proper subgroups are finite-by-abelian, then also the commutator subgroup G0 of G is finite. More recently, M.R. Dixon, M.J. Evans and H. Smith [4] proved that if G is a locally (soluble-by-finite) group in which the commutator subgroup of every proper subgroup has finite rank, then G0 has likewise finite rank.
    [Show full text]
  • Math 594: Homework 4
    Math 594: Homework 4 Due February 11, 2015 First Exam Feb 20 in class. 1. The Commutator Subgroup. Let G be a group. The commutator subgroup C (also denoted [G; G]) is the subgroup generated by all elements of the form g−1h−1gh. a). Prove that C is a normal subgroup of G, and that G=C is abelian (called the abelization of G). b). Show that [G; G] is contained in any normal subgroup N whose quotient G=N is abelian. State and prove a universal property for the abelianization map G ! G=[G; G]. c). Prove that if G ! H is a group homomorphism, then the commutator subgroup of G is taken to the commutator subgroup of H. Show that \abelianization" is a functor from groups to abelian groups. 2. Solvability. Define a (not-necessarily finite) group G to be solvable if G has a normal series feg ⊂ G1 ⊂ G2 · · · ⊂ Gt−1 ⊂ Gt = G in which all the quotients are abelian. [Recall that a normal series means that each Gi is normal in Gi+1.] a). For a finite group G, show that this definition is equivalent to the definition on problem set 3. b*). Show that if 1 ! A ! B ! C ! 1 is a short exact sequence of groups, then B if solvable if and only if both A and C are solvable. c). Show that G is solvable if and only if eventually, the sequence G ⊃ [G; G] ⊃ [[G; G]; [G; G]] ⊃ ::: terminates in the trivial group. This is called the derived series of G.
    [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]
  • Hamilton Equations, Commutator, and Energy Conservation †
    quantum reports Article Hamilton Equations, Commutator, and Energy Conservation † Weng Cho Chew 1,* , Aiyin Y. Liu 2 , Carlos Salazar-Lazaro 3 , Dong-Yeop Na 1 and Wei E. I. Sha 4 1 College of Engineering, Purdue University, West Lafayette, IN 47907, USA; [email protected] 2 College of Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61820, USA; [email protected] 3 Physics Department, University of Illinois at Urbana-Champaign, Urbana, IL 61820, USA; [email protected] 4 College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310058, China; [email protected] * Correspondence: [email protected] † Based on the talk presented at the 40th Progress In Electromagnetics Research Symposium (PIERS, Toyama, Japan, 1–4 August 2018). Received: 12 September 2019; Accepted: 3 December 2019; Published: 9 December 2019 Abstract: We show that the classical Hamilton equations of motion can be derived from the energy conservation condition. A similar argument is shown to carry to the quantum formulation of Hamiltonian dynamics. Hence, showing a striking similarity between the quantum formulation and the classical formulation. Furthermore, it is shown that the fundamental commutator can be derived from the Heisenberg equations of motion and the quantum Hamilton equations of motion. Also, that the Heisenberg equations of motion can be derived from the Schrödinger equation for the quantum state, which is the fundamental postulate. These results are shown to have important bearing for deriving the quantum Maxwell’s equations. Keywords: quantum mechanics; commutator relations; Heisenberg picture 1. Introduction In quantum theory, a classical observable, which is modeled by a real scalar variable, is replaced by a quantum operator, which is analogous to an infinite-dimensional matrix operator.
    [Show full text]