Theorem 1.1:
OpenBB5.S5_valueThe fifth Busy Beaver value: the maximum number of steps a 5-state, 2-symbol Turing machine can perform from the all-zero tape before halting is exactly .
import Mathlib import Definitions.Def_FCP_BusyBeaver
import Mathlib import Definitions.Def_FCP_BusyBeaver namespace BB5 /-- Theorem 1.1 of arXiv:2509.12337 (bbchallenge Collaboration et al., "Determination of the fifth Busy Beaver value"): S(5) = 47,176,870. Here `FCP.BusyBeaver.BB` is the maximum-shifts busy beaver function, i.e. the maximum number of transitions an `n`-state, 2-symbol Turing machine performs from the all-zero tape before halting. -/ theorem S5_value : FCP.BusyBeaver.BB 5 = 47176870 := by sorry end BB5
Read-back
What the Lean code literally says, in plain math · claude-opus-6
This theorem, whose proof script is sorry, asserts the equality , where is the bundle's maximum-shifts busy-beaver function. Unfolding it, is the supremum, taken in , of the set . A machine has a transition table on states and the two tape symbols; is the starting configuration in state , head at integer tape position , every tape cell (blank) — the hypothesis is exactly the proof needed to form state index ; and states that the run from is halted after exactly transitions, i.e. and for all , where and applies one more single step whenever the machine has not halted (a step reads the state and symbol under the head, halting when the next-state field is none, otherwise writing a symbol, shifting the head one cell right or left per the direction Boolean, and entering the next state). Thus the theorem literally says: the supremum of all halting-step counts of 5-state, 2-symbol machines started on the blank tape equals . Since holds, the existential hypothesis imposes no real restriction. Edge cases: for the set is empty (no proof of ), so ; the supremum on is a genuine maximum only when the set is nonempty and bounded — for fixed the machine type is finite and each machine halts at most once, so the set is finite, though the definition does not itself prove this. Finally the declaration is closed by sorry, so it posits the equality without supplying a proof term.