athena810 said:
Will this work?
So definition of | |: The positive value of any real number.
Case 1: If x, y >= 0..then |x| = x, |y| = y, xy >= 0. Thus |xy| =xy = |x||y|?
OK you give an informal definition that sounds like what someone said in class explaining it to you. And maybe your memory. H of I is surprised if that is in a book. Use the book.
To be able to use definition you really need the formal one given by HofI.
This bit
Case 1: If x, y >= 0..then |x| = x, |y| = y,
is OK. The rest is all true but it doesn't seem to me a proof argument.
I suggest you do things like this by numbers so it is clear where everything comes from and fits in. I will give my version as model with which you could do the second bit.
1 Definition of |x| as per HofI. (Def 1)
Remark: use of the ≥ has reduced our cases to two not three.
2 Case 1. x ≥ 0, y ≥ 0 (condition A)
By Def 1 (1) |x| = x, |y| = y. Therefore in case 1 |x|*|y| = x * y
3 Still case 1, from condition (A), x * y ≥ 0
4 From Def 1 and 3, |x * y| = x * y
5 Two things that are equal to a third thing are equal to each other.
So the two things we found above each equal to x*y are equal to each other, i.e. |x|*|y| = |x * y|
6 Case 2, |x| ≥ 0, |y| < 0 ...
I don't say this is perfect (it is not my field) but do you see this more like a logical proof, not a handwaving?
It lays bare assumptions, e.g. 3 is I guess an assumption carried over from basic arithmetic and algebra, and line 1 of 5 is an assumed property of " = " , I think you will hear talk of "equivalence relations".