(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.


 Frederick Dalton
 1 years ago
 Views:
Transcription
1 11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4. This group is not cyclic since no element can generate the whole group List the elements of Z 3 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 3 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 3; (1, 1) : order 12; (1, 2) : order 6; (1, 3) : order 12; (2, 0) : order 3; (2, 1) : order 12; (2, 2) : order 6; (2, 3) : order 12. This group is cyclic since it can be generated by either of the elements (1, 1), (1, 3), (2, 1), and (2, 3). 18
2 11.13 Disregarding the order of the factors, write direct products of two or more groups of the form Z n so that the resulting product is isomorphic to Z 60 in as many ways as possible. Solution: There are 4 different ways: Z 60 = Z 2 2 Z 3 Z 5 = Z 4 Z 3 Z 5, Z 60 = Z Z 5 = Z 12 Z 5, Z 60 = Z Z 3 = Z 20 Z 3, Z 60 = Z 2 2 Z 3 5 = Z 4 Z a. The cyclic subgroup of Z 24 generated by 18 has order 4. b. Z 3 Z 4 is of order 12. c. The element (4, 2) of Z 12 Z 8 has order 12. d. The Klein 4group is isomorphic to Z 2 Z 2. e. Z 2 Z Z 4 has 8 elements of finite order Find the maximum possible order for some element of Z 4 Z 6. Solution: (1, 1) in Z 4 Z 6 has the maximum order lcm(4, 6) = Are the groups Z 8 Z 10 Z 24 and Z 4 Z 12 Z 40 isomorphic? Why or why not? Solution: We decompose both groups into indecomposible ones: Z 8 Z 10 Z 24 Z 8 (Z 2 Z 5 ) (Z 8 Z 3 ) = Z 2 (Z 8 ) 2 Z 3 Z 5, Z 4 Z 12 Z 40 Z 4 (Z 4 Z 3 ) (Z 8 Z 5 ) = (Z 4 ) 2 Z 8 Z 3 Z 5. So they are not isomorphic How many abelian groups (up to isomorphism) are there of order 24? of order 25? of order (24)(25)? Solution: 24 = = = So there are 3 abelian groups of order 24: Z 2 3 Z 3, Z 2 Z 2 2 Z 3, Z 2 Z 2 Z 2 Z = 5 2 = 5 5. So there are 2 abelian groups of order 25: Z 5 2, Z 5 Z 5. 19
3 Because gcd(24, 25) = 1, there are 3 2 = 6 abelian groups of order (24)(25): Z 2 3 Z 3 Z 5 2, Z 2 3 Z 3 Z 5 Z 5, Z 2 Z 2 2 Z 3 Z 5 2, Z 2 Z 2 2 Z 3 Z 5 Z 5, Z 2 Z 2 Z 2 Z 3 Z 5 2, Z 2 Z 2 Z 2 Z 3 Z 5 Z Mark each of the following true or false: a. (T) If G 1 and G 2 are any groups, then G 1 G 2 is always isomorphic to G 2 G 1. b. (T) Computation in an external direct product of groups is easy if you know how to compute in each component group. c. (F) Groups of finite order must be used to form an external direct product. d. (T) A group of prime order could not be the internal direct product of two proper nontrivial subgroups. e. (F) Z 2 Z 4 is isomorphic to Z 8. f. (F) Z 2 Z 4 is isomorphic to 8. g. (F) Z 3 Z 8 is isomorphic to 4. h. (F) Every element in Z 4 Z 8 has order 8. i. (F) The order of Z 12 Z 15 is 60. j. (T) Z m Z n has mn elements whether m and n are relatively prime or not a. How many subgroups of Z 5 Z 6 are isomorphic to Z 5 Z 6? Solution: No subgroup of Z 5 Z 6 is isomorphic to Z 5 Z 6. b. How many subgroups of Z Z are isomorphic to Z Z? Solution: There are infinite many subgroups of Z Z that are isomorphic to Z Z. They are of the form mz nz for positive integers m and n with m 1 or n Mark each of the following true or false: 20
4 a. (T) Every abelian group of prime order is cyclic. b. (F) Every abeliang roup of prime power order is cyclic. c. (F) Z 8 is generated by {4, 6}. d. (T) Z 8 is generated by {4, 5, 6}. e. (T) All finite abelian groups are classified up to isomorphism by Theorem f. (F) Any two finitely generated abelian gruops witht he same Betti number are isomorphic. g. (T) Every abelian group of order divisible by 5 contains a cyclic subgroup of order 5. h. (F) Every abelian group of order divisible by 4 contains a cyclic subgroup of order 4. i. (T) Every abelian group of order divisible by 6 contains a cyclic subgroup of order 6. j. (T) Every finite abelian group has a Betti number of Prove that a direct product of abelian groups is abelian. Solution: Suppose G i are abelian groups. We prove that n i=1 G i is an abelian group. Let (a 1,, a n ) and (b 1,, b n ) be elements of n i=1 G i. Then (a 1,, a n )(b 1,, b n ) = (a 1 b 1,, a n b n ) = (b 1 a 1,, b n a n ) = (b 1,, b n )(a 1,, a n ). This shows that the binary operation on n i=1 G i is commutative. So n i=1 G i is an abelian group Let G be an abelian group. Let H be the subset of G consisiting of the identity e together with all elements of G of order 2. Show that H is a subgroup of G. Solution: We show that H meets the criteria of a subgroup of G: 1. (Closed) If a, b H, then a 2 = b 2 = e. So (ab) 2 = a 2 b 2 = e. This implies that ab H. 2. (Identity) The identity is in H by definition. 21
5 3. (Inverse) If a H, then a 2 = e and so a 1 = a H. Therefore, H is a subgroup of G Prove that if a finite abelian group has order a power of a prime p, then the order of every element in the group is a power of p. Can the hypothesis of commutativity be dropped? Why, or why not? Solution: Suppose a group G has the order p k for some prime p and some positive integer k. Then the order m of every element a of G divides the order p k of G. So m = p r for some integer 0 r k. That is, the order of a is a power of p. The hypothesis of commutativity can be dropped, since we do not use the commutativity in the above argument. 22
= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More informationG = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
More informationMODULES OVER A PID KEITH CONRAD
MODULES OVER A PID KEITH CONRAD Every vector space over a field K that has a finite spanning set has a finite basis: it is isomorphic to K n for some n 0. When we replace the scalar field K with a commutative
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationMath 2001 Homework #10 Solutions
Math 00 Homework #0 Solutions. Section.: ab. For each map below, determine the number of southerly paths from point to point. Solution: We just have to use the same process as we did in building Pascal
More informationDoug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
More informationMEP Y9 Practice Book A
1 Base Arithmetic 1.1 Binary Numbers We normally work with numbers in base 10. In this section we consider numbers in base 2, often called binary numbers. In base 10 we use the digits 0, 1, 2, 3, 4, 5,
More information8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS
8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS PETE L. CLARK 1. Basic definitions An integral binary quadratic form is just a polynomial f = ax 2 + bxy + cy 2 with a, b, c Z. We define the discriminant
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More information1. Graphing Linear Inequalities
Notation. CHAPTER 4 Linear Programming 1. Graphing Linear Inequalities x apple y means x is less than or equal to y. x y means x is greater than or equal to y. x < y means x is less than y. x > y means
More informationHow many numbers there are?
How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationSome Basic Techniques of Group Theory
Chapter 5 Some Basic Techniques of Group Theory 5.1 Groups Acting on Sets In this chapter we are going to analyze and classify groups, and, if possible, break down complicated groups into simpler components.
More informationInversion. Chapter 7. 7.1 Constructing The Inverse of a Point: If P is inside the circle of inversion: (See Figure 7.1)
Chapter 7 Inversion Goal: In this chapter we define inversion, give constructions for inverses of points both inside and outside the circle of inversion, and show how inversion could be done using Geometer
More informationIf A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?
Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question
More informationSwitching Algebra and Logic Gates
Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design
More information2 Polynomials over a field
2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special
More informationIntroduction to. Hypothesis Testing CHAPTER LEARNING OBJECTIVES. 1 Identify the four steps of hypothesis testing.
Introduction to Hypothesis Testing CHAPTER 8 LEARNING OBJECTIVES After reading this chapter, you should be able to: 1 Identify the four steps of hypothesis testing. 2 Define null hypothesis, alternative
More informationModules and Cohomology over Group Algebras: One Commutative Algebraist s Perspective
Trends in Commutative Algebra MSRI Publications Volume 51, 2004 Modules and Cohomology over Group Algebras: One Commutative Algebraist s Perspective SRIKANTH IYENGAR Abstract. This article explains basic
More informationSelecting a Subset of Cases in SPSS: The Select Cases Command
Selecting a Subset of Cases in SPSS: The Select Cases Command When analyzing a data file in SPSS, all cases with valid values for the relevant variable(s) are used. If I opened the 1991 U.S. General Social
More informationTwoSided Matching Theory
TwoSided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of TwoSided Matching To see which results are robust, we will look at some increasingly general models. Even before we
More informationPRIMES is in P. Manindra Agrawal Neeraj Kayal Nitin Saxena
PRIMES is in P Manindra Agrawal Neeraj Kayal Nitin Saxena Department of Computer Science & Engineering Indian Institute of Technology Kanpur Kanpur208016, INDIA Email: {manindra,kayaln,nitinsa}@iitk.ac.in
More informationx 2 x 2 cos 1 x x2, lim 1. If x > 0, multiply all three parts by x > 0, we get: x x cos 1 x x, lim lim x cos 1 lim = 5 lim sin 5x
Homework 4 3.4,. Show that x x cos x x holds for x 0. Solution: Since cos x, multiply all three parts by x > 0, we get: x x cos x x, and since x 0 x x 0 ( x ) = 0, then by Sandwich theorem, we get: x 0
More informationIntroduction to finite fields and their applications
Introduction to finite fields and their applications RUDOLF LIDL University of Tasmania, Hobart, Australia HARALD NIEDERREITER Austrian Academy of Sciences. Vienna, Austria ree'wi d18e U,l,muy of W, t
More informationSome notes on group theory.
Some notes on group theory. Eef van Beveren Departamento de Física Faculdade de Ciências e Tecnologia P COIMBRA (Portugal) February Contents Some intuitive notions of groups.. What is a group?..............................
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationSemiSimple Lie Algebras and Their Representations
i SemiSimple Lie Algebras and Their Representations Robert N. Cahn Lawrence Berkeley Laboratory University of California Berkeley, California 1984 THE BENJAMIN/CUMMINGS PUBLISHING COMPANY Advanced Book
More informationRandom matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs
Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs Jeong Han Kim Microsoft Research One Microsoft Way Redmond, WA 9805 USA jehkim@microsoft.com Nicholas
More information