Recall the definition of absolute value:
|x| = {x if x≥0, -x if x<0}
Note that if x≤0, then either x<0, so |x| = -x, or x = 0, thus |x| = |0| = 0 = -0 = -x, so in either case x≤0 ⇒ |x| = -x. This simplifies the proof slightly. Now, we divide into four cases:
Case 1: a≥0, b≥0
In this case, ab≥0, so |ab| = ab = |a|·|b|
Case 2: a<0, b≥0
In this case, ab≤0, so |ab| = -ab = (-a)b = |a|·|b|
Case 3: a≥0, b<0
In this case, ab≤0, so |ab| = -ab = a(-b) = |a|·|b|
Case 4: a<0, b<0
In this case, ab>0, so |ab| = ab = (-a)(-b) = |a|·|b|
So in all of these cases, |ab| = |a|·|b|. Since these cases are collectively exhaustive, it follows that |ab| = |a|·|b| is an identity, and we are done.
2007-12-15 10:04:39
·
answer #1
·
answered by Pascal 7
·
0⤊
1⤋
Absolute Value Proof
2016-12-16 03:16:04
·
answer #2
·
answered by Anonymous
·
0⤊
0⤋
i think u mean absolute value when u say abs? well, next time just us to Ls, (l l) to show absolute value.
l ab l= l a l * l b l
well, yes, because despite wat the actual values of a and b are, l a l and l b l and l ab l will all be positive. just input values:
a=2, b=-3
l (2)(-3) l = l 2 l * l -3 l
l-6l=2*3
6=6
2007-12-15 09:58:33
·
answer #3
·
answered by Harris 6
·
0⤊
1⤋
Just work through all four possible cases:
a > 0, b > 0:
|ab| = ab = |a| |b|
a > 0, b < 0:
|ab| = -ab = a(-b) = |a| |b|
a < 0, b > 0:
|ab| = -ab = (-a)b = |a| |b|
a < 0, b < 0:
|ab| = ab = (-1)(-1)ab = (-a)(-b) = |a| |b|
2007-12-15 10:09:25
·
answer #4
·
answered by Andy J 7
·
0⤊
0⤋
Well, I don't really know how to right a proof, but it makes sense if you think about it -- The absolute value of a number will always be positive, so the "positive form", or whatever you want to call it, of a * b would be equal to the "positive form" of a times the "positive form" of b
2007-12-15 09:55:27
·
answer #5
·
answered by A A 3
·
0⤊
0⤋