Section 3 Isomorphic Binary Structures

Similar documents
Section 18 Rings and fields

Section 19 Integral domains

Algebraic Structures Exam File Fall 2013 Exam #1

Section 15 Factor-group computation and simple groups

Groups. Contents of the lecture. Sergei Silvestrov. Spring term 2011, Lecture 8

INTRODUCTION TO THE GROUP THEORY

3.4 Isomorphisms. 3.4 J.A.Beachy 1. from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair

Section 13 Homomorphisms

Homework #7 Solutions

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

and this makes M into an R-module by (1.2). 2

Lecture 3. Theorem 1: D 6

Lecture 7 Cyclic groups and subgroups

Abstract Algebra, HW6 Solutions. Chapter 5

A Little Beyond: Linear Algebra

MA441: Algebraic Structures I. Lecture 14

DISCRETE MATHEMATICS W W L CHEN

SCHOOL OF DISTANCE EDUCATION

Section 11 Direct products and finitely generated abelian groups

MATH 420 FINAL EXAM J. Beachy, 5/7/97

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

MA441: Algebraic Structures I. Lecture 15

Part IV. Rings and Fields

Modern Algebra Math 542 Spring 2007 R. Pollack Solutions for HW #5. 1. Which of the following are examples of ring homomorphisms? Explain!

EXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd

Math 546, Exam 2 Information.

MATH 430 PART 2: GROUPS AND SUBGROUPS

Rings, Integral Domains, and Fields

Rings and Fields Theorems

Joseph Muscat Universal Algebras. 1 March 2013

Math 103 HW 9 Solutions to Selected Problems

5 Group theory. 5.1 Binary operations

D-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.

Discrete Mathematics with Applications MATH236

Johns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm

Lecture 2. (1) Every P L A (M) has a maximal element, (2) Every ascending chain of submodules stabilizes (ACC).

Cosets, factor groups, direct products, homomorphisms, isomorphisms

RING ELEMENTS AS SUMS OF UNITS

1. Introduction to commutative rings and fields

CSIR - Algebra Problems

Econ Lecture 2. Outline

Finite Fields. Sophie Huczynska. Semester 2, Academic Year

Chapter 1. Wedderburn-Artin Theory

MATRIX LIE GROUPS AND LIE GROUPS

Section 33 Finite fields

Monoids. Definition: A binary operation on a set M is a function : M M M. Examples:

Math 547, Exam 1 Information.

B Sc MATHEMATICS ABSTRACT ALGEBRA

Direct Product of BF-Algebras

ENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.

Math 581 Problem Set 8 Solutions

Section II.1. Free Abelian Groups

Math 306 Topics in Algebra, Spring 2013 Homework 7 Solutions

MAT301H1F Groups and Symmetry: Problem Set 2 Solutions October 20, 2017

Abstract Algebra I. Randall R. Holmes Auburn University. Copyright c 2012 by Randall R. Holmes Last revision: November 11, 2016

Lecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay

Homework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?

Homework 3 MTH 869 Algebraic Topology

Well-Ordering Principle. Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element.

Outline. We will now investigate the structure of this important set.

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS

Homework #05, due 2/17/10 = , , , , , Additional problems recommended for study: , , 10.2.

Rough Anti-homomorphism on a Rough Group

Lecture 4.1: Homomorphisms and isomorphisms

Algebra homework 6 Homomorphisms, isomorphisms

Solutions for Practice Problems for the Math 403 Midterm

1. Introduction to commutative rings and fields

Algebra Homework, Edition 2 9 September 2010

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.

Classification of Root Systems

Written Homework # 4 Solution

First Semester Abstract Algebra for Undergraduates

Kevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings

(Think: three copies of C) i j = k = j i, j k = i = k j, k i = j = i k.

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION

MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

Functional Analysis HW #1

Combinatorics of p-ary Bent Functions

Sets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions

Factorization in Polynomial Rings

Finite Fields. Sophie Huczynska (with changes by Max Neunhöffer) Semester 2, Academic Year 2012/13

Application 3.2 (Ruzsa). Let α R and A be a finite non-empty set in a commutative group. Suppose that A + A α A. Then for all positive integers h 2

Group Isomorphisms - Some Intuition

Vector Spaces and Linear Transformations

Math 121 Homework 2 Solutions

Theorems and Definitions in Group Theory

1 Fields and vector spaces

Algebra Exercises in group theory

13 More on free abelian groups

Some practice problems for midterm 2

1. (7 points)state and PROVE Cayley s Theorem.

Fields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.

book 2005/1/23 20:41 page 132 #146

Equivalence Relations and Partitions, Normal Subgroups, Quotient Groups, and Homomorphisms

PROBLEMS FROM GROUP THEORY

Homework 10 M 373K by Mark Lindberg (mal4549)

(Rgs) Rings Math 683L (Summer 2003)

Transcription:

Section 3 Isomorphic Binary Structures Instructor: Yifan Yang Fall 2006

Outline Isomorphic binary structure An illustrative example Definition Examples Structural properties Definition and examples Identity element

An illustrative example Let ζ = e 2πi/3 be a 3rd root of unity. Consider the following two binary structures Z 3, + 3 and U 3,. The tables of Z 3, + 3 and U 3, are given by + 3 0 1 2 0 0 1 2 1 1 2 0 2 2 0 1 + 3 1 1 2 1 1 1 2 1 1 2 1 2 2 1 1 + 3 1 ζ 2 1 1 ζ 2 ζ ζ 2 1 1 ζ ζ 2 1 1 ζ ζ 2 ζ ζ ζ 2 1 ζ 2 ζ 2 1 ζ 1 ζ ζ 2 1 1 ζ ζ 2 ζ ζ ζ 2 1 ζ 2 ζ 2 1 ζ 1 ζ ζ 2 1 1 ζ ζ 2 ζ ζ ζ 2 1

