Chapter 5 definitions Flashcards
To understand all of the definitions pertaining to identity, inverse and well defined mappings
Define a function/mapping:
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.
Define the domain of α
Let α: A->B. A is called the domain of α denoted by D(α)
Define the codomain of α
Let α: A->B. B is called to codomain of α denoted by CoD( α )
define the range of α
α(A) = { α(a) | a ∈ A} is called the range or image of α denoted by Im(α)
Define the graph of α
graph of α, G(α) = {(a,α(a)) | a ∈ A}
Define a binary operation
If A = S x S, B = S then a mapping
Define an identity mapping
α : A → B, A ⊆ B is called an identity mapping on A if α(a) = a ∀a ∈ A (denoted by α = 1 sub A)
Define injective
α : A → B is one to one or injective, if α(a1) = α(a2) ⇒ a1 = a2 ∀a1, a2 ∈ A
Define surjective
α : A → B is onto (surjective) if
∀ b ∈ B ∃a ∈ A | b = α(a)
Define a bijection
If