Topology: Bijection with Open intervals

AI Thread Summary
To prove that any two open intervals (a,b) and (c,d) are equivalent, the function f(x) = ((d-c)/(b-a))*(x-a)+c must be shown to be a bijection. This involves demonstrating that f is one-to-one, meaning if f(x) = f(y), then x must equal y, which can be verified through algebraic manipulation. Additionally, to establish that f is onto, it must be shown that for every y in (c,d), there exists an x in (a,b) such that f(x) = y, ensuring that the entire interval (c,d) is covered. The discussion also suggests exploring variations of the bijection to include intervals like (c,d] and using countable subsets for further proof. Understanding these concepts solidifies the equivalence of open intervals in real numbers.
MathColie
Messages
2
Reaction score
0
Good Morning,
I am trying to prove that any 2 open intervals (a,b) and (c,d) are equivalent.
Show that f(x) = ((d-c)/(b-a))*(x-a)+c is one-to-one and onto (c,d).

a,b,c,d belong to the set of Real numbers with a<b and c<d.
Let f: (a,b)->(c,d) be a linear function which i graphed to help me visualize, restricting the domain to (a,b). I know I have to prove that f is a bijection but I am not sure how to do this.
I know that I am supposed to show that any two open intervals are equivalent, even if the intervals are different lengths, so the open interval (3,4) is equivalent to the open interval (1,8), (3,4) is a subset of (1,9).

I would appreciate any help with this if you can get me on the right track...thanks so much!:confused:
 
Physics news on Phys.org
MathColie said:
Good Morning,
I am trying to prove that any 2 open intervals (a,b) and (c,d) are equivalent.
Show that f(x) = ((d-c)/(b-a))*(x-a)+c is one-to-one and onto (c,d).

a,b,c,d belong to the set of Real numbers with a<b and c<d.
Let f: (a,b)->(c,d) be a linear function which i graphed to help me visualize, restricting the domain to (a,b). I know I have to prove that f is a bijection but I am not sure how to do this.
I know that I am supposed to show that any two open intervals are equivalent, even if the intervals are different lengths, so the open interval (3,4) is equivalent to the open interval (1,8), (3,4) is a subset of (1,9).

I would appreciate any help with this if you can get me on the right track...thanks so much!:confused:

You prove that it is a bijection by proving just what you said: that it is one-to-one and onto.

one-to-one: if f(x)= f(y) then x= y: if ((d-c)/(b-a))*(x-a)+c= ((d-c)/(b-a))*(y-a)+c just do the algebra1

onto: if y is in (c,d), you must show that there exist an x in (a, b) so that f(x)= y. That is, if y= ((d-c)/(b-a))*(x-a)+c, with c< y< d, solve for x and show that a< x< b.
 
Once you've done that, then for fun you can modify that bijection to prove that (a,b) and (c,d] (or variations of that) are equivalent. Just take an infinite countable subset of each (e.g. a rational subset) so that d maps into the subset of (a,b) and then all the elements of the subset get "shifted over" by index, and all the other elements mapped using your bijection.
 
Last edited:
OK Thanks so much. That was very helpful, I understand this now :smile:
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top