# Order isomorphism f:R->R

1. Jan 4, 2009

### TTob

order isomorphism f:R-->R

let f is order isomorphism from (R,<) to (R,<). why f is continuous ?
so f is bijection and a<b <--> f(a)<f(b), so what ?

2. Jan 6, 2009

### HallsofIvy

Re: order isomorphism f:R-->R

f maps the interval [a, a+ epsilon] one to one and onto the interval [f(a),f(a+ epsilon)]. As epsilong goes to 0, f(a+ epsilon) must go to a, hence continuity.

3. Jan 7, 2009

Re: order isomorphism f:R-->R

Another way of proving it is by showing that inverse images of open sets of R (in the order topology) are open. This is easy; testing just elements of a basis for the topology (such as the set of bounded open intervals) suffices. Given an open interval (c, d), c = f(a) and d = f(b) for some a and b, and it's easy to see that f-1((c, d)) = (a, b), which is open.

(This works equally well for any ordered set.)

Similar Threads - Order isomorphism Date
I Order of "Extracted Factors" in SPSS Factor Analysis Jul 24, 2017
A Transcription from SQL to FOL (First Order Logic) Jun 3, 2017
A First order logic : Predicates Jun 1, 2017
Order isomorphism Dec 26, 2011
Order isomorphism Aug 13, 2007