How Do We Prove That All Variables Are Zero If Their Squares Sum to Zero?

  • Thread starter Thread starter evagelos
  • Start date Start date
AI Thread Summary
The discussion centers on proving that if the sum of squares of variables equals zero, then each variable must be zero. The initial consensus is that this can be approached through mathematical induction. The base case for one variable is straightforward, but the challenge lies in extending the proof to n=k+1. A proposed method involves using the properties of non-negative numbers, specifically that if the sum of two non-negative terms equals zero, then both must be zero. The conversation highlights the need for a clear logical progression in the proof, particularly when moving from k to k+1.
evagelos
Messages
314
Reaction score
0
Every body knows that:

x_{1}^2+x_{2}^2...x_{n}^2 =0\Longrightarrow x_{1}=0\wedge x_{2}=0...\wedge x_{n}=0.


But how do we prove that?

Perhaps by using induction?

For n=1 .o.k

Assume true for n=k

And here now is the difficult part .How do we prove the implication for n=k+1??
 
Physics news on Phys.org
Induction sounds like a bit of overkill here, but if you insist...
Of course it is true that if
a + b = 0
then either a = b = 0, or a = -b (not equal to 0).
You can use this for
a = x_1^2 + x_2^2 + \cdots + x_n^2, \quad b = x_{n + 1}^2
and use that x_i^2 \ge 0 for all i.
 
Back
Top