Activation enclosures for executable binary intervals #
ReLU, absolute value, and square root have enclosure and interval-validity theorems with
operation-specific hypotheses. The executable definitions live in Interval.Activations; shared
endpoint order and negation facts come from IntervalSemantics.Arithmetic.
ReLU and absolute value work for every descriptor and accept ordered non-NaN endpoints, including infinities from an earlier operation. Their finite-input theorems specialize the same proofs. Square root uses directed IEEE rounding and requires finite valid input bounds with a nonnegative lower endpoint. These differences appear in the theorem statements rather than in a second interval carrier or an implicit execution mode.
ReLU #
The ReLU interval encloses each member's ReLU, including with infinite endpoints.
ReLU preserves ordered, non-NaN endpoints in every format.
Executable interval ReLU encloses the ReLU of every represented real value.
Absolute value #
Absolute value encloses every represented real magnitude, including with infinite endpoints.
Absolute value preserves ordered, non-NaN endpoints in every format.
Directed square root #
Executable interval square root encloses the square root of every represented real value.
The lower endpoint's decoded value must be nonnegative. Validity and endpoint order then imply that the upper endpoint is nonnegative as well.
Square root maps a finite valid nonnegative interval to an ordered interval with non-NaN endpoints. The extended-valid conclusion avoids requiring a separate output-finiteness premise.