Literal triangle whole
ProvedErdosProblems.Erdos269.PaperCompleteR20.literal_triangle_wholeerdos-269theorem
Each literal dyadic ordered digit is a finite sum over the triangle of exponent pairs, with each summand equal to 1, 3, 5, or 15. Rectangle bounds imply explicit quadratic lower and upper bounds for the digits and hence unboundedness.
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_PaperCompleteR20_LiteralTriangle import Definitions.Def_ErdosProblems_Erdos269_PaperCompleteR20_LiteralTriangleReal 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.Order.Floor.Ring import Mathlib.Algebra.Ring.Parity import Mathlib.Analysis.SpecialFunctions.Log.Base 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 /-! Exact logarithmic coordinates and the paper's rectangle lower bound. -/ open scoped BigOperators open ErdosProblems.Erdos269.PaperCompleteR20
Formal statement
theorem ErdosProblems.Erdos269.PaperCompleteR20.literal_triangle_whole :
(∀ a, dyadicOrderedBlockDigit235 a = ∑ v ∈ literalTriangle a, literalLogWeight a v) ∧
(∀ a v, v ∈ literalTriangle a →
literalLogWeight a v = 1 ∨ literalLogWeight a v = 3 ∨
literalLogWeight a v = 5 ∨ literalLogWeight a v = 15) ∧
(∀ a, triangleRectangleSide a 3 * triangleRectangleSide a 5 ≤ dyadicOrderedBlockDigit235 a) ∧
(∀ a : ℕ, (a + 1 : ℝ) ^ 2 / triangleQuadraticDenominator ≤ dyadicOrderedBlockDigit235 a ∧
(dyadicOrderedBlockDigit235 a : ℝ) ≤ 15 * (a + 1 : ℝ) ^ 2) ∧
(∀ M : ℝ, ∃ a : ℕ, M < dyadicOrderedBlockDigit235 a) := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperCompleteR20/LiteralTriangleReal.lean#L191-L206
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