Chapter 5 Flashcards

Mappings & Binary Operations (16 cards)

1
Q

mapping/function

A

A mapping or function α : A → B is a rule that assigns to every element a of A exactly one element α(a) of B
- well defined or function property of a rule.

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

domain

A

A is called the domain of the mapping α written D(α).

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

image

(element)

A

α(a) is called the image of element a.

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

image

(mapping)

A

α(A) = {α(a)|a ∈ A} = Im(α) is called the range or image of mapping α.
Im(α) is a subset of B.

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

graph

A

Graph of G is G(α) = {(a, b)|a ∈ A, b ∈ B and b ∈ α(a)} = {(a, α(a))|a ∈ A}.

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

binary operation

A

If A = S × S and B = S then the mapping is a binary operation on the set S.

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

well defined mapping

(create)

A

(i) Specifying the domain A and the co-domain B of α.
(ii) Specifying exactly one element α(a) for each a in A.

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

equal mapping

A

α : A → B and β : A → B are equal if and only if α(a) = β(a) for each a ∈ A.

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

identity mapping

A

α : A → B is called the identity mapping if α(a) = a for each a in A and is denoted by 1A.
Obviously A ⊆ B in this case.

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

injective mapping

A

α : A → B is said to be injective or one-to one if α(a) = α(b) implies that a = b.
(the horizontal line test)

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

surjective mapping

A

α : A → B is onto or surjective if for each b ∈ B we can find a ∈ A such that α(a) = b.
That is B = Im(α).

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

composition mapping

A

Given α : A → B and β : B → C, then the composition mapping βα : A → C is defined by βα(a) = β(α(a)) for all a ∈ A.
αβ DNE in this case.
Note: associative but not commutative.

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

inverse mapping

A

If α : A → B is a mapping , a mapping β : B → A is called inverse of α if βα = 1A and αβ = 1B. We say the mapping α is invertible.
Note β(b) = a iff α(a) = b.
If β exists it is unique and we can write it as α^(−1).

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

numerically equivalent mapping

A

If α : A → B is a bijection and A and B are both finite, then |A|=|B|, hence we say A and B are numerically equivalent

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

one-to-one
correspondence

A

If there exists a bijection from set A onto set B , we say A and B are in one-to-one correspondence

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

Invertibility Theorem

A

A mapping α : A → B is invertible if and only if it is a bijection.
Thus if α : A → B is a bijection then α−1 exists as a mapping from B to A and this inverse is unique. Further if a mapping is invertible then it is a bijection.