Key Points

Relations and Functions

15 Sections
  • Ordered Pair and Equality

    An ordered pair consists of two elements in a specific order, written as (a,b)(a, b). Two ordered pairs (a,b)(a, b) and (c,d)(c, d) are equal if and only if their corresponding elements are equal, meaning a=ca = c and b=db = d.

  • Cartesian Product of Sets

    The Cartesian product of two non-empty sets A and B, denoted by A×BA \times B, is the set of all possible ordered pairs (a,b)(a, b) where aAa \in A and bBb \in B. Formally, A×B={(a,b):aA,bB}A \times B = \{(a, b) : a \in A, b \in B\}.

  • Cardinality of Cartesian Product

    If a set A has pp elements and a set B has qq elements, then their Cartesian product A×BA \times B will have p×qp \times q elements. This is written as n(A×B)=n(A)×n(B)=pqn(A \times B) = n(A) \times n(B) = pq.

  • Definition of a Relation

    A relation R from a non-empty set A to a non-empty set B is a subset of the Cartesian product A×BA \times B. It is formed by ordered pairs that satisfy a specific relationship.

  • Domain, Codomain, and Range of a Relation

    For a relation R from A to B, the domain is the set of all first elements of the ordered pairs. The entire set B is the codomain. The range is the set of all second elements (images) of the ordered pairs, and it is always a subset of the codomain.

  • Total Number of Relations

    If a set A has pp elements and a set B has qq elements, the total number of possible relations from A to B is 2pq2^{pq}, because this is the total number of possible subsets of A×BA \times B.

  • Definition of a Function

    A relation ff from a set A to a set B is defined as a function if every element of set A has exactly one image in set B. This means no two distinct ordered pairs in ff have the same first element.

  • Function Notation and Terminology

    A function ff from set A to set B is denoted by f:ABf: A \rightarrow B. If (a,b)(a, b) is an ordered pair in the function, we write f(a)=bf(a) = b, where bb is the image of aa and aa is the pre-image of bb.

  • Real Valued and Real Functions

    A function is called a real valued function if its range is a subset of the set of real numbers R\mathbf{R}. If its domain is also a subset of R\mathbf{R}, it is called a real function.

  • Identity Function

    The function f:RRf: \mathbf{R} \rightarrow \mathbf{R} defined by f(x)=xf(x) = x is the identity function. Both its domain and range are the set of all real numbers R\mathbf{R}.

  • Constant Function

    The function f:RRf: \mathbf{R} \rightarrow \mathbf{R} defined by f(x)=cf(x) = c, where cc is a constant, is a constant function. Its domain is R\mathbf{R} and its range is the single element set {c}.

  • Modulus Function

    The modulus function is defined as f(x)=xf(x) = |x|. It is f(x)=xf(x) = x for x0x \geq 0 and f(x)=xf(x) = -x for x<0x < 0. Its domain is R\mathbf{R} and its range is the set of non-negative real numbers, [0,)[0, \infty).

  • Signum Function

    The signum function is defined as f(x)=1f(x) = 1 if x>0x > 0, f(x)=0f(x) = 0 if x=0x = 0, and f(x)=1f(x) = -1 if x<0x < 0. The domain is R\mathbf{R} and the range is the set {1,0,1}\{-1, 0, 1\}.

  • Greatest Integer Function

    The function f(x)=[x]f(x) = [x] is the greatest integer function, which returns the greatest integer less than or equal to xx. For example, [3.7]=3[3.7] = 3 and [2.3]=3[-2.3] = -3. Its domain is R\mathbf{R} and its range is the set of integers Z\mathbf{Z}.

  • Algebra of Real Functions

    For two real functions ff and gg: (f+g)(x)=f(x)+g(x)(f+g)(x) = f(x) + g(x), (fg)(x)=f(x)g(x)(f-g)(x) = f(x) - g(x), (fg)(x)=f(x)g(x)(fg)(x) = f(x)g(x), and (fg)(x)=f(x)g(x)(\frac{f}{g})(x) = \frac{f(x)}{g(x)} where g(x)0g(x) \neq 0.

Quick Revision Tips

  • • Review these points before exams
  • • Make flashcards for better retention
  • • Connect points to real-world examples
  • • Practice explaining each point in your own words