2

Show that, for every $x,y \in \mathbb Z$, we have:

$x \gt 0, y \gt 0 \Rightarrow xy \gt 0$

I've tried this way:

supose $x= \overline {(a,b)}, y= \overline {(c,d)}$. Then, $x \gt 0 \Rightarrow \overline {(a,b)} \gt \overline {(0,0)} \Rightarrow a \gt b$ and $y \gt 0 \Rightarrow \overline {(c,d)} \gt \overline {(0,0)} \Rightarrow c \gt d$.

I must prove that $xy \gt 0 \Rightarrow \overline {(a,b)}. \overline {(c,d)} \gt \overline {(0,0)} \Rightarrow \overline {(ac+bd,ad+bc)} \gt \overline {(0,0)} \Rightarrow ac+bd \gt ad+bc$.

Does anyone have any idea about how to connect hypothesis and thesis?

Walter r
  • 1,097

1 Answers1

1

$ac+bd>ad+bc$ iff $ac-ad>bc-bd$ iff $a(c-d)>b(c-d)$ and you can cancel $c-d$ here without reversing the inequality since you know $c>d$, giving $a>b$ which you also have as an assumption.

Of course this assumes one has subtraction defined in $\mathbb{N}$ provided one only subtracts a smaller from a larger natural number, but I think that is OK in some treatments.

Another approach: From $a>b$ there is a (positive) natural number $p$ with $a=b+p,$ and similarly from $c>d$ a positive natural number $q$ with $c=d+q.$

Then $$ac+bd=(b+p)(d+q)+bd=2bd+bq+dp+pq, \\ ad+bc=(b+p)d+b(d+q)=2bd+bq+dp.$$ Thus the first is greater than the second by the positive quantity $pq.$

coffeemath
  • 29,884
  • 2
  • 31
  • 52