I Comparing two absolute value equations

marksyncm
Messages
100
Reaction score
5
Hello,

How does one go about algebraically checking if |x+|y+z|| and ||x+y|+z| are equal?
 
Mathematics news on Phys.org
marksyncm said:
Hello,

How does one go about algebraically checking if |x+|y+z|| and ||x+y|+z| are equal?
You mean as in ##|x+|y+z||=|0+|-1+1||=0 \neq 2= ||0-1|+1|=||x+y|+z|\,##?
 
Last edited:
The way that always works is to consider all possible cases. There are four absolute value signs, for each of which there are two possibilities: that the number they contain is negative or not. That gives ##2^4=16## cases to consider. If you consider each one in turn, and show that in that case the equality holds, and that is true for all cases, you will have proven the whole thing. If even one fails, it is disproven.

Often there will be a quicker way, specific to the particularities of the problem, that uses things like the triangle inequality. But if you can't find one, you can always fall back on the above 'brute force' method.
 
Another possibility is to consider the case of one variable zero, e.g. ##x=0##. If it holds you can assume the case ##x\neq 0## and divide the entire equation by ##|x|##. Thus you will have only two variables and ##\pm 1## left.
 
andrewkirk, this is exactly what I was looking for. Thank you.

fresh_42, thank you for your input as well, your last post is an interesting way of approaching this.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top