anelys
Nov3-09, 11:42 AM
1. The problem statement, all variables and given/known data
f(a) > c > f(b)
A = { x : b > x > y > a implies f(a) > f(y) }
let u = sup(A)
show that f(u) = c
2. Relevant equations
I have no idea in particular, save for the definition of the supremum:
\forall x \in A x \le u
if v is an upper bound of A, then u \le v
3. The attempt at a solution
My intuition led me to attempt a proof by contradiction. If you let f(x*) = c, assume that x* < u to arrive at a contradiction. Then assume that x* > u to arrive at a contradiction. Then to conclude that x* must be u. I don't know how to do this, or even if I can/should be done.
f(a) > c > f(b)
A = { x : b > x > y > a implies f(a) > f(y) }
let u = sup(A)
show that f(u) = c
2. Relevant equations
I have no idea in particular, save for the definition of the supremum:
\forall x \in A x \le u
if v is an upper bound of A, then u \le v
3. The attempt at a solution
My intuition led me to attempt a proof by contradiction. If you let f(x*) = c, assume that x* < u to arrive at a contradiction. Then assume that x* > u to arrive at a contradiction. Then to conclude that x* must be u. I don't know how to do this, or even if I can/should be done.