Algebra 2 Notes 2 Flashcards

1
Q

(2D-N1-2.1) A group - and everything with it inc. Abelian or Commutative. Closed Binary Operation

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

(2L-N1-2.2) if ⋆ is an associative binary operation on a set S, then for any x1, …, xn ∈ S, any bracketing of x1 ⋆ x2 ⋆ … ⋆ xn yields the same answer.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

(2L-N1-2.3) If ⋆ is a binary operation on a set G and e and f are both identity elements, then e = f.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

(2L-N2-2.4) Let G be a set, ⋆ be an associative binary operation on G which has an identity element e. Then if both g and h are inverses of an element f ∈ G, then g = h.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

(2L-N2-2.5) For any element g of a group G,(i) (g−1)−1 = g, (ii) (g ⋆ h)−1 = h−1 ⋆ g−1

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

(2D-N2-2.6) Define g2 = gg, g3 = ggg, etc Also define g−n = (g−1)^n(n ∈ N) and g0 = e.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

(2L-N2-2.7) For any m,n ∈ Z, usual rules for indices hold

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

(2P-N2-2.8) i) If f,g,h ∈ G, a group, and fg = fh then g = h (ii)Let G be a group and g1 ∈G. Then g1G={g1x:x∈G} contains each element of G exactly once. In particular if G consists of a finite number of elements g1, …, gn, then the list gg1, gg2, …, ggn is just re-ordering of g1, …, gn.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

(2R-N3-) Representing a group with a group table

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

(2L-N4-2.9) Let X be a set and let S(X) = {f : X −→ X s.t. f is bijective} Let ◦ be composition of functions. Then S(X) is a group under ◦.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

(2D-N4-2.10) If X = {1, 2, …n}, the group S(X) is normally denoted Sn and called the symmetric group; elements of Sn are called …Define formally integers mod m

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

(2T-N4-2.11) (a) For any integer m, Zm under addition forms an abelian group. (b) For any prime p, Z∗p, the set of non-zero elements of Zp under multiplication, forms an abelian group.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

(2D-N5-2.12) (i) An isometry of the plane R^2. (ii) If T is any set of points of the plane, then Sym(T) …

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

(2L-N5-2.13) Sym(T) under composition forms a group.

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

(2D-N6-2.14) Order of group, element

A

-

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

(2L-N6-2.15) Let G be a group, and g ∈ G with o(g) = n. Then (i)gm =e⇔n divides m. (ii) any power of g is equal to exactly one of the elements of the set {e, g, g2, …, gn−1}.

A

-

17
Q

(2D-N6-2.16) G generated by g. G cyclic.

A

-

18
Q

(2L-N6-2.17) Let G be a finite group of order n. Then G is cyclic if and only if it contains an element of order n.

A

-

19
Q

(2D-N6-2.18) Let G be a cyclic group, generated by g. If o(g) = n then the distinct elements of G are e, g, g2, g3, …, gn−1 and G is … (ii) If o(g) = ∞, …

A

-

20
Q

(2R-N7-) Z under + is isomorphic to C∞

A

-

21
Q

(2D-N7-2.19) H subgroup. Example w/ permutations

A

-

22
Q

(2L-N7-2.20) Let G be a group and H a subset of G. H is a subgroup of G if it forms a group under the same operations as G (i.e. the same multiplication which implies also the same identity element and the same inverses).

A

-

23
Q

(2T-N7-2.21) Let An denote the set of even permutations in Sn. Then An forms a subgroup of Sn, of order n!/2, called the alternating group.

A

-

24
Q

(2T-N8-2.22) Lagrange’s Theorem

A

-

25
Q

(2C-N8-2.25) Let g ∈ G, where G is a finite group. Then o(g) divides |G|.

A

-

26
Q

(2C-N9-2.26) Let G be a group of order p, where p is a prime. Then G is cyclic of order p.

A

-

27
Q

(2T-N9-2.27) Fermat’s Little Theorem.

A

-

28
Q

(2D-N10-2.3) Group Homomorphism

A

-

29
Q

(2D-N10-2.31) Let φ : G −→ H be a group homomorphism. Then the kernel of φ is

A

-

30
Q

(2P-N10-2.32) Let φ : G −→ H be a group homomorphism. Then (i) φ is injective if and only if Ker(φ) = {e}. (ii) φ is surjective if and only if Im(φ) = H.

A

-

31
Q

(2D-N11-2.33) Let φ : G −→ H be a group homomorphism. If φ is bijective…

A

-

32
Q

(2E-N11-) Some example of isomorphic groups

A

-