Bounded fixed-point conversion proofs #
The fixed-integer codec theorems connect each conversion policy to its signed coefficient: checked conversion preserves an in-range coefficient, wrapping takes centered reduction, and saturation clamps to the signed range. These relations retain the complete outcome and status.
Wrapping delivers the centered remainder of the nearest-even coefficient.
An in-range coefficient is preserved, including the sole zero-width coefficient.
Saturating conversion delivers the clamped nearest-even coefficient at every width.
Finite observations are handled by the selected bounded-overflow policy.
Bounded fixed point has no infinity code.
Bounded fixed point has no exceptional code.
The fixed-integer codec laws establish the independent coefficient and range clauses.
The coefficient policy and full status determine a unique complete outcome.
The independent coefficient contract preserves the converter's complete word and status.
The installed decoder exposes the exact stored rational.
Checked conversion reports outOfRange exactly when the checked constructor fails.