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.others_revenue_eq
For every real α and every real γ, with no hypotheses whatsoever (no positivity, no upper bound, no restriction to [0,1]),
rα,γoth=πα(tie)⋅((1−α)(1−γ)⋅2+γ(1−α)⋅1)+πα(zero)⋅((1−α)⋅1).
Left-hand side. rα,γoth is the custom othersRevenue αγ, defined as the custom stateSum of s↦πα(s)gα,γoth(s):
rα,γoth=πα(zero)gα,γoth(zero)+πα(tie)gα,γoth(tie)+n=0∑∞′πα(leadn)gα,γoth(leadn),
where gα,γoth(s)=∑opα,γ(o)⋅othersGain(s,o) over the three outcomes, with pα,γ(pool)=α, pα,γ(honestOnPool)=(1−α)γ, pα,γ(honestOnOthers)=(1−α)(1−γ), and othersGain: (zero,pool)↦0, (zero,either honest)↦1, (tie,honestOnPool)↦1, (tie,honestOnOthers)↦2, and 0 for every other pair (in particular (tie,pool)↦0 and (leadn,o)↦0 for all n,o). Hence
gα,γoth(zero)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅1,gα,γoth(tie)=α⋅0+(1−α)γ⋅1+(1−α)(1−γ)⋅2,gα,γoth(leadn)=0,
so every term of the tail tsum is 0 and the tail contributes 0 (the zero family is summable). Thus the left-hand side equals
πα(zero)((1−α)γ+(1−α)(1−γ))+πα(tie)((1−α)γ+2(1−α)(1−γ)).
Right-hand side. The coefficient of πα(tie) is 2(1−α)(1−γ)+γ(1−α), and the coefficient of πα(zero) is (1−α) (written as (1−α)⋅1). So, after cancelling the common tie coefficient, the content of the statement is that πα(zero)((1−α)γ+(1−α)(1−γ))=πα(zero)(1−α).
πα. The custom family stationary α: πα(zero)=(1−2α)/D(α), πα(tie)=(1−α)(α−2α2)/D(α), D(α)=2α3−4α2+1, with real division by zero equal to 0 (if D(α)=0 both sides are 0). Since α,γ are arbitrary reals, the identity is asserted for all of R2, including values where πα is negative or where the "weights" pα,γ are negative.
Confirmed by the moderator at approval.