Dyadic alphabet whole
ProvedErdosProblems.Erdos269.PaperCompleteR20.dyadic_alphabet_wholeerdos-269theorem
Every literal 2·3·5 forcing term is a positive integer, and each dyadic block base is one of 2, 6, 10, or 30. At index four the forcing is 65 and the base is 30, so a literal ordered digit exceeds its base somewhere.
Preamble
import Definitions.Def_ErdosProblems_Erdos269_BoundedRadixTailEscape import Definitions.Def_ErdosProblems_Erdos269_ResidueEscape import Definitions.Def_ErdosProblems_Erdos269_ThreePrimeRunningLcm import Definitions.Def_ErdosProblems_Erdos269_RestrictedFloorSum import Definitions.Def_ErdosProblems_Erdos269_DyadicBlockMassIdentity import Definitions.Def_ErdosProblems_Erdos269_DyadicBlockThresholdPartition import Definitions.Def_ErdosProblems_Erdos269_DyadicOrderedTailRecurrence import Definitions.Def_ErdosProblems_Erdos269_DyadicShellSummability import Definitions.Def_ErdosProblems_Erdos269_IntegralBranchExtinction import Definitions.Def_ErdosProblems_Erdos269_PaperR7ActualOrbit import Definitions.Def_ErdosProblems_Erdos269_PaperR9SourceCounts import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Sigma import Mathlib.Algebra.BigOperators.Group.List.Basic import Mathlib.Algebra.GCDMonoid.Finset import Mathlib.Algebra.Ring.Parity import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Log import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Prime.Int import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring namespace ErdosProblems.Erdos269.PaperCompleteR20 end ErdosProblems.Erdos269.PaperCompleteR20 namespace PaperR7 end PaperR7 namespace PaperR9 end PaperR9 /-! The full dyadic alphabet statement includes its non-positional warning. The printed scale-four example is checked by the Lean kernel after transport through the proved exact digit evaluator. -/ open PaperR7 PaperR9 open ErdosProblems.Erdos269.PaperCompleteR20 open ErdosProblems.Erdos269.PaperR7 open ErdosProblems.Erdos269.PaperR9
Formal statement
theorem ErdosProblems.Erdos269.PaperCompleteR20.dyadic_alphabet_whole :
(∀ a : ℕ,
(∃ m : ℕ, 0 < m ∧ literalForcing235 a = (m : ℚ)) ∧
(dyadicBlockBase235 a = 2 ∨ dyadicBlockBase235 a = 6 ∨
dyadicBlockBase235 a = 10 ∨ dyadicBlockBase235 a = 30)) ∧
literalForcing235 4 = 65 ∧ dyadicBlockBase235 4 = 30 ∧
(∃ a : ℕ, dyadicBlockBase235 a < dyadicOrderedBlockDigit235 a) := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperCompleteR20/DyadicAlphabetWhole.lean#L19-L30
Related paper by Will Cook (CC-BY-4.0): https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L1-L260
Paper prior-art bibliography: https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L681-L689