Order Theory for Generic Rounding #
Monotonicity is subtle because two inputs may be scaled with different canonical exponents. The
proof separates equal-grid inputs from inputs in different magnitude bins and uses the bounds from
Rounding.Generic in the latter case.
A representable lower value remains below rounding of any larger input.
Rounding of a smaller input remains below a representable upper value.
Directed-down generic rounding selects the greatest representable value below its input.
Directed-up generic rounding selects the least representable value above its input.
Generic truncation satisfies the toward-zero rounding specification.
A nearest rounding rule selects an integer at least as close to the input as every other integer.
Only the half-unit bound of ValidRndToNearest is used: any other integer is at distance at least
one from the selected integer, hence at least one half from the input.
Nearest generic rounding is no farther from the input than any other integer rounding.
Every nearest rounding rule selects a globally nearest representable value.
Nearest-even rounding selects a globally nearest representable value.