Injective functions

Suppose a school reserves the numbers 100-199 as roll numbers for the students of a certain grade. Suppose there are 65 students studying in that grade this year. Next year, it may be more or less, but it will never exceed 100.

Get started

Achieve better grades quicker with Premium

PREMIUM
Karteikarten Spaced Repetition Lernsets AI-Tools Probeklausuren Lernplan Erklärungen Karteikarten Spaced Repetition Lernsets AI-Tools Probeklausuren Lernplan Erklärungen
Kostenlos testen

Geld-zurück-Garantie, wenn du durch die Prüfung fällst

Review generated flashcards

Sign up for free
You have reached the daily AI limit

Start learning or create your own AI flashcards

StudySmarter Editorial Team

Team Injective functions Teachers

  • 6 minutes reading time
  • Checked by StudySmarter Editorial Team
Save Article Save Article
Contents
Contents

Jump to a key chapter

    Consider the function mapping a student to his/her roll numbers. The domain of the function is the set of all students. The range of the function is the set of all possible roll numbers. Of course, two students cannot have the exact same roll number. So, each used roll number can be used to uniquely identify a student. Such a function is called an injective function.

    Injective function definition

    A function f : A ⇾ B is defined to be one-to-one or injective if the images of distinct elements of A under f are distinct.

    Suppose we have 2 sets, A and B. If a function that points from A to B is injective, it means that there will not be two or more elements of set A pointing to the same element in set B. Conversely, no element in set B will be pointed to by more than 1 element in set A.

    Injective Functions showing elements in a set pointed to other elements in a different set StudySmarterInjective function - no element in set B is pointed to by more than 1 element in set A, mathisfun.com

    Such a function is also called a one-to-one function since one element in the range corresponds to only one element in the domain.

    Composition of injective functions

    The composition of functions is a way of combining functions. In the composition of functions, the output of one function becomes the input of the other. To know more about the composition of functions, check out our article on Composition of Functions

    Consider two functionsg : BC andf : A B. If these two functions are injective, then, f g : A C which is their composition is also injective.

    Let's prove this.

    Let x, y A and suppose (f g) (x) = (f g) (y).

    From the above,

    f (g (x) ) = f (g (y) )

    Because f is injective,

    g(x) = g(y)

    g is also injective. Therefore,

    x = y

    This implies thatf g is an injection.

    Graphical explanation of Injective functions

    When you draw an injective function on a graph, for any value of y there will not be more than 1 value of x.

    So, given the graph of a function, if no horizontal line (parallel to the X-axis) intersects the curve at more than 1 point, we can conclude that the function is injective. On the other hand, if a horizontal line can be drawn which intersects the curve at more than 1 point, we can conclude that it is not injective. This is known as the horizontal line test.

    Injective function graphical explanation StudySmarterInjective function graph - StudySmarter Originals

    Consider the point P in the above graph. We can see that a straight line through P parallel to either the X or the Y-axis will not pass through any other point other than P. This applies to every part of the curve. Thus the curve passes both the vertical line test, implying that it is a function, and the horizontal line test, implying that the function is an injective function.

    Injective Functions Not an injective function StudySmarterNot an injective function - StudySmarter Originals

    By contrast, the above graph is not an injective function. The points, P1 and P2 have the same Y (range) values but correspond to different X (domain) values. Thus, it is not injective.

    Types of injective functions

    The following are the types of injective functions.

    • f : R R, f(x) = 2x + 1is injective.
    • f : R R, f(x) = ln (x) is injective.
    • f : R R, f(x) = 2x is injective
    • f : R R, f(x) = x3 is injective
    • f : R R, f(x) = x2 is injective
    • f : R R, f(x) = 4x + 5 is injective.
    • f : N N, f(x) = x2 is injective, since all-natural numbers have unique squares.
    • f : R R, f(x) = x2 + 1 is not injective.
    • f: R R, f(x) = cos (x) is not injective.

    Injective, Surjective and Bijective function

    Apart from injective functions, there are other types of functions like surjective and bijective functions It is important that you are able to differentiate these functions from an injective function. So let's look at their differences.

    For injective functions, it is a one to one mapping. Every element in A has a unique mapping in B but for the other types of functions, this is not the case. For a bijective function, every element in A matches perfectly with an element in B. No element is left out. See the figure below.

    Injective Functions Showing how elements map in a bijective function StudySmarterBijective Function.

    For surjective functions, every element in set B has at least one matching element in A and more than one element in A can point to just one element in B. See the figure below.

    Injective Functions Showing how elements map in a surjective function StudySmarterSurjective function.

    Injective function examples

    Consider the function, f:RR, f(x) = x.

    Clearly, the value of f(x) will be different when the value of x is different.

    The same applies to the functions f(x) = x3, x5, etc.

    On the other hand, consider the function, f:RR, f(x) = x2.

    This is not an injective function.

    Consider the value, 4, in the range of the function.

    f(2) = f(-2) = 4

    Thus, we see that more than 1 value in the domain can result in the same value in the range, implying that the function is not injective in nature.

    The same applies to functions such as x4, x6, etc.

    Let B = (4, 5, 6) and D = (a, b, c, d). Which of the following is an injective function?

    1. (4, b), (5, b), (6, b)
    2. (5, a), (5, a)
    3. (4, a), (5, b), (6, c)

    Solution:

    The answer is option c. Option c satisfies the condition for an injective function because the elements in B are uniquely mapped with the elements in D.

    If f(x) = x + 2 is an injective function, is f(x) = f(y), x = y true?

    Solution:

    The statement is true. If you assume x = 4 then,

    f(x) = x + 2f(x) = 4 + 2f(x) = 6

    From the statement,

    f(x) = f(y) = 6

    This means that:

    x = y = 6

    Injective functions - Key takeaways

    • If a function that points from A to B is injective, it means that there will not be two or more elements of set A pointing to the same element in set B. Conversely, no element in set B will be pointed to by more than 1 element in set A.
    • An injective function is also called a one-to-one function.
    • When you draw an injective function on a graph, for any value of y there will not be more than 1 value of x.
    Learn faster with the 1 flashcards about Injective functions

    Sign up for free to gain access to all our flashcards.

    Injective functions
    Frequently Asked Questions about Injective functions

    What is injective function?

    If a function that points from A to B is injective, it means that there will not be two or more elements of set A pointing to the same element in set B.

    What are examples of injective functions?

    f(x)=x, f(x)=x³

    How to prove if a function is injective?

    When you draw an injective function on a graph, for any value of y there will not be more than 1 value of x.  So, given the graph of a function, if no horizontal line (parallel to the X-axis) intersects the curve at more than 1 point, we can conclude that the function is injective.

    What is an injective hash function?

    An injective hash function is also known as a perfect hash function. It is a function that maps keys from a set S to unique values.

    Can a function be surjective but not injective?

    A function can be surjective but not injective.

    Save Article

    Discover learning materials with the free StudySmarter app

    Sign up for free
    1
    About StudySmarter

    StudySmarter is a globally recognized educational technology company, offering a holistic learning platform designed for students of all ages and educational levels. Our platform provides learning support for a wide range of subjects, including STEM, Social Sciences, and Languages and also helps students to successfully master various tests and exams worldwide, such as GCSE, A Level, SAT, ACT, Abitur, and more. We offer an extensive library of learning materials, including interactive flashcards, comprehensive textbook solutions, and detailed explanations. The cutting-edge technology and tools we provide help students create their own learning materials. StudySmarter’s content is not only expert-verified but also regularly updated to ensure accuracy and relevance.

    Learn more
    StudySmarter Editorial Team

    Team Math Teachers

    • 6 minutes reading time
    • Checked by StudySmarter Editorial Team
    Save Explanation Save Explanation

    Study anywhere. Anytime.Across all devices.

    Sign-up for free

    Sign up to highlight and take notes. It’s 100% free.

    Join over 22 million students in learning with our StudySmarter App

    The first learning app that truly has everything you need to ace your exams in one place

    • Flashcards & Quizzes
    • AI Study Assistant
    • Study Planner
    • Mock-Exams
    • Smart Note-Taking
    Join over 22 million students in learning with our StudySmarter App
    Sign up with Email