I know mathematical induction can be used to prove that a statements is true for all natural numbers (or those belonging to a certain subset of N). However, it is pretty obvious, unless I'm terribly mistaken, that this method can be expanded for any integer, as any integer can be expressed as a natural number or its opposite. However, since rational numbers are defined as a fraction of two integers, induction should also be expandable into rational numbers as well. If x is a rational number, it can be expressed as a/b where a,b are integers and b does not equal 0. So, if I want to prove a statement P(x)=P(a/b) is true for every x, is it sufficient to prove it for (a+1)/b and a/(b+1)? If not, would it be sufficient to also prove it for (a+1)/(b+1), or should a different method altogether be used?
[Math] How to expand mathematical induction to rational numbers
inductionnatural numbersrational numbers
Related Solutions
I think the problem is that if you simply state those definitions exactly as they are you'll fall in the problem of not having defined the notion of "a quotient of integers". So the good and cool definition of rationals that solve all of these problems is to introduce one equivalence relation in a certain set. I don't know if you are used to equivalence relations (or even relations at all), so I'll talk about that first.
If you have two sets $A$ and $B$ you can create a relation $R$ between them which is a subset of the cartesian product $R\subset A\times B$. Think for a minute, elements of $A\times B$ are pairs $(a,b)$ with $a\in A$ and $b\in B$, so if $(a,b)\in R$ we are telling that $a$ is in some way related to $b$ and in this case we write $aRb$. Now, an equivalence relation can be introduced between a set and itself to mimic equality, it is usually denoted $\sim$ and satisfies those properties:
- $a\sim a$ (Reflexivity)
- $a \sim b \Longrightarrow b \sim a$ (Symmetry)
- $a \sim b \wedge b \sim c \Longrightarrow a\sim c$ (Transitivity)
In the third one the $\wedge$ symbol means AND. Look now that equality always obeys those three properties. So when we have a set and we want to construct a notion of the objects being equivalent without being equal we use an equivalence relation. Now, given a set $A$, an equivalence relation $\sim$ in $A$ and some element $a \in A$ the set of all other elements of $A$ equivalent to $a$ by $\sim$ is called equivalence class and denoted $\left[a\right]$. The set of all equivalence classes is called the quotient set and denoted $A/\sim$ and although the elements are sets of elements of $A$ we can usually think of $A/\sim$ as just the elements of $A$ with $\sim$ imposed on them.
Now returning to your problem! Given the set $\mathbb{Z}\times (\mathbb{Z}\setminus\{0\})$, in other words, ordered pairs of integers without any pair with $0$ in the second element we introduce the following equivalence relation $\sim$ on the set:
$$(a,b)\sim(a',b') \Longleftrightarrow ab'=a'b$$
Now stop for a while and look what we did! We are almost defining the quocient of integers. If we introduce the notation:
$$\frac{a}{b}=\left\{(a',b') \in \mathbb{Z}\times (\mathbb{Z}\setminus\{0\}) : (a',b')\sim (a,b)\right\}$$
We have exactly what the quotient is: the equivalence class of all those elements $(a,b)$ with the relation imposed. Proving this is really an equivalence relation is a good exercise. Now, look what I've said before: formally we define the quotient using equivalence classes but in practice we simply think of it as the element $(a,b) \in \mathbb{Z}\times(\mathbb{Z}\setminus\{0\})$ with the relation $\sim$ imposed.
Now, we define the set of rationals by:
$$\mathbb{Q}=(\mathbb{Z}\times(\mathbb{Z}\setminus\{0\}))/\sim$$
In other words, the set of rationals is the set of all quotients of integers, recalling that we defined the quotient as that equivalence class. With this your first definition is obviously equivalent (indeed we just made it formal using this thought) and the second is the exact same thing.
I hope this helps you somehow! Good luck!
$$\begin{align*} \lambda &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \beta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \xi &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \zeta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \alpha\zeta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \xi\beta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \alpha\zeta - \xi\beta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \beta\zeta &\color{red}\leftarrow \color{red}{\textrm{integer}} \\ \frac{\alpha\zeta-\beta\xi}{\beta\zeta} &\color{red}\leftarrow \color{red}{\frac{\textrm{integer}}{\textrm{integer}}} \end{align*}$$
Best Answer
You need to do a little more work, because as you noted in the case for integers you must take into account negatives. Thus it suffices to show the following: