Balance at states k ≥ 3
ProvedBitcoinSelfishMining.balance_leadFor and every : (in the encoding, stationary α (lead (n+2)) = α · stationary α (lead (n+1)) + (1-α) · stationary α (lead (n+3))).
import Definitions.Def_BitcoinSelfishMining
theorem BitcoinSelfishMining.balance_lead (α : ℝ) (h0 : 0 < α) (h1 : α < 1 / 2) (n : ℕ) :
BitcoinSelfishMining.stationary α (.lead (n + 2)) =
α * BitcoinSelfishMining.stationary α (.lead (n + 1))
+ (1 - α) * BitcoinSelfishMining.stationary α (.lead (n + 3)) := 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: BitcoinSelfishMining.balance_lead
Let be a real number with and (both hypotheses are named and may be used in the proof), and let be any natural number . Then
Here is the custom family stationary on the states , whose values at the states are
with real division by zero equal to (so if every is and both sides of the equation are ; under the hypothesis the factor is non-zero). Writing and , the statement unfolds to the identity
for all and all . The indices , , mean that the equation is asserted only for the states with on the left-hand side (never for or ). Only at lead states appears; neither the transition function nor is involved.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.