Proof involving homogeneous functions and chain rule

hth
Messages
26
Reaction score
0

Homework Statement



A function f is called homogeneous of degree s if it satisfies the equation

f(x1, x2, x3,... xn)=t^s*f(x1, x2, x3,... xn) for all t

Prove that the \sum from i=1 to n of xi * df/dxi (x1, x2, x3,... xn) = sf(x1, x2, x3,... xn).

Homework Equations


The Attempt at a Solution



Take A=f(t1,t2,..,tn)=t^kf(t1,t2,..,tn)

Then find dA/dt...

I keep lost in the differentiation. Am I even on the right track? Any help is appreciated.
 
Last edited:
Physics news on Phys.org
Try something like this (3 variable example):

Let g(t) = f(tx,ty,tz) = t3f(x,y,z)

Now, using subscript notation for the partials of f with respect to its arguments, calculate g'(t) using the chain rule:

g'(t) = xf1(tx,ty,tz)+yf2(tx,ty,tz)+zf3(tx,ty,tz)=3t2f(x,y,z)

Now let x = u/t, y=v/t and z = w/t and see what happens. Should generalize to n variables.
 
hth said:

Homework Statement



A function f is called homogeneous of degree s if it satisfies the equation

f(x1, x2, x3,... xn)=t^s*f(x1, x2, x3,... xn) for all t
You mean "f(tx1, tx2, tx3,... txn)=t^s*f(x1, x2, x3,... xn) for all t"

Prove that the \sum from i=1 to n of xi * df/dxi (x1, x2, x3,... xn) = sf(x1, x2, x3,... xn).

Homework Equations





The Attempt at a Solution



Take A=f(t1,t2,..,tn)=t^kf(t1,t2,..,tn)

Then find dA/dt...

I keep lost in the differentiation. Am I even on the right track? Any help is appreciated.
 
HallsofIvy said:
You mean "f(tx1, tx2, tx3,... txn)=t^s*f(x1, x2, x3,... xn) for all t"

You're right. I apologize for my mistake.
 
Alright, here's my attempt.

f(tx1, tx2, tx3,... txn)=t^s*f(x1, x2, x3,... xn) for all t

Prove that the \sum from i=1 to n of xi * df/dxi (x1, x2, x3,... xn) = sf(x1, x2, x3,... xn).

Proof.

Let f = f (x1, x2, x3,...,xn).

Then, by differentiating the function f(ty) = t^(s)f(y) by the chain rule,

\partial/\partialx1f(ty)d/dt(ty1) + ... + \partial/\partialxnf(ty)d/dt(tyn) = st^(s-1) f(y).

So, y1\partial/\partialx1f(ty) + ... + yn\partial/\partialxnf(ty) = st^(s-1)f(y).

This is the best I could come up with. I'm pretty confused, honestly.
 
hth said:
Alright, here's my attempt.

f(tx1, tx2, tx3,... txn)=t^s*f(x1, x2, x3,... xn) for all t

Prove that the \sum from i=1 to n of xi * df/dxi (x1, x2, x3,... xn) = sf(x1, x2, x3,... xn).

Proof.

Let f = f (x1, x2, x3,...,xn).

Then, by differentiating the function f(ty) = t^(s)f(y) by the chain rule,

\partial/\partialx1f(ty)d/dt(ty1) + ... + \partial/\partialxnf(ty)d/dt(tyn) = st^(s-1) f(y).

So, y1\partial/\partialx1f(ty) + ... + yn\partial/\partialxnf(ty) = st^(s-1)f(y).

This is the best I could come up with. I'm pretty confused, honestly.

Are you responding to my suggestion? It isn't clear to me. Don't call all the xi the same thing y. You want to start with

g(t) = f(tx1,tx2,...,txn) =tnf(x1, x2,... xn)
and differentiate with respect to t similar to what you have shown. Then do what I did.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top