ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Discrete Structures
    GE-167
    Progress0 / 67 topics
    Topics
    1. Mathematical Reasoning: Propositional and Predicate Logic2. Propositional Logic: Logical Operators3. Translations Between Symbolic Expressions and Formal English Expression4. Logical Equivalences5. Predicate Logic: Quantifiers6. Nested Quantification7. Equivalences in Predicate Logic8. Translations Between Symbolic Forms and Formal English9. Rules of Inference: Proof Methods and Strategies10. Direct Proof11. Proof by Contraposition12. Proof by Induction13. Proof by Implication14. Existence Proof15. Uniqueness Proofs16. Trivial Proofs17. Vacuous Proofs18. Sets: Notations and Set Operations19. Venn Diagrams20. Countable and Uncountable Sets21. Relations: Equivalence Relations and Partitions22. Partial Orderings23. Recurrence Relations24. Functions: Injective, Surjective, Bijective25. Special Types of Functions26. Function Composition27. Inverse Functions28. Recursive Functions29. Compositions30. Number Theory: Sequences and Series31. Counting: Inclusion and Exclusion Principle32. Pigeonhole Principle33. Permutations and Combinations34. Integers and Divisibility: Division Theorem35. Modular Arithmetic36. LCM and GCD37. Euclidean and Extended Euclidean Method38. Finding Solutions to Congruence39. Primes: Fundamental Theorem of Arithmetic40. Characterizations of Primes41. Mersenne Primes42. Induction: Weak Induction43. Strong Induction44. Recursion and Recurrences: Formulation of Recurrences45. Closed Formulas46. Counting: Product Rule and Sum Rule47. Principle of Inclusion-Exclusion48. Binomial Coefficients49. Pascal's Identity and Pascal’s Triangle50. Binomial Theorem51. Relations: Reflexive, Symmetric, Transitive, and Antisymmetric52. Equivalence Relations and Equivalence Classes53. Partial Orders54. Graph Theory: Terminologies55. Elements of Graph Theory56. Planar Graphs57. Graph Coloring58. Euler Graph59. Hamiltonian Path60. Rooted Trees61. Graph Traversals62. Handshaking Lemma and Corollary63. Special Families of Graphs64. Graph Isomorphism65. Planarity in Graphs66. Eulerian and Hamiltonian Graphs67. Trees in Graph Theory
    GE-167›Special Types of Functions
    Discrete StructuresTopic 25 of 67

    Special Types of Functions

    13 minread
    2,196words
    Intermediatelevel

    Special Types of Functions

    In mathematics, there are many special types of functions that have specific properties or structures, often making them useful in different areas of study. Below are some of the most important special types of functions:


    1. Identity Function

    The identity function is a function that maps every element to itself. It’s denoted by f:A→Af: A \to Af:A→A, and for each a∈Aa \in Aa∈A, we have f(a)=af(a) = af(a)=a.

    Formal Definition:

    The identity function idA\text{id}_AidA​ on a set AAA is defined as:

    idA(a)=afor all a∈A.\text{id}_A(a) = a \quad \text{for all } a \in A.idA​(a)=afor all a∈A.

    Properties:

    • The identity function is both injective and surjective (hence, bijective) because every element maps to itself.
    • It's the simplest function, acting as a "no-change" function.

    Example:

    Let A={1,2,3}A = \{1, 2, 3\}A={1,2,3}. The identity function on AAA is:

    f(1)=1,f(2)=2,f(3)=3.f(1) = 1, \quad f(2) = 2, \quad f(3) = 3.f(1)=1,f(2)=2,f(3)=3.

    2. Constant Function

    A constant function is a function that always maps every element of the domain to the same value in the codomain.

    Formal Definition:

    A function f:A→Bf: A \to Bf:A→B is constant if there exists some c∈Bc \in Bc∈B such that for every a∈Aa \in Aa∈A, f(a)=cf(a) = cf(a)=c.

    Properties:

    • A constant function is always surjective if the codomain contains just one element (or if the codomain is the set containing the constant value).
    • It is not injective unless the domain consists of a single element, because all elements in the domain map to the same codomain value.

    Example:

    Let A={1,2,3}A = \{1, 2, 3\}A={1,2,3} and B={0}B = \{0\}B={0}. The constant function f:A→Bf: A \to Bf:A→B is defined by:

    f(1)=0,f(2)=0,f(3)=0.f(1) = 0, \quad f(2) = 0, \quad f(3) = 0.f(1)=0,f(2)=0,f(3)=0.

    3. Polynomial Function

    A polynomial function is a function of the form:

    f(x)=anxn+an−1xn−1+⋯+a1x+a0f(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + a_0f(x)=an​xn+an−1​xn−1+⋯+a1​x+a0​

    where an,an−1,…,a1,a0a_n, a_{n-1}, \dots, a_1, a_0an​,an−1​,…,a1​,a0​ are constants and nnn is a non-negative integer.

    Properties:

    • Polynomial functions are defined for all real (or complex) values of xxx.
    • They are continuous and differentiable everywhere on the real line.
    • Depending on the degree of the polynomial, they can exhibit a variety of behaviors such as having multiple roots, local minima/maxima, etc.

    Example:

    A polynomial function of degree 2 is f(x)=3x2+2x−1f(x) = 3x^2 + 2x - 1f(x)=3x2+2x−1. It is a quadratic function.


    4. Rational Function

    A rational function is a function that is the ratio of two polynomials. It is expressed in the form:

    f(x)=p(x)q(x)f(x) = \frac{p(x)}{q(x)}f(x)=q(x)p(x)​

    where p(x)p(x)p(x) and q(x)q(x)q(x) are polynomials, and q(x)≠0q(x) \neq 0q(x)=0.

    Properties:

    • Rational functions are continuous wherever q(x)≠0q(x) \neq 0q(x)=0.
    • They may have vertical asymptotes where q(x)=0q(x) = 0q(x)=0, and horizontal asymptotes depending on the degrees of the numerator and denominator.

    Example:

    A rational function is f(x)=x2+1x−1f(x) = \frac{x^2 + 1}{x - 1}f(x)=x−1x2+1​. This function has a vertical asymptote at x=1x = 1x=1.


    5. Exponential Function

    An exponential function is a function of the form:

    f(x)=a⋅bxf(x) = a \cdot b^xf(x)=a⋅bx

    where aaa is a constant and bbb is a positive real number, typically b≠1b \neq 1b=1.

    Properties:

    • Exponential functions are continuous and differentiable.
    • They grow or decay at a constant rate (depending on the base bbb).
    • If b>1b > 1b>1, the function grows exponentially. If 0<b<10 < b < 10<b<1, the function decays exponentially.
    • The function f(x)=exf(x) = e^xf(x)=ex, where e≈2.718e \approx 2.718e≈2.718, is a specific case of an exponential function and is commonly used in calculus and mathematical modeling.

    Example:

    f(x)=2xf(x) = 2^xf(x)=2x is an exponential function. It grows rapidly as xxx increases.


    6. Logarithmic Function

    The logarithmic function is the inverse of the exponential function. It is defined as:

    f(x)=log⁡b(x)f(x) = \log_b(x)f(x)=logb​(x)

    where b>0b > 0b>0, b≠1b \neq 1b=1, and x>0x > 0x>0.

    Properties:

    • Logarithmic functions are continuous and differentiable for x>0x > 0x>0.
    • The function f(x)=log⁡e(x)f(x) = \log_e(x)f(x)=loge​(x) is called the natural logarithm and is denoted ln⁡(x)\ln(x)ln(x).
    • The graph of a logarithmic function has a vertical asymptote at x=0x = 0x=0 and increases slowly for large values of xxx.

    Example:

    f(x)=log⁡2(x)f(x) = \log_2(x)f(x)=log2​(x) is a logarithmic function. It is the inverse of the exponential function f(x)=2xf(x) = 2^xf(x)=2x.


    7. Piecewise Function

    A piecewise function is a function that is defined by different expressions depending on the input. It is written as:

    f(x)={f1(x)if x∈A1,f2(x)if x∈A2,⋮fn(x)if x∈An.f(x) = \begin{cases} f_1(x) & \text{if } x \in A_1, \\ f_2(x) & \text{if } x \in A_2, \\ \vdots \\ f_n(x) & \text{if } x \in A_n. \end{cases}f(x)=⎩⎨⎧​f1​(x)f2​(x)⋮fn​(x)​if x∈A1​,if x∈A2​,if x∈An​.​

    where each piece fi(x)f_i(x)fi​(x) is defined on a different interval or subset of the domain.

    Properties:

    • Piecewise functions are often used to model situations where different behaviors occur in different conditions.
    • These functions may not be continuous at the points where the pieces change, though they can be.

    Example:

    The absolute value function is a piecewise function:

    f(x)={xif x≥0,−xif x<0.f(x) = \begin{cases} x & \text{if } x \geq 0, \\ -x & \text{if } x < 0. \end{cases}f(x)={x−x​if x≥0,if x<0.​

    8. Even and Odd Functions

    • A function f(x)f(x)f(x) is even if:

      f(−x)=f(x)for all x.f(-x) = f(x) \quad \text{for all } x.f(−x)=f(x)for all x.

      Example: f(x)=x2f(x) = x^2f(x)=x2 is an even function.

    • A function f(x)f(x)f(x) is odd if:

      f(−x)=−f(x)for all x.f(-x) = -f(x) \quad \text{for all } x.f(−x)=−f(x)for all x.

      Example: f(x)=x3f(x) = x^3f(x)=x3 is an odd function.


    9. Step Function

    A step function is a piecewise constant function. It jumps from one constant value to another over a certain interval.

    Example:

    The Heaviside step function is defined as:

    H(x)={0if x<0,1if x≥0.H(x) = \begin{cases} 0 & \text{if } x < 0, \\ 1 & \text{if } x \geq 0. \end{cases}H(x)={01​if x<0,if x≥0.​

    This function models a sudden change or a "jump" at x=0x = 0x=0.


    10. Inverse Function

    An inverse function f−1f^{-1}f−1 of a function fff is a function that "reverses" the effect of fff. For a function to have an inverse, it must be bijective.

    Formal Definition:

    If f:A→Bf: A \to Bf:A→B is bijective, then its inverse f−1:B→Af^{-1}: B \to Af−1:B→A is defined by:

    f−1(f(a))=afor all a∈Aandf(f−1(b))=bfor all b∈B.f^{-1}(f(a)) = a \quad \text{for all } a \in A \quad \text{and} \quad f(f^{-1}(b)) = b \quad \text{for all } b \in B.f−1(f(a))=afor all a∈Aandf(f−1(b))=bfor all b∈B.

    Example:

    For f(x)=2x+3f(x) = 2x + 3f(x)=2x+3, the inverse function is:

    f−1(x)=x−32.f^{-1}(x) = \frac{x - 3}{2}.f−1(x)=2x−3​.

    Conclusion

    These special types of functions play vital roles in various mathematical areas. Functions like the identity function, constant function, exponential function, and logarithmic function are commonly used in different contexts, including calculus, algebra, and number theory. Understanding their properties and behavior is fundamental to solving a wide range of mathematical problems.

    Previous topic 24
    Functions: Injective, Surjective, Bijective
    Next topic 26
    Function Composition

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time13 min
      Word count2,196
      Code examples0
      DifficultyIntermediate