Normalized geometric prefix bound
ProvedErdosProblems.Erdos257.PaperCompleteR8.normalised_geom_prefix_leerdos-257theorem
For B≥1 and n≤d, d times the first n terms of the geometric sum in B is at most n times the first d terms.
Preamble
import Definitions.Def_Erdos249257_TotientTailPeriodKiller import Definitions.Def_Erdos249257_CarrySurvivorExtinction import Definitions.Def_Erdos249257_LcmConeFlatness import Definitions.Def_Erdos249257_LcmConeNonflat import Definitions.Def_Erdos249257_SternBrocotRunGeometry import Definitions.Def_Erdos249257_CertificateKernel import Definitions.Def_Erdos249257_GenericTailOrbitRigidity import Definitions.Def_Erdos249257_GreedyAchievementSet import Definitions.Def_Erdos249257_RationalSupportCarrySkeleton import Definitions.Def_Erdos249257_ReciprocalSupportIrrationality import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR7_CoverKernel import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR8_FiniteMeans import Mathlib import Mathlib.Algebra.BigOperators.Field import Mathlib.Algebra.BigOperators.Intervals import Mathlib.Algebra.GCDMonoid.Finset import Mathlib.Algebra.Order.Antidiag.Prod import Mathlib.Algebra.Order.Ring.Pow import Mathlib.Algebra.Ring.GeomSum import Mathlib.Analysis.Asymptotics.SpecificAsymptotics import Mathlib.Analysis.Convex.SpecificFunctions.Basic import Mathlib.Analysis.MeanInequalitiesPow import Mathlib.Analysis.Normed.Group.FunctionSeries import Mathlib.Analysis.Normed.Group.Tannery import Mathlib.Analysis.Normed.Ring.InfiniteSum import Mathlib.Analysis.RCLike.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Finset.NatAntidiagonal import Mathlib.Data.Nat.Choose.Dvd import Mathlib.Data.Nat.Factorization.Basic import Mathlib.Data.Nat.Fib.Basic import Mathlib.Data.Nat.Find import Mathlib.Data.Nat.ModEq import Mathlib.Data.Nat.Totient import Mathlib.Data.ZMod.Basic import Mathlib.FieldTheory.Finite.Basic import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.MeasureTheory.Group.Measure import Mathlib.MeasureTheory.Measure.Lebesgue.Basic import Mathlib.MeasureTheory.Measure.MeasureSpace import Mathlib.NumberTheory.ArithmeticFunction.Misc import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.NumberTheory.Bertrand import Mathlib.NumberTheory.Multiplicity import Mathlib.NumberTheory.Real.Irrational import Mathlib.NumberTheory.TsumDivisorsAntidiagonal import Mathlib.Order.Filter.AtTopBot.Basic import Mathlib.RingTheory.Polynomial.Cyclotomic.Eval import Mathlib.RingTheory.Polynomial.Cyclotomic.Expand import Mathlib.RingTheory.Polynomial.Cyclotomic.Roots import Mathlib.Tactic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.GCongr import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Set import Mathlib.Topology.Algebra.InfiniteSum.NatInt import Mathlib.Topology.Algebra.InfiniteSum.Order import Mathlib.Topology.Algebra.InfiniteSum.Ring import Mathlib.Topology.GDelta.Basic import Mathlib.Topology.Order.IntermediateValue import Mathlib.Topology.Perfect namespace Erdos257PeriodNoncollapse end Erdos257PeriodNoncollapse namespace ErdosProblems.Erdos257.DyadicShellSynchronisation end ErdosProblems.Erdos257.DyadicShellSynchronisation /-! # The finite estimate (S) All three regimes refer to the actual modular atom, not abstract error terms. The complete-orbit argument is in OrbitBound. The dyadic reciprocal-tail bound is reused from the compiled WeightedSupportAveraging module. This file proves no-wrap and transition bounds and then assembles the uniform finite estimate. NOT COMPILED in this return. -/ noncomputable section open Finset open ErdosProblems.Erdos257 open ErdosProblems.Erdos257.PaperCompleteR7 open ErdosProblems.Erdos257.DyadicShellSynchronisation open ErdosProblems.Erdos257.PaperCompleteR8
Formal statement
theorem ErdosProblems.Erdos257.PaperCompleteR8.normalised_geom_prefix_le {B : ℝ} (hB : 1 ≤ B)
(n d : ℕ) (hnd : n ≤ d) :
(d : ℝ) * (∑ i ∈ Finset.range n, B ^ i) ≤
(n : ℝ) * (∑ i ∈ Finset.range d, B ^ i) := by sorry
end
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos257/PaperCompleteR8/DyadicKernel.lean#L21-L55
Related paper by Will Cook (CC-BY-4.0): https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/257/erdos-257-mersenne-support-subseries.tex#L1-L75
Paper's authorship and AI-use disclosure: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/paper-house-style.sty#L180-L188
Erdős's earlier reciprocal-summable criterion is credited in the paper: https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/257/erdos-257-mersenne-support-subseries.tex#L104-L110