Prove that if $langle df_x(v),vrangle>0$, then $f$ is injective
Clash Royale CLAN TAG#URR8PPP
up vote
4
down vote
favorite
Suppose $f:mathbb R^nto mathbb R^n$ is a $mathcal C^1$ map such that $langle df_x(v),vrangle>0$ for all $xin mathbb R^n$ and $vin R^nsetminus 0$. Prove that $f$ is injective. Hint: For $xne 0, $ consider $g:mathbb Rto mathbb R^n$ given by $g(t)=f(tx)$. Find $g'(t)$ and show that $f(x)ne f(0)$.
Let $x=(x_1,dots,x_n)$. To compute $g'(t)=dg_t$, note that $g$ is the composition of $h:mathbb Rto mathbb R^n$ given by $tmapsto tx$ and $f$. By the chain rule, $dg_t=df_txcdot dh_t$ as matrices. Now $dh_t=[x_1,dots,x_n]^t,df_tx=[D_if_j]$, where $f=(f_1,dots,f_n)$, so $$dg_t=[D_1f_1(tx)x_1+dots+D_1f_n(tx)x_n,dots, D_nf_1(tx)x_1+dots +D_nf_n(tx)x_n]^t.$$
Injectivity means that $g(0)=f(x)ne 0$ if $xne 0$. What does it have to do with injectivity? How to use the given inequality?
calculus real-analysis multivariable-calculus derivatives
add a comment |Â
up vote
4
down vote
favorite
Suppose $f:mathbb R^nto mathbb R^n$ is a $mathcal C^1$ map such that $langle df_x(v),vrangle>0$ for all $xin mathbb R^n$ and $vin R^nsetminus 0$. Prove that $f$ is injective. Hint: For $xne 0, $ consider $g:mathbb Rto mathbb R^n$ given by $g(t)=f(tx)$. Find $g'(t)$ and show that $f(x)ne f(0)$.
Let $x=(x_1,dots,x_n)$. To compute $g'(t)=dg_t$, note that $g$ is the composition of $h:mathbb Rto mathbb R^n$ given by $tmapsto tx$ and $f$. By the chain rule, $dg_t=df_txcdot dh_t$ as matrices. Now $dh_t=[x_1,dots,x_n]^t,df_tx=[D_if_j]$, where $f=(f_1,dots,f_n)$, so $$dg_t=[D_1f_1(tx)x_1+dots+D_1f_n(tx)x_n,dots, D_nf_1(tx)x_1+dots +D_nf_n(tx)x_n]^t.$$
Injectivity means that $g(0)=f(x)ne 0$ if $xne 0$. What does it have to do with injectivity? How to use the given inequality?
calculus real-analysis multivariable-calculus derivatives
add a comment |Â
up vote
4
down vote
favorite
up vote
4
down vote
favorite
Suppose $f:mathbb R^nto mathbb R^n$ is a $mathcal C^1$ map such that $langle df_x(v),vrangle>0$ for all $xin mathbb R^n$ and $vin R^nsetminus 0$. Prove that $f$ is injective. Hint: For $xne 0, $ consider $g:mathbb Rto mathbb R^n$ given by $g(t)=f(tx)$. Find $g'(t)$ and show that $f(x)ne f(0)$.
Let $x=(x_1,dots,x_n)$. To compute $g'(t)=dg_t$, note that $g$ is the composition of $h:mathbb Rto mathbb R^n$ given by $tmapsto tx$ and $f$. By the chain rule, $dg_t=df_txcdot dh_t$ as matrices. Now $dh_t=[x_1,dots,x_n]^t,df_tx=[D_if_j]$, where $f=(f_1,dots,f_n)$, so $$dg_t=[D_1f_1(tx)x_1+dots+D_1f_n(tx)x_n,dots, D_nf_1(tx)x_1+dots +D_nf_n(tx)x_n]^t.$$
Injectivity means that $g(0)=f(x)ne 0$ if $xne 0$. What does it have to do with injectivity? How to use the given inequality?
calculus real-analysis multivariable-calculus derivatives
Suppose $f:mathbb R^nto mathbb R^n$ is a $mathcal C^1$ map such that $langle df_x(v),vrangle>0$ for all $xin mathbb R^n$ and $vin R^nsetminus 0$. Prove that $f$ is injective. Hint: For $xne 0, $ consider $g:mathbb Rto mathbb R^n$ given by $g(t)=f(tx)$. Find $g'(t)$ and show that $f(x)ne f(0)$.
Let $x=(x_1,dots,x_n)$. To compute $g'(t)=dg_t$, note that $g$ is the composition of $h:mathbb Rto mathbb R^n$ given by $tmapsto tx$ and $f$. By the chain rule, $dg_t=df_txcdot dh_t$ as matrices. Now $dh_t=[x_1,dots,x_n]^t,df_tx=[D_if_j]$, where $f=(f_1,dots,f_n)$, so $$dg_t=[D_1f_1(tx)x_1+dots+D_1f_n(tx)x_n,dots, D_nf_1(tx)x_1+dots +D_nf_n(tx)x_n]^t.$$
Injectivity means that $g(0)=f(x)ne 0$ if $xne 0$. What does it have to do with injectivity? How to use the given inequality?
calculus real-analysis multivariable-calculus derivatives
edited Aug 12 at 7:53
mathcounterexamples.net
25k21754
25k21754
asked Aug 12 at 6:14
user531232
24413
24413
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
2
down vote
So $g=f circ h$. $h$ is linear. Hence its derivative at each point is itself. Which means that for each $t$, $h^prime(t)$ is the real map $h^prime(t): umapsto ux$.
Consequently using the chain rule, we have:
$$g^prime(t) =f^prime(tx).x$$
Now consider $G(t)= langle g(t), x rangle$. $G$ derivative is
$$G^prime(t) = langle g^prime(t),xrangle = langle f^prime(tx).x,xrangle $$
which is strictly positive for $x neq 0$ according to the hypothesis $langle f^prime(y).v,vrangle >0$
Then
$$langle f(x)-f(0),xrangle = G(1)-G(0)=int _0^1 G^prime(t) dt>0$$
allowing to conclude that $f(x)neq f(0)$. The injectivity of $f$ can be deduced by changing $g(tx)$ into $g(t(y-x)+x)$.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
So $g=f circ h$. $h$ is linear. Hence its derivative at each point is itself. Which means that for each $t$, $h^prime(t)$ is the real map $h^prime(t): umapsto ux$.
Consequently using the chain rule, we have:
$$g^prime(t) =f^prime(tx).x$$
Now consider $G(t)= langle g(t), x rangle$. $G$ derivative is
$$G^prime(t) = langle g^prime(t),xrangle = langle f^prime(tx).x,xrangle $$
which is strictly positive for $x neq 0$ according to the hypothesis $langle f^prime(y).v,vrangle >0$
Then
$$langle f(x)-f(0),xrangle = G(1)-G(0)=int _0^1 G^prime(t) dt>0$$
allowing to conclude that $f(x)neq f(0)$. The injectivity of $f$ can be deduced by changing $g(tx)$ into $g(t(y-x)+x)$.
add a comment |Â
up vote
2
down vote
So $g=f circ h$. $h$ is linear. Hence its derivative at each point is itself. Which means that for each $t$, $h^prime(t)$ is the real map $h^prime(t): umapsto ux$.
Consequently using the chain rule, we have:
$$g^prime(t) =f^prime(tx).x$$
Now consider $G(t)= langle g(t), x rangle$. $G$ derivative is
$$G^prime(t) = langle g^prime(t),xrangle = langle f^prime(tx).x,xrangle $$
which is strictly positive for $x neq 0$ according to the hypothesis $langle f^prime(y).v,vrangle >0$
Then
$$langle f(x)-f(0),xrangle = G(1)-G(0)=int _0^1 G^prime(t) dt>0$$
allowing to conclude that $f(x)neq f(0)$. The injectivity of $f$ can be deduced by changing $g(tx)$ into $g(t(y-x)+x)$.
add a comment |Â
up vote
2
down vote
up vote
2
down vote
So $g=f circ h$. $h$ is linear. Hence its derivative at each point is itself. Which means that for each $t$, $h^prime(t)$ is the real map $h^prime(t): umapsto ux$.
Consequently using the chain rule, we have:
$$g^prime(t) =f^prime(tx).x$$
Now consider $G(t)= langle g(t), x rangle$. $G$ derivative is
$$G^prime(t) = langle g^prime(t),xrangle = langle f^prime(tx).x,xrangle $$
which is strictly positive for $x neq 0$ according to the hypothesis $langle f^prime(y).v,vrangle >0$
Then
$$langle f(x)-f(0),xrangle = G(1)-G(0)=int _0^1 G^prime(t) dt>0$$
allowing to conclude that $f(x)neq f(0)$. The injectivity of $f$ can be deduced by changing $g(tx)$ into $g(t(y-x)+x)$.
So $g=f circ h$. $h$ is linear. Hence its derivative at each point is itself. Which means that for each $t$, $h^prime(t)$ is the real map $h^prime(t): umapsto ux$.
Consequently using the chain rule, we have:
$$g^prime(t) =f^prime(tx).x$$
Now consider $G(t)= langle g(t), x rangle$. $G$ derivative is
$$G^prime(t) = langle g^prime(t),xrangle = langle f^prime(tx).x,xrangle $$
which is strictly positive for $x neq 0$ according to the hypothesis $langle f^prime(y).v,vrangle >0$
Then
$$langle f(x)-f(0),xrangle = G(1)-G(0)=int _0^1 G^prime(t) dt>0$$
allowing to conclude that $f(x)neq f(0)$. The injectivity of $f$ can be deduced by changing $g(tx)$ into $g(t(y-x)+x)$.
edited Aug 12 at 17:00
answered Aug 12 at 11:12
mathcounterexamples.net
25k21754
25k21754
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2880029%2fprove-that-if-langle-df-xv-v-rangle0-then-f-is-injective%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password