RealPrefixLcm jump first
ProvedErdosProblems.Erdos269.PaperCompleteR20.realPrefixLcm_jump_firsterdos-269theorem
For three pairwise distinct primes and cutoffs x,y≥1, if only the p floor-log exponent increases by one, the running prefix LCM at y is p times the one at x.
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_Shared_IrrationalRotationStaircase import Definitions.Def_ErdosProblems_Erdos269_KernelCarryRank import Definitions.Def_ErdosProblems_Erdos269_RealCutoffR10 import Definitions.Def_ErdosProblems_Erdos269_PaperCompleteR20_RealCutoffs 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.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Fintype.Pigeonhole import Mathlib.Data.Int.ModEq 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 namespace PaperR10 end PaperR10 /-! # Literal real cutoffs for the Erdős 269 paper The paper quantifies its prefix cutoffs and shell endpoints over the reals. This module transports the existing natural-cutoff arithmetic through `Nat.floor` and proves the short-shell injection directly for real endpoints. -/ open Finset open scoped BigOperators noncomputable section open PaperR10 open ErdosProblems.Erdos269.PaperCompleteR20 open ErdosProblems.Erdos269.PaperR10
Formal statement
theorem ErdosProblems.Erdos269.PaperCompleteR20.realPrefixLcm_jump_first
{p q r : ℕ} (pPrime : p.Prime) (qPrime : q.Prime) (rPrime : r.Prime)
(hpq : p ≠ q) (hpr : p ≠ r) (hqr : q ≠ r)
{x y : ℝ} (hx : 1 ≤ x) (hy : 1 ≤ y)
(hp : ⌊Real.logb p y⌋₊ = ⌊Real.logb p x⌋₊ + 1)
(hq : ⌊Real.logb q y⌋₊ = ⌊Real.logb q x⌋₊)
(hr : ⌊Real.logb r y⌋₊ = ⌊Real.logb r x⌋₊) :
realPrefixLcm p q r y = p * realPrefixLcm p q r x := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperCompleteR20/RealCutoffs.lean#L86-L97
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