Chapter 5 definitions Flashcards

To understand all of the definitions pertaining to identity, inverse and well defined mappings

1
Q

Define a function/mapping:

A

Let A and B be non empty sets. α: A->B is a function or mapping if it is a rule that assigns each element of A with exactly one element of B.

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

Define the domain of α

A

Let α: A->B. A is called the domain of α denoted by D(α)

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

Define the codomain of α

A

Let α: A->B. B is called to codomain of α denoted by CoD( α )

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

define the range of α

A

α(A) = { α(a) | a ∈ A} is called the range or image of α denoted by Im(α)

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

Define the graph of α

A

graph of α, G(α) = {(a,α(a)) | a ∈ A}

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

Define a binary operation

A

If A = S x S, B = S then a mapping

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

Define an identity mapping

A

α : A → B, A ⊆ B is called an identity mapping on A if α(a) = a ∀a ∈ A (denoted by α = 1 sub A)

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

Define injective

A

α : A → B is one to one or injective, if α(a1) = α(a2) ⇒ a1 = a2 ∀a1, a2 ∈ A

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

Define surjective

A

α : A → B is onto (surjective) if
∀ b ∈ B ∃a ∈ A | b = α(a)

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

Define a bijection

A

If

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