Relation Mapping (IIT JAM 2014)

Question 33 - Relation-Mapping (IIT JAM 2014)


A beautiful problem involving the concept of relation-mapping from IIT JAM 2014.

Let $f:(0,\infty)\to \mathbb R$ be a differentiable function such that $f'(x^2)=1-x^3$ for all $x>0$ and $f(1)=0$. Then $f(4)$ equals

  • $\frac{-47}{5}$
  • $\frac{-47}{10}$
  • $\frac{-16}{5}$
  • $\frac{-8}{5}$

Key Concepts


Relation/Mapping

Differentiation

Integration

Check the Answer


Answer: (A) $ \frac{-47}{5}$

Try with Hints


The above problem can be done in many ways we will try to solve this by the simplest method.

Now, as the function is given as $f'(x^2)=1-x^3$

So first try to change this $x^3$ into $x^2$. Try this. It's very easy !!!

To change $x^3$ into $x^2$ we can easily do

$f'(x^2)=1-(x^2)^{\frac32}$

Now we have to find the value of $f(4)$ so we have to change the second degree term, i.e., $x^2$ into some linear form. Can you cook this up ???

Let us assume $x^2=y$

i.e., $f'(y)=1-y^{\frac32}$

Now you know from previous knowledge that integration is also known as anti-derivative. So $f'(y)$ can be changed into $f(y)$ by integrating it with respect to $y$. Try to do this integration and we are half way done !!!

On integrating both side w.r.t $y$ we get :

$f(y)=y-\frac25y^{\frac52}+c$, (where $c$ is a integrating constant.)

Now we find the value to $c$

We know $f(1)=0$

$\Rightarrow c=-\frac35$

i.e., $f(y)=y-\frac25y^{\frac52}-\frac35$

Can you find the answer now ?

Now simply, putting $y=4$

we get $f(4)=4-\frac25(4)^{\frac52}-\frac35 \\=4-\frac{64}{5}-\frac35 \\= \frac{20-67}{5} \\= -\frac{47}{5}$

Subscribe to Cheenta at Youtube


Linear Transformation - IIT JAM 2018 Question Number 21

