Ch 1-6 Flashcards

1
Q

What is a relation from set A to set B?

A

A relation is a subset from A x B

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

What is a function from set A to set B?

A

A function is a relation satisfying the following properties:

Dom(f)=A

For all x€A and y,z€B if (x,y)€f and (x,z)€f
then y=z

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

What is a binary operation on a set S?

A

A function from S x S * S. In other words, it is a function from S x S to S.

Ex: addition and mult. on: N, Z, Q, R, C

Must be every and well defined as well as closed by definition.

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

What does it mean if an operation is not everywhere defined?

A

If some element of S x S is not assigned anywhere then the operation is not everywhere defined.

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

What does it mean that an operation is not well defined?

A

If an element of S x S is assigned to more than one place then the operation is not well defined.

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

What does it mean if an operation is closed?

A

If all assigned elements are elements of S then S is closed under the operation.

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

What does it mean if an operation is associative on a set S?

A

For all a,b,c€S (ab)c=a(bc)

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

What does it mean if an operation is commutative on a set S?

A

For all a,b€S ab=ab

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

What does it mean if a function f is 1-1?

A

If f is a function from A to B, for all a,b€A, if f(a)=f(b) then a=b

To prove: choose two elements of A, assume f(a)=f(b) and show a=b

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

What does it mean that a function (f) is onto?

A

A function from A to B is onto if for all b€B there’s exists an a€A such that f(a)=b

To prove:

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

What is a group?

A

A set G closed under a binary operation * defined on G such that:
For all a,b,c€g (ab)c=a(bc) (associative)

For all a€G, there exists e€G s.t. ae=ea=a
(identity element of G)

For all a€G, there exists an a’€G such that
aa’=a’a=e where e is the identity element of
G (*-inverse)

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

What is left and right cancellation for a group ?

A

If ab=ac then b=c (left)

If ba=ca then b=c (right)

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

Hat is a subgroup?

A

If G is a group, then H is a subgroup iff
For all a,b€H, ab€H
e€H (where e is the identity of G)
For all a€H, a’€H (where a’ is the inverse)

To prove: assume G is a group and H is a subset of G, check three properties above.
Then assume G is a group and H is a subgroup of G, check the three properties of a group for H.

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

What does it mean that a group is abelian?

A

For all a,b€G, if ab=ba (commutative) then G is an abelian group.

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

What does it mean that a group is cyclic?

A

For a group G there exists an a€G such that <a>=G</a>

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

What is the decision algorithm?

A

If a,b€Z(integers) and b does not = 0 then there exists q,r€Z s.t. a=bq+r and 0 <= r < |b|