Eight pow lt fifteen dyadic height
ProvedErdosProblems.Erdos269.PaperR7.eight_pow_lt_fifteen_dyadic_heighterdos-269theorem
At a dyadic endpoint, 8^a is strictly below 15 times the three-prime running height at 2^a.
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_JumpConstraintMajorant import Definitions.Def_ErdosProblems_Shared_IrrationalRotationStaircase import Definitions.Def_ErdosProblems_Erdos269_KernelCarryRank import Definitions.Def_ErdosProblems_Erdos269_PaperR7ActualOrbit import Definitions.Def_ErdosProblems_Erdos269_PaperR7SeriesIdentification import Definitions.Def_ErdosProblems_Erdos269_RationalLatticeReduction import Definitions.Def_ErdosProblems_Erdos269_RationalityCarryBridge import Definitions.Def_ErdosProblems_Erdos269_PaperR7RationalBridge import Definitions.Def_ErdosProblems_Erdos269_PaperR7WindowResults 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.Order.Floor.Semiring import Mathlib.Algebra.Ring.Parity import Mathlib.Analysis.SpecialFunctions.Log.Base import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Fintype.Pigeonhole import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Factorization.Basic import Mathlib.Data.Nat.Log import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Prime.Int import Mathlib.Data.Real.Archimedean import Mathlib.LinearAlgebra.Matrix.Block import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Mathlib.Topology.Algebra.InfiniteSum.Real /-! # Round 7: exact window statements at the correct bounds The short cap is `90 B (a+1)^2`. The long cap is `floor(B Q(n_a))`. They are separately named. No validity claim about the latter is inferred from the former. The bounded-length obstruction needs only growth of the long cap, so it can be proved without assuming the unresolved `X_a <= Q(n_a)` bridge. No admissions. -/ open scoped BigOperators open ErdosProblems.Erdos269.PaperR7
Formal statement
theorem ErdosProblems.Erdos269.PaperR7.eight_pow_lt_fifteen_dyadic_height (a : ℕ) :
(8 : ℝ) ^ a < 15 * (threePrimeHeight 2 3 5 (2 ^ a) : ℝ) := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperR7WindowResults.lean#L139-L157
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