An example This shows that Z 3, + 3 and U 3, have the same algebraic structure. (For example, we have (first element) (second element) = (second element) (third element) (second element) = (first element) and so on.) In mathematics, we say these two binary structures are isomorphic.

Isomorphic binary structures Definition Let S, and S, be two binary algebraic structures. An isomorphism of S with S is a one-to-one function mapping S onto S such that φ(x y) = φ(x) φ(y) for all x, y S (homomorphism property). If such a map φ exists, then S, and S, are isomorphic binary structures, which we denote by S S, deleting and from the notation.

Examples of isomorphic binary structures Example The binary structure R, + is isomorphic to R +,. Proof. We claim that φ : R R + defined by φ(x) = e x satisfies 1. one-to-one, 2. onto, 3. φ(x + y) = φ(x) φ(y) for all x, y R. Proof of Claim 1. If φ(x) = φ(y), then e x = e y and x = y. Proof of Claim 2. For r R +, let x = ln r. Then φ(x) = e ln r = r. Proof of Claim 3. Easy.

Examples of isomorphic binary structures Example The binary structures Z, + and 2Z, + are isomorphic. Proof. We claim that φ : Z 2Z defined by φ(n) = 2n satisfies 1. one-to-one, 2. onto, 3. φ(m + n) = φ(m) + φ(n) for all m, n Z. Proof of Claim 1. If φ(m) = φ(n), then 2m = 2n and m = n. Proof of Claim 2. For n 2Z, we have n = 2m for some integer m. Then φ(m) = 2m = n. Proof of Claim 3. Easy.

Remarks 1. Given two isomorphic binary structures S, and S,, there may be more than one isomorphisms between them. For the first example, any positive real number a 1 will define an isomorphism φ a : x a x between R, + and R +,. For the second example, the function ψ(n) = 2n is also an isomorphism. 2. The second example also shows that an infinite set can be isomorphic to a proper subset with the induced binary operation.

Examples of non-isomorphic binary structures 1. The binary structures Q, + and R, + can not be isomorphic because Q and R have different cardinalities. 2. The binary structures Q, + and Z, + are not isomorphic even though they have the same cardinality. To see this, observe that the equation x + x = c has a solution for every c in Q, but this is not the case in Z. (Suppose that φ : Q Z is an isomorphism. Let r Q be the element such that φ(r) = 1. Then φ(r/2) + φ(r/2) = φ(r) = 1. Thus, φ(r/2) = 1/2, but it is not in Z.)

Examples of non-isomorphic binary structures 1. The binary structures Z, and 2Z, are not isomorphic, even though Z, + and 2Z, + are isomorphic. This is because in Z, there is an element e = 1 such that e n = n for all n Z, but there is no such element e in 2Z satisfying e n = n for all n in 2Z. Suppose that φ is an isomorphism between S, and S,. If e is an element in S such that e s = s for all s S, then for all s S we have s = φ(s) for some s S and then φ(e) s = φ(e) φ(s) = φ(e s) = φ(s) = s. That is, the element e = φ(e) satisfies e s = s for all s S. 2. The binary structures R, and C, are not isomorphic. This is because in C, the equation x x = c has solutions for all c C, but in R, the equation x x = c have no solutions in R when c < 0.

In-class exercises Determine whether the given map φ is an isomorphism of the first binary structure with the second. 1. Z, + with Z, +, where φ(n) = n for n Z. 2. Z, + with Z, +, where φ(n) = 2n for n Z. 3. Q, + with Q, +, where φ(r) = r/2 for r Q.

Structural properties Definition A structural property of a binary structure is one that must be shared by any isomorphic structure. Example The following properties are structural. 1. The set has 4 elements. 2. The operation is commutative. 3. x x = x for all x S. 4. The equation a x = b has a solution in S for all a, b S. 5. The equation x x = s has a solution in S for all s S. 6. There is an element e in S such that e s = s for all s S.

Examples of non-structural properties Example The following properties are non-structural. 1. The set S is a subset of C. 2. The number 4 is an element. 3. The operation is called addition. 4. The elements of S are matrices. In-class exercises 1. Give a few more structural properties. 2. Prove that they are indeed structural properties.

Identity element Definition (3.12) Let S, be a binary structure. An element e of S is an identity element for if e s = s e = s for all s S. Example 1. In Z, +, the element 0 is an identity element. 2. In Z,, the element 1 is an identity element. 3. In Z n,, the element 1 is an identity element. 4. In M 2 (R), + (the set of all 2 2 matrices with entries in R), the zero matrix is an identity element.

Identity element Theorem (3.13) A binary structure S, has at most one identity element. That is, if there is an identity element, then it is unique. Proof. Suppose that e and e are both identity elements. Consider e e. On the one hand, since e is an identity element, we have e e = e. On the other hand, because e is an identity element, we have We conclude that e = e. e e = e.

Identity element Theorem (3.14) Suppose that S, has an identity element e for. If φ : S S is an isomorphism of S, with S,, then φ(e) is an identity element for. proof We need to show that for all s S. φ(e) s = s φ(e)

Identity element Proof of Theorem 3.14 (continued) Since φ is an isomorphism, φ is onto. Thus, there exists s S such that φ(s) = s. Then φ(e) s = φ(e) φ(s). Now, by the assumption that φ is an isomorphism again, we have φ(e) φ(s) = φ(e s). It follows that φ(e) s = φ(e s) = φ(s) = s. By the same token, we can also show that s φ(e) = s. We conclude that φ(e) is an identity element.

Homework Do Problems 4, 6, 8, 16, 18, 26, 28, 30, 33 of Section 3.