Comparing two absolute value equations

Click For Summary

Discussion Overview

The discussion revolves around the algebraic verification of the equality between the expressions |x+|y+z|| and ||x+y|+z|. Participants explore methods for checking this equality, including case analysis and specific variable substitutions.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant asks how to algebraically check if |x+|y+z|| and ||x+y|+z| are equal.
  • Another participant provides a specific example to illustrate that the two expressions can yield different results, suggesting that they are not equal in that case.
  • A participant suggests that considering all possible cases is a reliable method, noting that there are 16 cases to analyze due to the four absolute value signs.
  • Another participant proposes checking the case where one variable is zero, which could simplify the problem by reducing the number of variables involved.
  • Some participants express appreciation for the suggestions provided, indicating that the discussion is helpful.

Areas of Agreement / Disagreement

Participants do not reach a consensus on whether the two expressions are equal, as different approaches and examples are presented, leading to uncertainty regarding the equality.

Contextual Notes

The discussion highlights the complexity of absolute value equations and the need for careful case analysis. Specific assumptions about variable values are not fully explored, and the implications of each method are not resolved.

Who May Find This Useful

Individuals interested in algebra, particularly those dealing with absolute value equations, may find the various approaches and discussions beneficial.

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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K