Prove $x^n(y-z) + y^n(z-x) + z^n(x-y)$ is divisible by $(y-z)(z-x)(x-y)$
Clash Royale CLAN TAG#URR8PPP
up vote
4
down vote
favorite
I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$
is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.
-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?
polynomials symmetric-polynomials
add a comment |Â
up vote
4
down vote
favorite
I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$
is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.
-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?
polynomials symmetric-polynomials
1
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
3
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
1
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
4
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29
add a comment |Â
up vote
4
down vote
favorite
up vote
4
down vote
favorite
I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$
is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.
-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?
polynomials symmetric-polynomials
I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$
is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.
-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?
polynomials symmetric-polynomials
edited Aug 25 at 5:11
Brahadeesh
4,13831550
4,13831550
asked Aug 25 at 4:08
Leonardo V. Sailer
285
285
1
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
3
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
1
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
4
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29
add a comment |Â
1
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
3
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
1
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
4
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29
1
1
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
3
3
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
1
1
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
4
4
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29
add a comment |Â
4 Answers
4
active
oldest
votes
up vote
3
down vote
accepted
Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.
You can do the analogous steps to get the other two factors.
add a comment |Â
up vote
3
down vote
Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.
One alternative path is to proceed by direct factoring. This starts as follows:
$$
beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
& = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
& = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
endalign*
$$
The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
$$
Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
$$
Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
add a comment |Â
up vote
2
down vote
Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
add a comment |Â
up vote
0
down vote
If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.
add a comment |Â
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.
You can do the analogous steps to get the other two factors.
add a comment |Â
up vote
3
down vote
accepted
Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.
You can do the analogous steps to get the other two factors.
add a comment |Â
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.
You can do the analogous steps to get the other two factors.
Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.
You can do the analogous steps to get the other two factors.
answered Aug 25 at 4:56
Zarrax
34.8k248102
34.8k248102
add a comment |Â
add a comment |Â
up vote
3
down vote
Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.
One alternative path is to proceed by direct factoring. This starts as follows:
$$
beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
& = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
& = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
endalign*
$$
The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
$$
Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
$$
Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
add a comment |Â
up vote
3
down vote
Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.
One alternative path is to proceed by direct factoring. This starts as follows:
$$
beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
& = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
& = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
endalign*
$$
The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
$$
Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
$$
Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
add a comment |Â
up vote
3
down vote
up vote
3
down vote
Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.
One alternative path is to proceed by direct factoring. This starts as follows:
$$
beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
& = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
& = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
endalign*
$$
The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
$$
Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
$$
Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.
Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.
One alternative path is to proceed by direct factoring. This starts as follows:
$$
beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
& = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
& = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
endalign*
$$
The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
-z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
$$
Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
$$
Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.
answered Aug 25 at 5:07
Rolf Hoyer
10.6k31629
10.6k31629
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
add a comment |Â
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
1
1
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
Thanks for your nice answer! Really appreciate it.
â Leonardo V. Sailer
Aug 25 at 5:18
add a comment |Â
up vote
2
down vote
Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
add a comment |Â
up vote
2
down vote
Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.
Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.
answered Aug 25 at 4:40
tarit goswami
1,127119
1,127119
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
add a comment |Â
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
â Leonardo V. Sailer
Aug 25 at 5:01
add a comment |Â
up vote
0
down vote
If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.
add a comment |Â
up vote
0
down vote
If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.
If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.
answered Aug 26 at 19:16
dmtri
768317
768317
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%2f2893791%2fprove-xny-z-ynz-x-znx-y-is-divisible-by-y-zz-xx-y%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
1
$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
â Lord Shark the Unknown
Aug 25 at 4:11
3
Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
â Gerry Myerson
Aug 25 at 4:20
1
So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
â Leonardo V. Sailer
Aug 25 at 4:25
4
No, this is not stupid question.
â Takahiro Waki
Aug 25 at 4:29