Proof Verification: Show that $\Big[\frac{x+n}{m}\Big] = \bigg[\frac{[x]+n}{m}\bigg]$

Let $m,n \in \mathbb{Z}$ and let $x \in \mathbb{R}$. Let $[x]$ denote the floor function.

We will attempt to prove

$$\Big[\frac{x+n}{m}\Big] = \bigg[\frac{[x]+n}{m}\bigg]$$

Suppose without loss of generality that $m > 0$.

By definition of the floor function on $\frac{x+n}{m}$, we have

$$\Big[\frac{x+n}{m}\Big] \leq \frac{x+n}{m} \tag{1}$$

We observe that $\Big[\frac{x+n}{m}\Big]$ is the closest integer to $\frac{x+n}{m}$ satisfying $(1)$.

If $[x]+n \leq x+n$, then

$$\frac{[x]+n}{m} \leq \frac{x+n}{m} \tag{2}$$

Once more applying the definition of the floor function on $(2)$,

$$\bigg[\frac{[x]+n}{m}\bigg] \leq \frac{[x]+n}{m} \leq \frac{x+n}{m} \tag{3}$$

To prove that there are no integers in the interval $\Big(\frac{[x]+n}{m}, \frac{x+n}{m}\Big)$, specifically $\big[\frac{x+n}{m}\big]$, we suppose to the contrary that such an integer $q$ exists satisfying

$$\frac{[x]+n}{m} < q < \frac{x+n}{m} \tag{4}$$

But $(4)$ implies that $[x] < mq-n < x$ where $(mq-n) \in \mathbb{Z}$, which is a contradiction, since $[x]$ is the greatest intger less than or equal to $x$.

Because there are no integers in such an interval, $\big[\frac{x+n}{m}\big]$ must satisfy

$$\Big[\frac{x+n}{m}\Big] \leq \frac{[x]+n}{m} \leq \frac{x+n}{m} \tag{5}$$

which implies that $\Big[\frac{x+n}{m}\Big]$ is the closest integer less than or equal to $\frac{[x]+n}{m}$; that is, $\Big[\frac{x+n}{m}\Big]$ is the greatest integer less than or equal to $\frac{[x]+n}{m}$.

Therefore, $\Big[\frac{x+n}{m}\Big] = \bigg[\frac{[x]+n}{m}\bigg]$, as desired.

Is there anything wrong with the proof?

Note: A proof can also be achieved using the division algorithm.

• "Suppose wlog that m>0" That "wlog" does mean something? If not, what about m<0?. Thank you. – Piquito Feb 10 '16 at 13:03
• @Piquito Yeah, it's supposed to mean without loss of generality. In other words, if we assume $m<0$, then its proof would be similar to the case $m > 0$, just interchange the inequality signs. – Jeremiah Dunivin Feb 10 '16 at 13:05
• Very well. Thank you. – Piquito Feb 10 '16 at 13:08
• @Piquito I went ahead and changed "wlog" to "without loss of generality" since you're right in the sense that not everyone may know what it means :) – Jeremiah Dunivin Feb 10 '16 at 13:08

If you rearrange equation (4), you should get $qm-n$ in the middle, not $qm+n$.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://math.stackexchange.com/questions/1649012/proof-verification-show-that-big-fracxnm-big-bigg-fracxnm-b", "fetch_time": 1571591276000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-43/segments/1570986717235.56/warc/CC-MAIN-20191020160500-20191020184000-00388.warc.gz", "warc_record_offset": 608247426, "warc_record_length": 32533, "token_count": 852, "char_count": 2425, "score": 4.5, "int_score": 4, "crawl": "CC-MAIN-2019-43", "snapshot_type": "latest", "language": "en", "language_score": 0.7777870297431946, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00016-of-00064.parquet"}