I am currently working on learning proof by induction. One of the examples in my textbook is confusing me with regards to the algebraic manipulation around the induction step. Here we are trying to prove by induction that $10^0+10^1+...+10^n<10^{n+1},$ where $n$ is a natural number
The inequality is:
$$10^0+10^1+10^2+...+10^k+10^{k+1}<10^{k+1}+10^{k+1} =2\cdot10^{k+1}<10\cdot10^{k+1}=10^{k+2}$$
Can someone help me understand the algebraic manipulation that goes into getting this result?
Here, inductive hypothesis should be that we have $$10^0+10^1+10^2+...+10^k < 10^{k+1}$$ Then we are trying to verify whether $10^0+10^1+10^2+...+10^k+10^{k+1} < 10^{k+2}$ is true or not. By using inductive hypothesis, we have $$10^0+10^1+10^2+...+10^k < 10^{k+1}$$ Now, adding $10^{k+1}$ to both sides, we get $$10^0+10^1+10^2+...+10^k+10^{k+1} < 10^{k+1}+10^{k+1} = 2\cdot10^{k+1}$$ But we know that $2\cdot10^{k+1} < 10\cdot10^{k+1} = 10^{k+2}$. Therefore, by transitivity of $<$, we have $$10^0+10^1+10^2+...+10^k+10^{k+1} < 10^{k+2}$$