[et_pb_section fb_built="1" _builder_version="4.0"][et_pb_row _builder_version="4.2.2" width="100%"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_text _builder_version="4.2.2" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_padding="10px|10px|10px|10px|false|false" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" inline_fonts="Aclonica"]

What are we learning ?

[/et_pb_text][et_pb_text _builder_version="4.2.2" text_font="Raleway||||||||" text_font_size="20px" text_letter_spacing="1px" text_line_height="1.5em" background_color="#f4f4f4" custom_margin="10px||20px||false|false" custom_padding="10px|20px|10px|20px" box_shadow_style="preset2"]

Competency in Focus: Linear Transformation

This problem from IIT JAM 2018 is based on calculation of linear transformation. It is Question no. 21 of the IIT JAM 2018 Problem series.

[/et_pb_text][et_pb_text _builder_version="4.2.2" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="10px||10px||false|false" custom_padding="10px|10px|10px|10px|false|false" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" inline_fonts="Aclonica"]

First look at the knowledge graph:-

[/et_pb_text][et_pb_image src="https://cheenta.com/wp-content/uploads/2020/02/IIT-JAM-_2018_21-1.png" alt="calculation of mean and median- AMC 8 2013 Problem" title_text=" mean and median- AMC 8 2013 Problem" align="center" force_fullwidth="on" _builder_version="4.2.2" min_height="429px" height="189px" max_height="198px" custom_padding="10px|10px|10px|10px|false|false"][/et_pb_image][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" inline_fonts="Aclonica"]

Next understand the problem

[/et_pb_text][et_pb_text _builder_version="4.2.2" text_font="Raleway||||||||" text_font_size="20px" text_letter_spacing="1px" text_line_height="1.5em" background_color="#f4f4f4" custom_margin="10px||10px" custom_padding="10px|20px|10px|20px" box_shadow_style="preset2"]Let $U, V, \textbf{and}\quad W$ be finite dimensional real vector spaces, $T:U\rightarrow V, S: V\rightarrow W, P: W\rightarrow U$ be linear transformations. If range($ST$)=nullspace($P$), nullspace($ST$)=range ($P$) and rank($T$)=rank($S$), Then which one of the following is true? $\textbf{(A)}$ nullity of $T$ = nullity of $S$ $\textbf{(B)}$ dimension of $U \neq $  dimension of $W$ $\textbf{(C)}$ If dimension of $V = 3$, If dimension of $U = 4$, then $P$ is not identically zero. $\textbf{(C)}$ If dimension of $V = 4$, If dimension of $U = 3$, and $T$ is one-one then $P$ is identically zero. 

[/et_pb_text][/et_pb_column][/et_pb_row][et_pb_row _builder_version="4.0"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_accordion open_toggle_text_color="#0c71c3" _builder_version="4.2.2" toggle_font="||||||||" body_font="Raleway||||||||" text_orientation="center" custom_margin="10px||10px"][et_pb_accordion_item title="Source of the problem" open="on" _builder_version="4.2.2"]IIT JAM 2018, Question Number 21[/et_pb_accordion_item][et_pb_accordion_item title="Key Competency" _builder_version="4.2.2" inline_fonts="Abhaya Libre" open="off"]

Linear transformation and Vector Space.

[/et_pb_accordion_item][et_pb_accordion_item title="Difficulty Level" _builder_version="4.2.2" open="off"]7/10[/et_pb_accordion_item][et_pb_accordion_item title="Suggested Book" _builder_version="4.2.2" open="off"]Higher Algebra : S K MAPA[/et_pb_accordion_item][/et_pb_accordion][et_pb_text _builder_version="4.0.9" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="48px||48px" custom_padding="20px|20px|0px|20px||" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" inline_fonts="Aclonica"]

Start with hints 

[/et_pb_text][et_pb_tabs _builder_version="4.2.2"][et_pb_tab title="HINT 0" _builder_version="4.0.9"]Do you really need a hint? Try it first![/et_pb_tab][et_pb_tab title="HINT 1" _builder_version="4.2.2"]I want to make an opinion that this question is not hard but it is time consuming. So in a time paced exam beware of this kind of question. The fact I've used here : i) Ker$(ST)={0} \iff ST \quad \textbf{is injective}$ ii) $ST\quad \textbf{is injective} \iff  $T$ \quad \textbf{is injective}$ iii) And creating the counter examples which are  most time consuming. So, in hint 1, I want to disclose the answer and I can first try to find out the counter example by yourself. $\bullet \quad\textbf{The correct option is} \quad[\textbf{C}]$[/et_pb_tab][et_pb_tab title="HINT 2" _builder_version="4.2.2"]Consider $U=V=W=\mathbb{R}^2$ and the maps are  The range($ST$) =$S_p\{c_1\}=$ Nullspace($P$). range($P$)=$S_p\{c_2\}=$ Nullspace($ST$) & rank($T$) $=1=$ rank ($S$) But, Nullity of $T=1 \neq 2=$ Nullity of $S$. And dim($U$) = dim($W$) = 2 So, the option $(A)$ and $(B)$ are incorrect.  [/et_pb_tab][et_pb_tab title="HINT 3" _builder_version="4.2.2"]Consider $U= \mathbb{R}^3,V= \mathbb{R}^4, W= \mathbb{R}^5 $ range ($ST$) = $S_p\{c_1,c_2\}=$ Nullspace($P$) Nullspace ($ST$)=$S_p\{c_3\}$=Range($P$) rank($T$)=$2$=rank($S$) and $P$ is not zero map So, option $(D)$ is not correct. Hence option $(C)$ is the one left which has to be true, Now lets prove that.  [/et_pb_tab][et_pb_tab title="HINT 4" _builder_version="4.2.2"]We'll prove that $P$ is non zero. Suppose $P=0$ $U\longrightarrow V\longrightarrow W$ dim($U$) = $4$, dim($V$) =$3$  Now,         range ($P$)  $=0=$ Nullspace ($ST$)         $\Rightarrow ST $ is injective         $\Rightarrow T  $ is injective         $\Rightarrow  $ dim ($V\geq 4$)         Which is a contradiction. Hence $P=0$ And we are done[/et_pb_tab][/et_pb_tabs][/et_pb_column][/et_pb_row][/et_pb_section][et_pb_section fb_built="1" fullwidth="on" _builder_version="4.2.2" custom_margin="20px||20px||false|false" global_module="50750"][et_pb_fullwidth_header title="College Mathematics Program" button_one_text="Learn more" button_one_url="https://cheenta.com/collegeprogram/" header_image_url="https://cheenta.com/wp-content/uploads/2018/03/College-1.png" _builder_version="4.2.2" background_color="#12876f" custom_button_one="on" button_one_text_color="#12876f" button_one_bg_color="#ffffff"]

The higher mathematics program caters to advanced college and university students. It is useful for I.S.I. M.Math Entrance, GRE Math Subject Test, TIFR Ph.D. Entrance, I.I.T. JAM. The program is problem driven. We work with candidates who have a deep love for mathematics. This program is also useful for adults continuing who wish to rediscover the world of mathematics.

[/et_pb_fullwidth_header][/et_pb_section][et_pb_section fb_built="1" fullwidth="on" _builder_version="4.2.2" global_module="50852" saved_tabs="all"][et_pb_fullwidth_post_slider include_categories="12" show_meta="off" image_placement="left" _builder_version="4.2.2" background_color="#0c71c3" custom_button="on" button_text_color="#44580e" button_bg_color="#ffffff" button_border_color="#ffffff" button_border_radius="7px" custom_padding="20px||20px||false|false"][/et_pb_fullwidth_post_slider][/et_pb_section]

Rank:IIT JAM 2018 PROBLEM 9

[et_pb_section fb_built="1" _builder_version="4.1"][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Let's Try A Warm Up MCQ

[/et_pb_text][et_pb_code _builder_version="4.1"][/et_pb_code][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Understand the problem

[/et_pb_text][et_pb_text _builder_version="4.1" text_font="Raleway||||||||" background_color="#f4f4f4" custom_margin="10px||10px" custom_padding="10px|20px|10px|20px" box_shadow_style="preset2"]Consider the vector space V over $latex \mathbb{R} $ of the polynomial functions of degree less than or equal to 3 defined on $latex \mathbb{R} $. Let $latex T : V \longrightarrow V $ defined by $latex (Tf)(x) = f(x)-xf'(x). Then the rank of T is  (a) 1  (b) 2 (c) 3 (d) 4 [/et_pb_text][/et_pb_column][/et_pb_row][et_pb_row _builder_version="4.1"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_accordion open_toggle_text_color="#0c71c3" _builder_version="4.1" toggle_font="||||||||" body_font="Raleway||||||||" text_orientation="center" custom_margin="10px||10px"][et_pb_accordion_item title="Source of the problem" open="on" _builder_version="4.1"]IIT JAM 2018 Problem 9[/et_pb_accordion_item][et_pb_accordion_item title="Topic" _builder_version="4.1" open="off"]Vector Space [/et_pb_accordion_item][et_pb_accordion_item title="Difficulty Level" _builder_version="4.1" open="off"]Easy[/et_pb_accordion_item][et_pb_accordion_item title="Suggested Book" _builder_version="4.1" open="off"]Abstract Algebra By S.K Mapa[/et_pb_accordion_item][/et_pb_accordion][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Start with hints

[/et_pb_text][et_pb_tabs active_tab_background_color="#0c71c3" inactive_tab_background_color="#000000" _builder_version="4.1" tab_text_color="#ffffff" tab_font="||||||||" background_color="#ffffff" hover_enabled="0"][et_pb_tab title="Hint 0" _builder_version="4.1" hover_enabled="0"]Do you really need a hint? Try it first!

[/et_pb_tab][et_pb_tab title="Hint 1" _builder_version="4.1" hover_enabled="0"]Rank(T) = dim(Range(T)) There is one easy way to calculate rank of every linear transformation. Step 1:  Take by basis  $latex \beta= \{e_1,....,e_n\} $ of the vector space $latex V $. Step 2: Write down the matrix $latex [T]_{\beta}^{\beta} $ Step 3: Calculate the rank of the matrix  $latex [T]_{\beta}^{\beta} $ Now can you follow these steps to get the answer?  [/et_pb_tab][et_pb_tab title="Hint 2" _builder_version="4.1" hover_enabled="0"]Standard Basis of $latex V $ is $latex \{1,x,x^{2},x^{3}\} = \beta$ $latex (Tf) (x) =f(x) - xf^{'}(x)$ $latex (T1) (x) = 1 - 0 = 1$; $latex (Tx) (x) = x - x = 0$; $latex (T x^{2}) (x)= x^{2} - 2x^{2} = -x^{2}$ ; $latex (T x^{3}) (x) = -2x^{3} $ So, $latex [T]_{\beta}^{\beta} = \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0\\ 0 & 0 & -1 & 0\\ 0 & 0 & 0 & -2 \\ \end{pmatrix} $ Hence the rank is $latex 3 $[/et_pb_tab][/et_pb_tabs][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Watch the video

[/et_pb_text][et_pb_code _builder_version="3.26.4"]
[/et_pb_code][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" min_height="12px" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Connected Program at Cheenta

[/et_pb_text][et_pb_blurb title="College Mathematics Program" url="https://cheenta.com/collegeprogram/" image="https://cheenta.com/wp-content/uploads/2018/03/College-1.png" _builder_version="3.23.3" header_font="||||||||" header_text_color="#e02b20" header_font_size="48px" link_option_url="https://cheenta.com/collegeprogram/" border_color_all="#e02b20"]

The higher mathematics program caters to advanced college and university students. It is useful for I.S.I. M.Math Entrance, GRE Math Subject Test, TIFR Ph.D. Entrance, I.I.T. JAM. The program is problem driven. We work with candidates who have a deep love for mathematics. This program is also useful for adults continuing who wish to rediscover the world of mathematics.[/et_pb_blurb][et_pb_button button_url="https://cheenta.com/collegeprogram/" button_text="Learn More" button_alignment="center" _builder_version="3.23.3" custom_button="on" button_bg_color="#0c71c3" button_border_color="#0c71c3" button_border_radius="0px" button_font="Raleway||||||||" button_icon="%%3%%" background_layout="dark" button_text_shadow_style="preset1" box_shadow_style="preset1" box_shadow_color="#0c71c3"][/et_pb_button][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Similar Problems

[/et_pb_text][et_pb_post_slider include_categories="12" image_placement="right" _builder_version="4.1" background_color="rgba(155,207,242,0.54)" button_alignment="center" text_shadow_style="preset1"][/et_pb_post_slider][et_pb_divider _builder_version="3.22.4" background_color="#0c71c3"][/et_pb_divider][/et_pb_column][/et_pb_row][/et_pb_section]

TIFR 2014 Problem 12 Solution - Mapping Properties


TIFR 2014 Problem 12 Solution is a part of TIFR entrance preparation series. The Tata Institute of Fundamental Research is India's premier institution for advanced research in Mathematics. The Institute runs a graduate programme leading to the award of Ph.D., Integrated M.Sc.-Ph.D. as well as M.Sc. degree in certain subjects.
The image is a front cover of a book named Introduction to Real Analysis by R.G. Bartle, D.R. Sherbert. This book is very useful for the preparation of TIFR Entrance.

Also Visit: College Mathematics Program of Cheenta


Problem:


There exists a map (f:\mathbb{Z} \to \mathbb{Q}) such that (f)

A. is bijective and increasing

B. is onto and decreasing

C. is bijective and satisfies (f(n)\ge 0) if (n\le 0)

D. has uncountable image.


Discussion:


Option D is out of the question right away. Because the co-domain (\mathbb{Q}) is countable, and the image set is a subset of the co-domain set, any subset of countable set is countable, so image set has to be countable.

Let's assume (f) is onto and decreasing. Then (...\ge f(-1) \ge f(0) \ge f(1) \ge f(2) \ge ... ).

At this point, we don't know for sure whether (f(0)=f(1)) or not. But, for the map to be onto, we must have strict inequality somewhere in the above chain of inequalities.

Let's say (f(a)>f(a+1)). Then we ask what is the pre-image of the rational number (\frac{f(a)+f(a+1)}{2})?

Let (f(n)=\frac{f(a)+f(a+1)}{2})

Since, (f(n)=\frac{f(a)+f(a+1)}{2}>f(a)) and (f) is decreasing, (a>n).

Also, since (f(n)=\frac{f(a)+f(a+1)}{2}<f(a+1)) and (f) is decreasing, (n>a+1).

The two inequalities (a>n) and (n>a+1) together give a contradiction.

Therefore, option B is false.

What did we use here, only onto-ness and that f is decreasing. If instead our function (f) was bijective and increasing then we will get a similar kind of contradiction:

Suppose (f) is bijective and increasing. Then (f(0)<f(1)) (One-to-one ness guarantees the strict inequality)

We have (\frac{f(0)+f(1)}{2}\in\mathbb{Q}).

Therefore there exists (m\in\mathbb{Z}) such that ( f(m)= \frac{f(0)+f(1)}{2} ).

We then have (f(0)<f(m)<f(1)) which means (0<m<1), a contradiction because there is no natural number in between 0 and 1.

So option A is false.

We know that (\mathbb{Q}) does have a bijection with (\mathbb{Z}), in other words (\mathbb{Q}) is countable.

Now, both the set (A={n\in \mathbb{Z}| n\le 0 }) and (B={q\in \mathbb{Q}| q\ge 0}) are countably infinite, therefore has a bijection between them. To see this, let (f_1:A\to \mathbb{Z}) and (f_2:B\to \mathbb{Z}) be bijections. Then (f_2^{-1}o f_1:A \to B) is a bijection.

Similarly (C={n\in \mathbb{Z}| n> 0 }) has a bijection with (D={q\in \mathbb{Q}| q< 0}).

Now, we have (h:A\to B) and (g:C\to D) two bijections.

Then define (f(n)=h(n)) for (n\in A) and (f(n)=g(n)) for (n\in C) to get a bijection from (\mathbb{Z}) to (\mathbb{Q}). This is true because (A \cup B= \mathbb{Z}) and (C \cup D= \mathbb{Q}).

And this (f) satisfies the condition of option C: (f) is bijective and satisfies (f(n)\ge 0) if (n\le 0)

Therefore, option C is true.


Chatuspathi