Question:

Let \(f(x)=\dfrac{x-1}{x+1}\) ,Let \(S ={x∈R \text{ Iff } -1(x)=x \text{  does not hold} }\).The cardinality of S is 

Updated On: Jul 26, 2024
  • a finite number, but not equal to 1,2,3

  • \(3\)

  • \(2\)

  • \(1\)

  • \(∞\)

Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Given that:

Let \(f(x)=\dfrac{x-1}{x+1}\) ,Let \(S ={x∈R Iff -1(x)=x \text{  does not hold} }\)

Here we need to get the cardinality of \(S\)

[we need to calculate the values of \( x\)  for which the given condition does not hold.]

The condition is: \(f(x) ≠ x\)

\(f(x) = \dfrac{x - 1}{x + 1}\)

Now , \(x\) for which \(f(x) ≠ x\):

\(⇒\dfrac{x - 1}{x + 1} ≠ x\)

Subtract x from both sides:

\(\dfrac{1}{x + 1} ≠ 0\)

Here, \(1\) can not be \(0\) 

So,

    \(x + 1 ≠ 0\)

\(⇒x ≠ -1\)

[The above expression values of x for which the condition does not hold are all real numbers except for \(x = -1\).]

so \(S \) can be represented as,

\(S = {x ∈ R | x ≠ -1}\)

The cardinality of S is the number of elements in the set S. Since the set S contains all real numbers except -1, the cardinality is infinity, denoted by \(∞\). (_Ans.)

Was this answer helpful?
2
0

Concepts Used:

Functions

A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. Let A & B be any two non-empty sets, mapping from A to B will be a function only when every element in set A has one end only one image in set B.

Kinds of Functions

The different types of functions are - 

One to One Function: When elements of set A have a separate component of set B, we can determine that it is a one-to-one function. Besides, you can also call it injective.

Many to One Function: As the name suggests, here more than two elements in set A are mapped with one element in set B.

Moreover, if it happens that all the elements in set B have pre-images in set A, it is called an onto function or surjective function.

Also, if a function is both one-to-one and onto function, it is known as a bijective. This means, that all the elements of A are mapped with separate elements in B, and A holds a pre-image of elements of B.

Read More: Relations and Functions