Prove Inequality: |x-x_0|, |y-y_0| & xy-x_0y_0<\epsilon

  • Thread starter Thread starter objectivesea
  • Start date Start date
  • Tags Tags
    Inequality Proof
Click For Summary
The discussion centers on proving the inequality xy - x_0y_0 < ε under specific conditions for x and y. Participants express uncertainty about the initial conditions, particularly regarding the bounds for |y - y_0|. Clarification is sought on whether the minimum function should be applied differently in the inequalities. The conversation emphasizes the importance of proving that ε/(2|x_0| + 1) is less than 1 to support the argument. The discussion concludes with suggestions for further steps in the proof using established mathematical properties.
objectivesea
Messages
6
Reaction score
0

Homework Statement



Prove that if |x-x_0| &lt; \textrm{min} \bigg ( \frac{\epsilon}{2|y_0|+1},1 \bigg ) and |y-y_0| &lt; \frac{\epsilon}{2|x_0|+1} then xy-x_0y_0&lt;\epsilon

Homework Equations


We can use basic algebra and the following axioms:
For any number a, one and only one of the following holds:
(i) a=0
(ii) a is in the collection P
(iii) -a is in the collection P
Note: A number n is the collection P if and only if n&gt;0

If a and b are in P, then a+b is in P.

If a and b are in P, then a \cdot b is in P.

We may also use the following consequences of the above axioms:

For any numbers aand b, one and only one of the following holds:
(i) a=b
(ii) a &lt; b
(iii)a &gt; b

For any numbers a, b, and c, if a&lt;b and b&lt;c, then a&lt;c.

For any numbers a, b, and c, if a&lt;b, then a+c&lt;b+c.

For any numbers a, b, and c, if a&lt;b and 0&lt;c, then ac&lt;bc.


The Attempt at a Solution



I'm not even sure where to start.
 
Physics news on Phys.org
Are you sure it's not
<br /> |y-y_0| &lt; \textrm{min} \bigg (\frac{\epsilon}{2|x_0|+1},1 \bigg )<br />?
 
praharmitra said:
Are you sure it's not
<br /> |y-y_0| &lt; \textrm{min} \bigg (\frac{\epsilon}{2|x_0|+1},1 \bigg )<br />?

I just double checked. I'm sure.
 
objectivesea said:
I just double checked. I'm sure.

But if |y-y_0|&lt;\textrm{min} \bigg ( \frac {\epsilon}{2|x_0|+1},1 \bigg )
then |y-y_0|&lt; \frac {\epsilon}{2|x_0|+1}
Since if \textrm{min} \bigg ( \frac {\epsilon}{2|x_0|+1},1 \bigg )=\frac {\epsilon}{2|x_0|+1} then |y-y_0|&lt;\frac {\epsilon}{2|x_0|+1}\leq 1.
And if \textrm{min} \bigg ( \frac {\epsilon}{2|x_0|+1},1 \bigg )=1 then |y-y_0|&lt;1 \leq \frac {\epsilon}{2|x_0|+1}\

either way |y-y_0|&lt; \frac {\epsilon}{2|x_0|+1}
 
No, I actually want the fact that |y-y_0|&lt;1 in addition to all your above expressions. Now I am wondering, given your first inequality, is it possible to prove that

\frac{\epsilon}{2|x_0|+1} &lt;1. Do you think you can try to prove that?

If you can do that, then afterwards use the following:

1. min(a,b) \leq a,~min(a,b)\leq b

2. |x-x_0| \geq |x|-|x_0|

and proceed from there. But first try the first thing. Something I am not able to do.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 26 ·
Replies
26
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 0 ·
Replies
0
Views
367
Replies
32
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K