Skip to content

TIP

Functions are sometimes also called mappings or transformations.

Function, domain, codomain, range ​

  • Let A and B be nonempty sets.
  • A function f from A to B is an assignment of exactly one element of B to each element of A. We write f(a)=b if b is the unique element of B assigned by the function f to the element a of A.
  • If f is a function from A to B, we write
f:A→B
  • Where,

    • A is the domain of f (Tập xác định, TXĐ)
    • B is the codomain of f (Tập giá trị / Tập đích)
  • If f(a)=b, we say that b is the image of a and a is a preimage of b. (ảnh và nghịch ảnh)

  • if f is a function from A to B, we say that f maps A to B. (ánh xạ)

  • A function f:A→B can also be defined in terms of a relation from A to B (just a subset of A×B)

    image.png

  • The range is the set of all values of f(a) for a∈A, and is always a subset of the codomain. In other words, range is actually created set.

  • Example,

    • Let f:Z→Z, f(x)=x2,
      • Domain of f is all integers
      • Codomain of f is all integers
      • Range of f is {0,1,2,4,9,…}

Function equality ​

  • Two functions are equal when they have
    • The same domain
    • The same codomain
    • Map each element of their common domain to the same element in their common codomain (tức là f(a)=g(a) với mọi a)

Sum and product ​

  • Let f1 and f2 be functions from A to R.
  • Then f1+f2 and f1 f2 are also functions from A to R defined ∀x∈A by
(f1+f2)(x)=f1(x)+f2(x)(f1f2)(x)=f1(x)f2(x)

Set of images ​

Let S be a subset of A, The image of S under the function f is the subset of B that consists of the images of the elements of S

f(S)={t∣∃s∈S(t=f(s))}

Or, for shorthand

{f(s)∣s∈S}

One-to-One and Onto Functions ​

One-to-one (injective) function ​

  • A function f is said to be one-to-one, or an injection, if and only if f(a)=f(b) implies that a=b for all a and b in the domain of f.
  • A function is said to be injective if it is one-to-one.
  • In other words,
    • Note that a function f is one-to-one if and only if f(a)≠f(b) whenever a≠b
  • We can express that f is one-to-one using quantifiers
∀a∀b(f(a)=f(b)→a=b)

Or using contrapositive,

∀a∀b(a≠b→f(a)≠f(b))
  • Example:
    • The function f(x)=x2 with domain Z+ is one-to-one
    • f(x)=x+1 with domain R is one-to-one

image.png

Increasing/decreasing functions ​

  • Hàm đồng biến/ nghịch biến
  • A function f whose domain and codomain are subsets of the set of real numbers is called increasing if f(x)≤f(y), and strictly increasing if f(x)<f(y), whenever x<y and x and y are in the domain of f. Hence
Increasing: ∀x∀y(x<y→f(x)≤f(y))Strictly Increasing: ∀x∀y(x<y→f(x)<f(y))
  • Similarly, for decreasing functions
Decreasing: ∀x∀y(x<y→f(x)≥f(y))Strictly Decreasing: ∀x∀y(x<y→f(x)>f(y))

TIP

If a function either strictly increasing or strictly decreasing ⇒ that function is one-to-one

If a function either increasing or decreasing ⇒ that function is not one-to-one

Onto (surjective) function (Hàm toàn) ​

  • For some functions the range and the codomain are equal
  • A function f from A to B is called onto, or a surjection, if and only if for every element b∈B there is an element a∈A with f(a)=b.
  • A function f is called surjective if it is onto.
∀y∃x(f(x)=y)

image.png

Bijective function (Hàm song ánh) ​

  • The function f is a one-to-one correspondence, or a bijection, if it is both one-to-one and onto.
  • We also say that such a function is bijective.

Function Key Takeaway ​

image.png

image.png

Inverse Functions and Compositions of Functions ​

Inverse function ​

  • Let f be a one-to-one correspondence from the set A to the set B.
  • The inverse function of f is the function that assigns to an element b belonging to B the unique element a in A such that f (a) = b.
  • The inverse function of f is denoted by f−1 . Hence, f−1(b)=a when f(a)=b

image.png

TIP

A one-to-one correspondence is called invertible because we can define an inverse of this function.

A function is not invertible if it is not a one-to-one correspondence, because the inverse of such a function does not exist.

Composition functions ​

  • Let g be a function from the set A to the set B and let f be a function from the set B to the set C. The composition of the functions f and g, denoted for all a∈A by f∘g, is the function from A to C defined by
(f∘g)(a)=f(g(a))
  • Domain of f∘g is domain of g
  • Range of f∘g is image of the range of g with respect to the function f
  • To find (f∘g)(a) we first apply the function g to a to obtain g(a) and then we apply the function f to the result g(a) to obtain f(g(a))

TIP

The composition f∘g cannot be defined if the range of g is not a subset of the domain of f. In other words, to be defined composition, this property must satisfy

range(g)⊆domain(f)

image.png

TIP

f∘g and g∘f are not equal

The Graphs of Functions (Đồ thị) ​

  • Let f be a function from the set A to the set B. The graph of the function f is the set of ordered pairs
{(a,b)∣a∈A and f(a)=b}

image.png

Some Important Functions ​

Floor function ​

  • The floor function assigns to the real number x the largest integer that is less than or equal to x. The value of the floor function at x is denoted by
⌊x⌋

Ceiling function ​

  • The ceiling function assigns to the real number x the smallest integer that is greater than or equal to x. The value of the ceiling function at x is denoted by
⌈x⌉

image.png

Useful properties of floor and ceiling functions ​

image.png

  • A useful approach for considering statements about the floor function is to let x=n+ε , where n=⌊x⌋ is an integer, and ε, the fractional part of x, satisfies the inequality 0≤ε<1
  • Similarly, when considering statements about the ceiling function, we have
x=n−ε with 0≤ε<1

Partition functions (hàm từng phần) ​

  • Chỉ định nghĩa trên một phần của tập A (không phải tất cả)
  • Example:
    • f:Z→Z,f(x)=1x
    • undefined at x = 0, ⇒ partial function

Total functions (hàm toàn phần) ​

  • Được định nghĩa cho mọi phần tử trong A. Không bỏ sót phần tử nào.

Built with ❤️ and curiosity