কোন কোন লিনিয়ার ফাংশন এক-এক?

Interactive · 2 questions

One-to-One Functions

In this lesson, we will understand the concept of one-to-one functions, which is also known as injective functions. Only one-to-one functions can have an inverse found algebraically.

Let AA and BB be sets such that there exists a function ff such that f:A→Bf: A \rightarrow B. The function ff is injective (one-to-one) if for all elements a1,a2a_1, a_2 in domain AA, f(a1)=f(a2)f(a_1) = f(a_2) implies that a1=a2a_1 = a_2.

In other words, every element in the domain is mapped to exactly one element in the codomain - no more, no less! In addition, no two elements in the domain can be mapped to the same element in the codomain.

We can call an injective function an injection.

Let's take a look at an example of an injective function. Let's pretend the function ff maps dog owners to their dogs. The number of elements in the input group is three unique elements and in the output group is also three.

f: A --> B
smiley faces in the left semicircle mapping to dogs in the right semicircle

Image source: by Angela Yang

The function ff is injective because every owner has a dog, and no two owners have the same dog.

Now you try!

Take a look at these three different versions of function ff.

f: A --> B
smiley faces in left semicircle mapping to dogs in the right semicircle

Image source: by Angela Yang

Choose all versions of function ff that are injective.

Choose all correct answers

Illustrated · 1 min

Let AA and BB be two sets. A function (also called map) f:A→Bf:A\rightarrow B is said to be injective, or one-one, if no two elements of AA are mapped to the same element of BB under ff. Mathematically, x1,x2∈Ax_1, x_2 \in A and f(x1)=f(x2)f(x_1)=f(x_2)   ⟹  \implies x1=x2x_1=x_2.

(A function is called many-one if it is not injective.)

Injective map

Image source: by Neelarnab Raha

The above arrow-diagram shows a map ff that is injective.

The above arrow-diagram shows a map f that is not injective, i.e., it is many-one, because x and y are distinct elements of A, but f(x)=f(y)

Image source: by Neelarnab Raha

The above arrow-diagram shows a map f that is not injective, i.e., it is many-one, because xx and yy are distinct elements of A, but f(x)=f(y)f(x)=f(y).

Video

(Video) Injective Functions

by learnifyable

Follow along with the examples in this video from learnifyable.

Read · 1 min

Functions can be classified as one-to-one or onto based on how their outputs relate to the range.

One-to-One Functions

A function is like a machine that takes an input and gives an output. A one-to-one functions is a special kind of function where each input has a unique output. Each output has a unique input. This means that no two different inputs can give the same output.

To check if a function is one-to-one, imagine you are looking at the graph. If a horizontal line crosses the graph more than once, then the function is not one-to-one. This is called the horizontal line test.

For example, the function f(x)=x2f(x)=x^2 is not one-to-one because both x=−2x=-2 and x=2x=2 give the same output, 44. On the other hand, the function f(x)=2x+3f(x)=2x+3 is one-to-one because each input results in a different output.

A quick way to see this with numbers is to pick two different inputs, like 1 and 2. If f(1)f(1) and f(2)f(2) are not the same, the function is one-to-one.

One-to-one functions are important in math because they help us to solve equations and make sure that each output has only one input. You can also use this property to find the inverse of the function, which "undoes" the function's work.

In summary, a one-to-one function is a function where no two different inputs share the same output. If you see a graph, check if any horizontal lines cross the graph more than once. If they do, it's not one-to-one!

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems