The diagram starts at the origin
ProvedBitcoinFeerateDiagram.diagram_at_zeroFor positive chunk sizes: diagram cs 0 = 0.
import Definitions.Def_BitcoinFeerateDiagram open BitcoinFeerateDiagram BitcoinReplacement
theorem BitcoinFeerateDiagram.diagram_at_zero {cs : List FeeFrac} (h : SizesPos cs) :
diagram cs 0 = 0 := 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.diagram_at_zero
Statement. For every finite list of FeeFracs (implicit argument) satisfying — every chunk has strictly positive size —
Binders and edge cases. Fees are arbitrary integers. The empty list satisfies the hypothesis vacuously and its diagram is everywhere. For a nonempty list with , the first case of the recursion applies at , giving . The hypothesis excludes lists containing a chunk of size or of negative size; for a first chunk of negative size the recursion would take the second branch at .
Definitions used, unfolded
FeeFrac. A FeeFrac is a pair of two arbitrary integers. Nothing constrains them: either component may be zero or negative, and no machine-word bounds are imposed. Addition and subtraction are componentwise,
and the zero FeeFrac is . A chunk list is a finite list of FeeFracs; the empty list () is allowed.
diagram. For a chunk list and , is defined recursively:
with rational division (). It is defined for every rational , including negative . For the empty list it is identically . When every size is positive, writing and (with ) for , , the recursion unfolds to: for all (including negative ); for ; and for — the piecewise-linear function through , horizontal to the right. If a size is zero or negative the recursion still evaluates but need not have this shape (e.g. a chunk with gives ; a chunk with size contributes a jump of just after ).
SizesPos. means for every chunk in (vacuously true for the empty list). It says nothing about fees, which may be zero or negative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.