What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinSelfishErgodic.dist_mass
Setting. α,γ are arbitrary real numbers: there are no hypotheses on α or γ. Also μ:S→R is a function whose lead values form a summable sequence, ∑m∣μ(leadm)∣<∞; nothing else is assumed (no nonnegativity, no normalization).
Assertion. One step preserves the total:
Σ(Dμ)=Σμ,i.e.(Dμ)(zero)+(Dμ)(tie)+m≥0∑(Dμ)(leadm)=μ(zero)+μ(tie)+m≥0∑μ(leadm),
where on the left the series over m is, by the convention of Σ, taken to be 0 if ((Dμ)(leadm))m is not summable (on the right it is summable by hypothesis).
Definitions used, unfolded
State space S. The states are zero, tie, and one state leadm for every natural number m=0,1,2,…; all of these are distinct. (The source comments say that leadm stands for a private lead of m+1 blocks, so lead0 is "lead 1", lead1 is "lead 2", and so on. Formally these are only labels, and every subscript below is this shifted index.)
Sum over all states. For any f:S→R,
Σf=f(zero)+f(tie)+m≥0∑f(leadm),
where the infinite series is the value of the series when the real sequence (f(leadm))m≥0 is summable (for real sequences: absolutely summable). The series is defined to be 0 when that sequence is not summable.
One-step transition weights Pα,γ. For arbitrary real numbers α,γ (the definitions themselves impose no range), there are three outcomes, with weights
qpool=α,qhP=(1−α)γ,qhO=(1−α)(1−γ).
A deterministic successor map step(s,o) is given by
| current state | outcome pool | outcome hP | outcome hO |
|---|
| zero | lead0 | zero | zero |
| tie | zero | zero | zero |
| lead0 | lead1 | tie | tie |
| lead1 | lead2 | zero | zero |
| leadm+2 (m≥0) | leadm+3 | leadm+1 | leadm+1 |
and Pα,γ(s,t)=∑o:step(s,o)=tqo (sum of the weights of the outcomes leading from s to t). Using qhP+qhO=1−α and qpool+qhP+qhO=1, the only entries that can be nonzero are
P(zero,lead0)=α,P(lead0,lead1)=α,P(lead1,lead2)=α,P(leadm+2,leadm+3)=α,P(zero,zero)=1−α,P(lead0,tie)=1−α,P(lead1,zero)=1−α,P(leadm+2,leadm+1)=1−α(m≥0),P(tie,zero)=1,
and every other entry is 0. These identities hold for every real α,γ: the transition weights do not depend on γ, each row sums to 1, and all entries are ≥0 exactly when 0≤α≤1.
One step applied to a function. For any μ:S→R (not required to be nonnegative, summable or normalized),
(Dμ)(s)=Σ(t↦μ(t)Pα,γ(t,s))=μ(zero)P(zero,s)+μ(tie)P(tie,s)+m≥0∑μ(leadm)P(leadm,s).
(The parameters α,γ are implicit in D=Dα,γ.) For a fixed target s, at most two lead states t have P(t,s)=0, so the lead series here has only finitely many nonzero terms and is an ordinary finite sum.
Confirmed by the moderator at approval.