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.pool_revenue_eq
Let α,γ be real numbers with 0<α and α<21 (named, usable hypotheses) and no hypothesis on γ. Then
rα,γpool=πα(tie)⋅(α⋅2+γ(1−α)⋅1)+πα(lead1)⋅((1−α)⋅2)+(n=0∑∞′πα(leadn+2))⋅((1−α)⋅1).
Left-hand side. rα,γpool is the custom poolRevenue αγ, the custom stateSum of s↦πα(s)gα,γpool(s):
rα,γpool=πα(zero)gα,γpool(zero)+πα(tie)gα,γpool(tie)+n=0∑∞′πα(leadn)gα,γpool(leadn),
with gα,γpool(s)=∑opα,γ(o)⋅poolGain(s,o), where pα,γ(pool)=α, pα,γ(honestOnPool)=(1−α)γ, pα,γ(honestOnOthers)=(1−α)(1−γ), and poolGain: (tie,pool)↦2, (tie,honestOnPool)↦1, (tie,honestOnOthers)↦0, (lead1,pool)↦0, (lead1,either honest)↦2, (leadm+2,pool)↦0, (leadm+2,either honest)↦1, and 0 otherwise (all of zero and all of lead0). Hence
gα,γpool(zero)=0,gα,γpool(tie)=2α+(1−α)γ,gα,γpool(lead0)=0,gα,γpool(lead1)=2(1−α)γ+2(1−α)(1−γ),gα,γpool(leadm+2)=(1−α)γ+(1−α)(1−γ).
So the left-hand side equals πα(tie)(2α+(1−α)γ)+∑n′πα(leadn)gα,γpool(leadn), where the tail is a single tsum over all n∈N whose n=0 term is 0, whose n=1 term is πα(lead1)⋅2((1−α)γ+(1−α)(1−γ)), and whose terms for n≥2 are πα(leadn)((1−α)γ+(1−α)(1−γ)); this tsum is 0 if that family is not summable.
Right-hand side. Three explicit terms: the tie term with coefficient 2α+γ(1−α); the lead1 term with coefficient 2(1−α); and a separate tsum over n∈N of πα(leadn+2) (the lead states of index ≥2), multiplied by (1−α). This second tsum is likewise 0 if the family n↦πα(leadn+2) is not summable. The two sides therefore involve two different tsums, each with its own summability convention, and the statement equates them after the finite bookkeeping above. The right-hand side uses the factor (1−α) where the left-hand side has (1−α)γ+(1−α)(1−γ).
πα. The custom family stationary α: πα(zero)=(1−2α)/D(α), πα(tie)=(1−α)(α−2α2)/D(α), πα(leadn)=(α/(1−α))n(α−2α2)/D(α), D(α)=2α3−4α2+1, real division by zero equal to 0 (if D(α)=0 both sides are 0). Under the hypotheses 1−α=0. The identity is asserted for every α∈(0,21) and every real γ.
Confirmed by the moderator at approval.