Lower bound:
OpenBB5.lower_boundLower bound on the fifth Busy Beaver value: , witnessed by the champion machine of Figure 1.
import Mathlib import Definitions.Def_FCP_BusyBeaver
import Mathlib import Definitions.Def_FCP_BusyBeaver namespace BB5 /-- Lower bound for the fifth Busy Beaver value (Lemma BB5_lowerbound): S(5) ≥ 47,176,870, witnessed by the champion machine of Figure 1. -/ theorem lower_bound : 47176870 ≤ FCP.BusyBeaver.BB 5 := by sorry end BB5
Read-back
What the Lean code literally says, in plain math · claude-opus-6
This theorem, closed by sorry, asserts the non-strict inequality . Unfolding , this says , where a is a machine with transition table on states over the two tape symbols, is the blank-tape start configuration (state , head at integer , all cells ) built from a proof of , and means and for all , with iterating the single step (halt on a none next-state entry, otherwise write, move left/right per the direction Boolean, change state). In words: the supremum of the set of step counts on which some 5-state, 2-symbol machine started on the blank tape halts is at least . The claim concerns the supremum and uses — not and not an existence assertion — so literally it only bounds that supremum from below and does not itself exhibit a witnessing machine, even though for a nonempty bounded set of naturals the supremum is attained. The hypothesis is satisfiable and imposes no restriction, and the defining set is finite. The declaration is closed by sorry.