MHB Polynomial in n variables: Prove the identity

AI Thread Summary
The discussion focuses on proving the identity involving a polynomial in n variables of degree less than or equal to n-1. The identity states that the alternating sum of the polynomial evaluated at all combinations of binary inputs equals zero. It is emphasized that the proof can be simplified by considering the polynomial in a specific monomial form. The key point is that the linearity of the identity allows for this reduction. Ultimately, the identity holds true for all such polynomials, confirming the initial assertion.
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Suppose $f$ is a polynomial in $n$ variables, of degree $ \le n − 1$, ($n = 2, 3, 4 ...$ ).Prove the identity:

\[\sum (-1)^{\epsilon_1+\epsilon_2+\epsilon_3+ ...+\epsilon_n}f(\epsilon_1,\epsilon_2,\epsilon_3,...,\epsilon_n) = 0\;\;\;\;\; (1)\]

where $\epsilon_i$ is either $0$ or $1$, and the sum is over all $2^n$ combinations.

Hint: The identity $(1)$ is linear in $f$, so it suffices to prove it for $f$ of the form

$f(x_1, x_2, x_3,..., x_n) = x_1^{p_1}x_2^{p_2}x_3^{p_3}...x_n^{p_n}$, where $p_1+p_2+p_3 + ... + p_n \le n-1$.
 
Mathematics news on Phys.org
Solution:
Because of the last restriction, at least one of the $p_i$ is $0$, say $p_n = 0$. Then writing the whole sum as the sum of the terms with $\epsilon_n = 0$ and those with $\epsilon_n = 1$, we have:
\[S = (-1)^0 \sum_{\epsilon_1,\epsilon_2,...,\epsilon_{n-1}} (-1)^{\epsilon_1+\epsilon_2+\epsilon_3+ ...+\epsilon_{n-1}}\epsilon_1^{p_1}\epsilon_2^{p_2}...\epsilon_{n-1}^{p_{n-1}} + (-1)^1 \sum_{\epsilon_1,\epsilon_2,...,\epsilon_{n-1}} (-1)^{\epsilon_1+\epsilon_2+\epsilon_3+ ...+\epsilon_{n-1}}\epsilon_1^{p_1}\epsilon_2^{p_2}...\epsilon_{n-1}^{p_{n-1}}\]
- which is the difference of two identical terms, hence $S = 0$.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top