\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Natural Order
Natural Products
Needed by:
None.
Links:
Sheet PDF
Graph PDF

Order and Arithmetic

Why

How does arithmetic preserve order?

Results

The following are standard useful results.1

If $m < n$, then $m + k < n + k$ for all $k$.
If $m < n$ and $k \neq 0$, then $m \cdot k < n \cdot k$.
If $E$ is a nonempty set of natural numbers, there exists $k \in E$ such that $k \leq m$ for all $m \in E$.
If $E$ is a nonempty set of natural numbers, there exists $k \in E$ such that $m \leq k$ for all $m \in E$.

  1. The accounts of which will appear in future editions. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view