Canonical dyadic host has finite prime-weighted cost
ProvedErdosProblems.Erdos257.PaperCompleteR8.summable_canonical_dyadic_hosterdos-257theorem
If each P(k) is a finite set of odd primes and its reciprocal-prime sum is at most 2^k+1, then the primeWeightedTerm at base two, restricted to the dyadic divisor host built from products of P(k), is summable.
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_Erdos249257_AllBaseReciprocalSupportIrrationality import Definitions.Def_ErdosProblems_Erdos257_CoverIndependentPeriodicMean import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR7_Displacement import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR7_AnalyticTargets import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR7_CoverKernel import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR8_DyadicDivisorFrames import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR8_PrimeHarmonicBlocks import Definitions.Def_ErdosProblems_Erdos257_PaperCompleteR8_DivisorFrameWeightedBudget import Mathlib import Mathlib.Algebra.BigOperators.Field 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.SumPrimeReciprocals 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 PaperCompleteR7 end PaperCompleteR7 /-! # Canonical finite-prime weights on the dyadic divisor host The valuation identity identifies the literal frame budget with the original finite-prime weighted criterion. A nonnegative finite-subcover argument then transports summability to the actual infinite union. -/ noncomputable section open Finset PaperCompleteR7 open ErdosProblems.Erdos257.PaperCompleteR8 open ErdosProblems.Erdos257.PaperCompleteR7
Formal statement
theorem ErdosProblems.Erdos257.PaperCompleteR8.summable_canonical_dyadic_host (P : ℕ → Finset ℕ)
(hP : ∀ k p, p ∈ P k → Nat.Prime p ∧ 2 < p)
(hS : ∀ k, (∑ p ∈ P k, (1 : ℝ) / p) ≤ (2 : ℝ) ^ k + 1) :
Summable (Set.indicator (dyadicDivisorHost (fun k => (P k).prod id))
(primeWeightedTerm 2 {2})) := by sorry
end
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos257/PaperCompleteR8/DivisorFrameHostTransport.lean#L83-L107
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