TEST 1 Flashcards

1
Q

Relation from set A to set B

A

a subset R of AxB

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

Properties of a relation R on a set A

A

R is reflexive if aRa for all a in A
R is symmetric if aRb then bRa for all a,b in A
R is transitive if aRb and bRc then aRc for all a,b,c in A

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

Equivalence Relation on a set A

A

a relation on A that is reflexive, symmetric, and transitive

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

Equivalence Class of s in set S under equivalence relation ~

A

[s] = {x in S | x ~ s} where S is a set and ~ is an equivalence relation on S.

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

Binary Operation on set S

A

a function *: SxS -> S

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

Commutative Binary Operation * on set S

A

s * t = t * s for all s,t in set S

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

Associative Binary Operation * on set S

A

(a * b) * c = a * (b * c) for all a,b,c in set S

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

Closed Under Binary Operation *

A

Let T be a subset of set S and * a binary operation on S. Then t1 * t2 is in T for all t1,t2 in T.

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

Group

A

an ordered pair (G, *) such that

    • is a binary operation on the set G
    • is associative on G
  1. There exists an element e (identity) in G such that e * x = x and x * e = x for every x in G.
  2. For every x in G there exists y (inverse of x) in G such that x * y = e and y * x = e.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Abelian group

A

a group with a commutative binary operation

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

Binary Algebraic Structure

A

(S, *) where * is a binary operation on a set S

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

Isomorphism from (S1, *) to (S2, *’)

A

a function f: S1->S2 satisfying:

  1. f is bijective (injective/1-1 and surjective/onto)
  2. f(a) *’ f(b) = f(a * b) for all a,b in S1
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Structural Properties

A
  1. operation is commutative
  2. operation is associative
  3. cardinality of the set (ex. set has 11 elements)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Supgroup

A

a subset H of G where (G, * ) is a group such that H is also a group with the “same” binary operation

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

Criterion to be a Subgorup

A

Suppose (G, * ) is a group and H is a subset of G.

  1. H is closed under * (h1,h2 in H implies h1 * h2 in H)
  2. e is in H
  3. If h is in H, then h^(-1) is in H (H is closed under inverses)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Cyclic group G

A

there exists g in G such that =G

NOTE: g is a generator of G (***there is usually more than one generator)

17
Q

Cyclic Subgroup Generated by g

A

Given G a group and g in G:

H = {g^n | n is an integer} = is a subgroup of G

18
Q

Division Algorithm

A

Let m be a positive integer. For every n in Z there exist unique integers q,r satisfying n = mq + r for 0<=r<=m

19
Q

Order of a group G

A

the cardinality of a group G, |G|

20
Q

Order of an element g of group G

A

the smallest positive integer n such that g^n = e, if such n exists, otherwise it is infinity. (where g is an element of group G)

21
Q

Greatest Common Divisor

A

If a,b in Z, not both 0, the greatest common divisor of a and b is GCD(a,b)

22
Q

Bezout’s Theorem

A

If a,b in Z, not both zero, there exist integers x,y such that GCD(a,b)=ax+by

23
Q

Relatively Prime

A

two integers a,b are relatively prime if GCD(a,b)=1

24
Q

Cayleys Theorem

A

Suppose G is a finite group of order n. Then G is isomorphic to a subgroup of Sn

25
Q

Transposition

A

A transposition in Sn is a permutation of the form (a,b)

26
Q

Even Permutation

A

a permutation is even if it can be written as a product of an even number of transpositions

27
Q

Orbits

A

Equivalence classes under ~ are called orbits of sigma

28
Q

Cycle Structure

A

the cycle structure of a permutation pi is the number of cycles of pi and the lengths of its cycles

29
Q

Conjugate to H

A

If G is a group and g,h in G, then g is conjugate to h if there exists x in G such that g = xh(x^-1)

30
Q

Alternating Group

A

The alternating group on n symbols is An={pi in Sn | pi is even}