What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinSelfishMining.threshold_gamma_zero
Let α be a real number with 0<α and α<21 (named, usable hypotheses). Then the following are equivalent (if and only if):
Rα,0>α⟺α>31,
both inequalities strict, where Rα,0 is the custom relativeRevenue evaluated at γ=0. The right-hand side is the literal rational constant 31 (the statement does not mention profitThreshold).
Unfolding at γ=0. The outcome weights become p(pool)=α, p(honestOnPool)=(1−α)⋅0=0, p(honestOnOthers)=(1−α)⋅(1−0)=1−α. Then
Rα,0=rα,0pool+rα,0othrα,0pool(=0 if the denominator is 0),
with
rα,0pool=πα(zero)⋅0+πα(tie)(2α+0⋅1+(1−α)⋅0)+n=0∑∞′πα(leadn)gα,0pool(leadn),
where gα,0pool(lead0)=0, gα,0pool(lead1)=0⋅2+(1−α)⋅2=2(1−α), gα,0pool(leadm+2)=0⋅1+(1−α)⋅1=1−α, and
rα,0oth=πα(zero)(0⋅1+(1−α)⋅1)+πα(tie)(0⋅1+(1−α)⋅2)+n=0∑∞′πα(leadn)⋅0.
Each ∑′ is Mathlib's tsum over n∈N (0 if the family is not summable; the all-zero family sums to 0). πα is stationary α: πα(zero)=(1−2α)/D(α), πα(tie)=(1−α)(α−2α2)/D(α), πα(leadn)=(α/(1−α))n(α−2α2)/D(α), D(α)=2α3−4α2+1, with real division by zero equal to 0.
So the theorem asserts that, for every α∈(0,21), the real number Rα,0 strictly exceeds α exactly when α>31; in particular for α∈(0,31] it asserts Rα,0≤α. Nothing is said about α outside (0,21).
Confirmed by the moderator at approval.