number-theory / Analytic number theory; digit distribution of constants
Determine whether every finite binary word occurs infinitely often in the binary expansion of the Erdős–Borwein constant .
Temporal state
No reconciled state yet.
Acceptance criteria: Keep the result conditional on AGP and PrimeIntervalSupply, and keep the paper's quantitative occurrence bound separate from the qualitative Lean endpoint.
Append-only history
VibeMathed recorded: Conditional binary disjunctivity of the Erdős–Borwein constant reported. Consult the linked registry entry for the original report and scope.
Research memory
Under the explicit hypotheses AGP and PrimeIntervalSupply defined in the pinned Lean source, the formal development derives that every finite binary word occurs arbitrarily late, hence infinitely often, in the binary expansion of the Erdős–Borwein constant ; the accompanying paper reports this as 2-density.
AGP and PrimeIntervalSupply are explicit theorem arguments, not formalized in this package. The source treats them as published mathematical inputs. MFN did not independently check those inputs, the paper's argument, or the Lean build.
Evidence graph
parent of · event · claim reported