Presentation is loading. Please wait.

Presentation is loading. Please wait.

How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:"— Presentation transcript:

1 How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:

2 What is the next step in the proof? (a) Closed: (b) Show A n is a subgroup of S n. (c) Assume o(S n ) = n! (d) Nonempty:

3 What is the next step in the proof? (a) Let a, b  H(b) Let f, g  A n (c) Let f, g  S n (d) Let a*b  H (e) Let f  g  A n (f) Let f  g  S n

4 What is the next step in the proof? (a) Identity: (b) Associative: (c) Inverses: (d) Nonempty:

5 What is the next step in the proof? (a) Let a  H(b) Let f  A n (c) Let f  S n (d) Let a -1  H (e) Let f -1  A n (f) Let f -1  S n

6 How many elements does S 5 have? (a) 5(b) 10(c) 20(d) 60 (e) 120(f) 200(g) 500(h) 546

7 How many elements does A 5 have? (a) 5(b) 10(c) 20(d) 60 (e) 120(f) 200(g) 500(h) 546

Download ppt "How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:"

Similar presentations

If R = {(x,y)| y = 3x + 2}, then R -1 = (1) x = 3y + 2 (2) y = (x – 2)/3 (3) {(x,y)| y = 3x + 2} (4) {(x,y)| y = (x – 2)/3} (5) {(x,y)| y – 2 = 3x} (6)

If R = {(x,y)| y = 3x + 2}, then R -1 = (1) x = 3y + 2 (2) y = (x – 2)/3 (3) {(x,y)| y = 3x + 2} (4) {(x,y)| y = (x – 2)/3} (5) {(x,y)| y – 2 = 3x} (6)
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
 Definition 16: Let H be a subgroup of a group G, and let a  G. We define the left coset of H in G containing g,written gH, by gH ={g*h| h  H}. Similarity.

 Definition 16: Let H be a subgroup of a group G, and let a  G. We define the left coset of H in G containing g,written gH, by gH ={g*h| h  H}. Similarity.
Algebraic Structures: Group Theory II

Algebraic Structures: Group Theory II
Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.

Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.
If H is the subgroup in Z 12, then H2 = (a) 5(b) 14 (c) {3, 6, 9, 0}  {2}(d) {5, 8, 11, 2} (e) {5, 6, 9, 0}(f) {3, 2, 5}

If H is the subgroup in Z 12, then H2 = (a) 5(b) 14 (c) {3, 6, 9, 0}  {2}(d) {5, 8, 11, 2} (e) {5, 6, 9, 0}(f) {3, 2, 5}
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.

1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Binary Operations.

Binary Operations.
Assume f: A  B and g: B  C are functions. Which are defined? (1) f  g (2) g  f(3) both(4) neither.

Assume f: A  B and g: B  C are functions. Which are defined? (1) f  g (2) g  f(3) both(4) neither.
Permutations and Inverses. Definition Let A be a set. If f : A  A is a 1-1 correspondence then f is called a permutation of A. Notation: S(A): the set.

Permutations and Inverses. Definition Let A be a set. If f : A  A is a 1-1 correspondence then f is called a permutation of A. Notation: S(A): the set.
Is ℤ 6 a cyclic group? (a) Yes (b) No. How many generators are there of ℤ 6 ? 1 2 3 4 5 6 7 8 9 10.

Is ℤ 6 a cyclic group? (a) Yes (b) No. How many generators are there of ℤ 6 ?
How do we start this proof? (a) Let x  gHg -1. (b)  (c) Assume a, b  H (d) Show Nonempty:

How do we start this proof? (a) Let x  gHg -1. (b)  (c) Assume a, b  H (d) Show Nonempty:
Find all subgroups of the Klein 4- Group. How many are there? 1 2 3 4 5 6 7 8 9 10.

Find all subgroups of the Klein 4- Group. How many are there?
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n + 4. 3.Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.

What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.

Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
What is entry A in the matrix multiplication: ( a) 1 (b) -2(c) 5 (d) 11(e) 13 (f) 0.

What is entry A in the matrix multiplication: ( a) 1 (b) -2(c) 5 (d) 11(e) 13 (f) 0.
Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.

Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.
1.3 – AXIOMS FOR THE REAL NUMBERS. Goals  SWBAT apply basic properties of real numbers  SWBAT simplify algebraic expressions.

1.3 – AXIOMS FOR THE REAL NUMBERS. Goals  SWBAT apply basic properties of real numbers  SWBAT simplify algebraic expressions.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.

Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Numbers, Operations, and Quantitative Reasoning.

Numbers, Operations, and Quantitative Reasoning.

Similar presentations

Ads by Google