The split multiplication computes the product
ProvedBitcoinFeerateDiagram.mulFallback_value(mulFallback a b).1 · 2^32 + (mulFallback a b).2 = a · b.
import Definitions.Def_BitcoinFeerateDiagram open BitcoinFeerateDiagram BitcoinReplacement
theorem BitcoinFeerateDiagram.mulFallback_value (a b : ℤ) :
(FeeFrac.mulFallback a b).1 * 2 ^ 32 + (FeeFrac.mulFallback a b).2 = FeeFrac.mul a b := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinFeerateDiagram.mulFallback_value
Statement. For all integers and , writing ,
Binders and edge cases. There are no hypotheses: and range over all integers, including negative values and values outside any 64-bit or 32-bit range. The statement concerns only the combined value ; it does not separately state the range of or .
Definitions used, unfolded
Division conventions. Three kinds of division occur.
- Default integer division with remainder (Euclidean convention). For : and , also for negative (e.g. , ). For : and . For : and .
- Truncated division with remainder : the quotient is rounded toward zero, so the remainder is or has the sign of , with (e.g. , ). For : , .
- Rational division in , with the convention . For , is the greatest integer and the least integer .
Below, denotes if the condition holds and otherwise.
mul. , the exact product of two integers.
mulFallback. For integers , with default (floor) integer division by :
Here and also for negative ; the second output component lies in . No bounds on are assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.