Mem strictSmoothPairs iff
ProvedErdosProblems.Erdos269.PaperR9.mem_strictSmoothPairs_ifferdos-269theorem
For q,r>1, membership in the strict smooth pair set is exactly q^j r^k<x; the explicit exponent bounds impose no extra restriction.
Preamble
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_PaperR9SourceCounts 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.Ring.Parity import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Log import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Prime.Int import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring /-! # Exact source-count normalisation for certificate reconstruction This module does not certify a generated list by fiat. It starts with the library's actual strictSmoothPairs / strictSmoothExponents and proves the one-dimensional pair count, cumulative pure-power count, threshold difference, and complete ordered dyadic digit formula. The executable pair evaluator uses successive division. It does not enumerate a box of side `x` or compute real logarithms. Its boundary sweep is linear in the two exponent bounds. No unproved logarithmic-interval or Euclidean floor-sum optimisation is used by this return. Source APIs reused: RestrictedFloorSum.lean, strictSmoothShell_card, restrictedPurePowerCount_eq_restrictedLogFloorSum, restrictedLogFloorSum_succ_sub; Mathlib/Data/Nat/Log.lean; Lean src/Init/Data/Nat/Div/Basic.lean. Finset.card_eq_sum_card_fiberwise is reused exactly as in the supplied RestrictedFloorSum.lean:332. -/ open Finset open ErdosProblems.Erdos269.PaperR9
Formal statement
theorem ErdosProblems.Erdos269.PaperR9.mem_strictSmoothPairs_iff {q r x : ℕ} (hq : 1 < q) (hr : 1 < r)
(e : ℕ × ℕ) :
e ∈ strictSmoothPairs q r x ↔ q ^ e.1 * r ^ e.2 < x := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperR9SourceCounts.lean#L27-L41
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