Weighted support and positive-cover predicates
DefinitionErdosProblems_Erdos257_PaperCompleteR7_AnalyticTargetsdefinitionerdos-257
Defines the prime-power part, the weighted term, FinitePrimeWeighted, positive divisor-cover data and its strengthened cost, and DivisibilityWeightedClaim. These are hypotheses and goal propositions, not proofs by themselves.
Definition code
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_PaperCompleteR7_Displacement
import Mathlib.Algebra.BigOperators.Field
import Mathlib.Algebra.GCDMonoid.Finset
import Mathlib.Algebra.Order.Antidiag.Prod
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Analysis.Asymptotics.SpecificAsymptotics
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.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.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
noncomputable section
namespace ErdosProblems.Erdos257.PaperCompleteR7
open Erdos257PeriodNoncollapse
/-- The full prime-power part determined by a finite set of primes. -/
def primeSetPart (P : Finset ℕ) (a : ℕ) : ℕ :=
∏ p ∈ P, p ^ a.factorization p
/-- The literal weighted term at an integer base. -/
def primeWeightedTerm (b : ℕ) (P : Finset ℕ) (a : ℕ) : ℝ :=
(primeSetPart P a : ℝ) /
((a : ℝ) * ((b : ℝ) ^ primeSetPart P a - 1))
/-- The weighted hypothesis, not its irrationality conclusion. -/
def FinitePrimeWeighted (b : ℕ) (A : Set ℕ) : Prop :=
∃ P : Finset ℕ, P.Nonempty ∧ (∀ p ∈ P, Nat.Prime p) ∧
Summable (Set.indicator A (primeWeightedTerm b P))
/-- Input data for the actual positive divisor-cover method. -/
structure PositiveCoverData where
frame : ℕ → Finset ℕ
exponent : ℕ → ℝ
coefficient : ℕ → ℕ → ℝ
frame_positive : ∀ j, 0 ∉ frame j
exponent_bounds : ∀ j, 0 < exponent j ∧ exponent j ≤ 1
coefficient_nonneg : ∀ j d, 0 < d → 0 ≤ coefficient j d
column_summable : ∀ j, Summable (fun d : ℕ => coefficient j d / (d : ℝ))
majorises : ∀ j n, 0 < n →
(((frame j).filter (fun a => a ∣ n)).card : ℝ) ^ exponent j ≤
∑ d ∈ n.divisors, coefficient j d
def PositiveCoverData.cost (C : PositiveCoverData) (j : ℕ) : ℝ :=
∑' d : ℕ, C.coefficient j d / (d : ℝ)
def PositiveCoverData.host (C : PositiveCoverData) : Set ℕ :=
{a | ∃ j, a ∈ C.frame j}
/-- Exactly the one-inverse-power cost in short (V), after reindexing. -/
def PositiveCoverData.StrengthenedCostSummable (C : PositiveCoverData) : Prop :=
Summable (fun j : ℕ =>
C.cost j * (2 : ℝ) ^ (((j + 1 : ℕ) : ℝ) * C.exponent j) /
((2 : ℝ) ^ C.exponent j - 1))
def HasStrengthenedPositiveCover (A : Set ℕ) : Prop :=
∃ C : PositiveCoverData, A ⊆ C.host ∧ C.StrengthenedCostSummable
/-- Open Lean goal for long thm:257-weighted, including the all-base
hereditary consequence of a finite binary weighted mass. -/
def DivisibilityWeightedClaim : Prop :=
(∀ (b : ℕ) (A : Set ℕ), 2 ≤ b → 0 ∉ A → A.Infinite →
FinitePrimeWeighted b A → Irrational (Erdos249257.erdosSupportSeries b A)) ∧
(∀ H : Set ℕ, 0 ∉ H → FinitePrimeWeighted 2 H →
∀ A : Set ℕ, A ⊆ H → A.Infinite →
∀ b : ℕ, 2 ≤ b → Irrational (Erdos249257.erdosSupportSeries b A))
end ErdosProblems.Erdos257.PaperCompleteR7
end
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos257/PaperCompleteR7/AnalyticTargets.lean#L1-L89
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
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.