/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import Mathlib.Analysis.SpecificLimits.Normed
public import Mathlib.NumberTheory.ArithmeticFunction.Misc
public import Mathlib.Topology.Algebra.InfiniteSum.Real
public import Mathlib.Tactic.FieldSimp
public import Mathlib.Tactic.Linarith
public import Mathlib.Tactic.NormNum
public import Mathlib.Tactic.PositivityPrime-divisor generating series
The generating series of the number of distinct prime divisors, evaluated at one half, can be rearranged into a sum over primes using absolute summability.
@[expose] public sectionopen scoped ArithmeticFunction.omeganamespace ArithmeticFunction
The number of distinct prime factors is the cardinality of Nat.primeFactors.
All goals completed! 🐙
The term primeDivTerm m p is (1 / 2) ^ m when p is a prime dividing the positive
integer m, and 0 otherwise.
private noncomputable def primeDivTerm (m p : ℕ) : ℝ :=
if p.Prime ∧ p ∣ m ∧ m ≠ 0 then (1 / 2 : ℝ) ^ m else 0
Summing primeDivTerm m p over the primes p gives ω m / 2 ^ m.
private lemma tsum_primeDivTerm_right (m : ℕ) : ∑' p, primeDivTerm m p = (ω m : ℝ) / 2 ^ m := by m:ℕ⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
rcases eq_or_ne m 0 with rfl | hm inl ⊢ ∑' (p : ℕ), primeDivTerm 0 p = ↑(ω 0) / 2 ^ 0inr m:ℕhm:m ≠ 0⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
· inl ⊢ ∑' (p : ℕ), primeDivTerm 0 p = ↑(ω 0) / 2 ^ 0 simp [primeDivTerm] All goals completed! 🐙
have hsupp : Function.support (primeDivTerm m) ⊆ ↑m.primeFactors := by
intro p hp m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)⊢ p ∈ ↑m.primeFactors inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
by_contra h m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)h:p ∉ ↑m.primeFactors⊢ False inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
apply hp m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)h:p ∉ ↑m.primeFactors⊢ primeDivTerm m p = 0inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
have : ¬ (p.Prime ∧ p ∣ m) := fun ⟨h1, h2⟩ =>
h (Finset.mem_coe.mpr (Nat.mem_primeFactors.mpr ⟨h1, h2, hm⟩)) m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)h:p ∉ ↑m.primeFactorsthis:¬(Nat.Prime p ∧ p ∣ m)⊢ primeDivTerm m p = 0inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
unfold primeDivTerm m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)h:p ∉ ↑m.primeFactorsthis:¬(Nat.Prime p ∧ p ∣ m)⊢ (if Nat.Prime p ∧ p ∣ m ∧ m ≠ 0 then (1 / 2) ^ m else 0) = 0inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
rw [if_neg (fun ⟨h1, h2, _⟩ => this ⟨h1, h2⟩) m:ℕhm:m ≠ 0p:ℕhp:p ∈ Function.support (primeDivTerm m)h:p ∉ ↑m.primeFactorsthis:¬(Nat.Prime p ∧ p ∣ m)⊢ 0 = 0inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m]inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m
rw [tsum_eq_sum (s := m.primeFactors) (fun p hp => by m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsp:ℕhp:p ∉ m.primeFactors⊢ primeDivTerm m p = 0 inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
by_contra h m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsp:ℕhp:p ∉ m.primeFactorsh:¬primeDivTerm m p = 0⊢ Falseinr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
exact hp (hsupp (by m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsp:ℕhp:p ∉ m.primeFactorsh:¬primeDivTerm m p = 0⊢ p ∈ Function.support (primeDivTerm m)inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m simpa using h All goals completed! 🐙inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m)))]inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactors⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
have : ∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2 : ℝ) ^ m := by m:ℕ⊢ ∑' (p : ℕ), primeDivTerm m p = ↑(ω m) / 2 ^ m inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
intro p hp m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsp:ℕhp:p ∈ m.primeFactors⊢ primeDivTerm m p = (1 / 2) ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
obtain ⟨h1, h2, -⟩ := Nat.mem_primeFactors.mp hp m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsp:ℕhp:p ∈ m.primeFactorsh1:Nat.Prime ph2:p ∣ m⊢ primeDivTerm m p = (1 / 2) ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
simp [primeDivTerm, h1, h2, hm]inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ b ∈ m.primeFactors, primeDivTerm m b = ↑(ω m) / 2 ^ m
rw [Finset.sum_congr rfl this, inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ∑ x ∈ m.primeFactors, (1 / 2) ^ m = ↑(ω m) / 2 ^ m inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ m Finset.sum_const, inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ m.primeFactors.card • (1 / 2) ^ m = ↑(ω m) / 2 ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ m nsmul_eq_mul, inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑(ω m) / 2 ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ m
cardDistinctFactors_eq_card_primeFactors inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ minr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ m]inr m:ℕhm:m ≠ 0hsupp:Function.support (primeDivTerm m) ⊆ ↑m.primeFactorsthis:∀ p ∈ m.primeFactors, primeDivTerm m p = (1 / 2) ^ m⊢ ↑m.primeFactors.card * (1 / 2) ^ m = ↑m.primeFactors.card / 2 ^ m
simp [div_eq_mul_inv] All goals completed! 🐙
Summing primeDivTerm m p over m for a prime p gives 1 / (2 ^ p - 1).
private lemma tsum_primeDivTerm_left {p : ℕ} (hp : p.Prime) :
∑' m, primeDivTerm m p = 1 / (2 ^ p - 1 : ℝ) := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
have hinj : Function.Injective (fun k : ℕ => p * (k + 1)) := by
intro a b h p:ℕhp:Nat.Prime pa:ℕb:ℕh:(fun k ↦ p * (k + 1)) a = (fun k ↦ p * (k + 1)) b⊢ a = b p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
have := Nat.eq_of_mul_eq_mul_left hp.pos h p:ℕhp:Nat.Prime pa:ℕb:ℕh:(fun k ↦ p * (k + 1)) a = (fun k ↦ p * (k + 1)) bthis:a + 1 = b + 1⊢ a = b p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
omega p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
have hsupp : Function.support (fun m => primeDivTerm m p) ⊆
Set.range (fun k : ℕ => p * (k + 1)) := by
intro m hm p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m p⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
have h : p.Prime ∧ p ∣ m ∧ m ≠ 0 := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:Nat.Prime p ∧ p ∣ m ∧ m ≠ 0⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
by_contra h p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ False p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:Nat.Prime p ∧ p ∣ m ∧ m ≠ 0⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
exact hm (by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun m ↦ primeDivTerm m p) m = 0 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:Nat.Prime p ∧ p ∣ m ∧ m ≠ 0⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) simp [primeDivTerm, h] All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:Nat.Prime p ∧ p ∣ m ∧ m ≠ 0⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)m:ℕhm:m ∈ Function.support fun m ↦ primeDivTerm m ph:Nat.Prime p ∧ p ∣ m ∧ m ≠ 0⊢ m ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
obtain ⟨-, ⟨c, rfl⟩, hm0⟩ := h p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0⊢ p * c ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
have hc : c ≠ 0 := fun h => hm0 (by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0h:c = 0⊢ p * c = 0 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0hc:c ≠ 0⊢ p * c ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) simp [h] All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0hc:c ≠ 0⊢ p * c ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0hc:c ≠ 0⊢ p * c ∈ Set.range fun k ↦ p * (k + 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
exact ⟨c - 1, by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)c:ℕhm:p * c ∈ Function.support fun m ↦ primeDivTerm m phm0:p * c ≠ 0hc:c ≠ 0⊢ (fun k ↦ p * (k + 1)) (c - 1) = p * c p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) simp [Nat.sub_add_cancel (Nat.pos_of_ne_zero hc)] All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)⟩ p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1)
rw [← hinj.tsum_eq hsupp p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)] p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
have hr0 : (0 : ℝ) ≤ (1 / 2) ^ p := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ p⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) positivity p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ p⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ p⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
have hr1 : ((1 : ℝ) / 2) ^ p < 1 := pow_lt_one₀ (by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ p⊢ 0 ≤ 1 / 2 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) norm_num All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)) (by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ p⊢ 1 / 2 < 1 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) norm_num All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)) hp.ne_zero p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
have : ∀ k : ℕ,
primeDivTerm (p * (k + 1)) p = (1 / 2 : ℝ) ^ p * ((1 / 2 : ℝ) ^ p) ^ k := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
intro k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕ⊢ primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
have h : p.Prime ∧ p ∣ p * (k + 1) ∧ p * (k + 1) ≠ 0 :=
⟨hp, dvd_mul_right _ _, by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕ⊢ p * (k + 1) ≠ 0 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕh:Nat.Prime p ∧ p ∣ p * (k + 1) ∧ p * (k + 1) ≠ 0⊢ primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) have := hp.pos p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕthis:0 < p⊢ p * (k + 1) ≠ 0 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕh:Nat.Prime p ∧ p ∣ p * (k + 1) ∧ p * (k + 1) ≠ 0⊢ primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1); positivity All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕh:Nat.Prime p ∧ p ∣ p * (k + 1) ∧ p * (k + 1) ≠ 0⊢ primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)⟩ p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1k:ℕh:Nat.Prime p ∧ p ∣ p * (k + 1) ∧ p * (k + 1) ≠ 0⊢ primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
simp [primeDivTerm, h, pow_mul, pow_succ, mul_comm] p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (c : ℕ), primeDivTerm (p * (c + 1)) p = 1 / (2 ^ p - 1)
rw [tsum_congr this, p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ ∑' (b : ℕ), (1 / 2) ^ p * ((1 / 2) ^ p) ^ b = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1) tsum_mul_left, p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * ∑' (x : ℕ), ((1 / 2) ^ p) ^ x = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1) tsum_geometric_of_lt_one hr0 hr1 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1)] p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1)
have h2 : (1 : ℝ) < 2 ^ p := one_lt_pow₀ (by p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ k⊢ 1 < 2 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1) norm_num All goals completed! 🐙 p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1)) hp.ne_zero p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (1 / 2) ^ p * (1 - (1 / 2) ^ p)⁻¹ = 1 / (2 ^ p - 1)
rw [one_div, p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ 2⁻¹ ^ p * (1 - 2⁻¹ ^ p)⁻¹ = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) inv_pow p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1)] p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ p⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1)
have : (2 : ℝ) ^ p - 1 ≠ 0 := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) linarith p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1)
have h3 : (2 : ℝ) ^ p ≠ 0 := by p:ℕhp:Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0h3:2 ^ p ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) positivity p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0h3:2 ^ p ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1) p:ℕhp:Nat.Prime phinj:Function.Injective fun k ↦ p * (k + 1)hsupp:(Function.support fun m ↦ primeDivTerm m p) ⊆ Set.range fun k ↦ p * (k + 1)hr0:0 ≤ (1 / 2) ^ phr1:(1 / 2) ^ p < 1this✝:∀ (k : ℕ), primeDivTerm (p * (k + 1)) p = (1 / 2) ^ p * ((1 / 2) ^ p) ^ kh2:1 < 2 ^ pthis:2 ^ p - 1 ≠ 0h3:2 ^ p ≠ 0⊢ (2 ^ p)⁻¹ * (1 - (2 ^ p)⁻¹)⁻¹ = 1 / (2 ^ p - 1)
field_simp All goals completed! 🐙
The double series defining primeDivTerm is summable.
private lemma summable_primeDivTerm : Summable (fun x : ℕ × ℕ => primeDivTerm x.1 x.2) := by ⊢ Summable fun x ↦ primeDivTerm x.1 x.2
have hnn : 0 ≤ (fun x : ℕ × ℕ => primeDivTerm x.1 x.2) := fun x => by x:ℕ × ℕ⊢ 0 x ≤ (fun x ↦ primeDivTerm x.1 x.2) x hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2
simp only [Pi.zero_apply] x:ℕ × ℕ⊢ 0 ≤ primeDivTerm x.1 x.2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2
unfold primeDivTerm x:ℕ × ℕ⊢ 0 ≤ if Nat.Prime x.2 ∧ x.2 ∣ x.1 ∧ x.1 ≠ 0 then (1 / 2) ^ x.1 else 0 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2
split_ifs pos x:ℕ × ℕh✝:Nat.Prime x.2 ∧ x.2 ∣ x.1 ∧ x.1 ≠ 0⊢ 0 ≤ (1 / 2) ^ x.1neg x:ℕ × ℕh✝:¬(Nat.Prime x.2 ∧ x.2 ∣ x.1 ∧ x.1 ≠ 0)⊢ 0 ≤ 0 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2 <;> pos x:ℕ × ℕh✝:Nat.Prime x.2 ∧ x.2 ∣ x.1 ∧ x.1 ≠ 0⊢ 0 ≤ (1 / 2) ^ x.1neg x:ℕ × ℕh✝:¬(Nat.Prime x.2 ∧ x.2 ∣ x.1 ∧ x.1 ≠ 0)⊢ 0 ≤ 0 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2 positivity hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ primeDivTerm x.1 x.2
rw [summable_prod_of_nonneg hnn hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ (∀ (x : ℕ), Summable fun y ↦ primeDivTerm (x, y).1 (x, y).2) ∧
Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ (∀ (x : ℕ), Summable fun y ↦ primeDivTerm (x, y).1 (x, y).2) ∧
Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2] hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ (∀ (x : ℕ), Summable fun y ↦ primeDivTerm (x, y).1 (x, y).2) ∧
Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2
refine ⟨fun m => ?_, ?_⟩ refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕ⊢ Summable fun y ↦ primeDivTerm (m, y).1 (m, y).2refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2
· refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕ⊢ Summable fun y ↦ primeDivTerm (m, y).1 (m, y).2 apply summable_of_hasFiniteSupport refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕ⊢ Function.HasFiniteSupport fun y ↦ primeDivTerm (m, y).1 (m, y).2
refine (Finset.range (m + 1)).finite_toSet.subset ?_ refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕ⊢ (Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2) ⊆ ↑(Finset.range (m + 1))
intro p hp refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2⊢ p ∈ ↑(Finset.range (m + 1))
by_contra h refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))⊢ False
apply hp refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0
have : ¬ (p.Prime ∧ p ∣ m ∧ m ≠ 0) := by ⊢ Summable fun x ↦ primeDivTerm x.1 x.2 refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))this:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0
rintro ⟨-, h2, h3⟩ hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))h2:p ∣ mh3:m ≠ 0⊢ Falserefine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))this:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0
exact h (by hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))h2:p ∣ mh3:m ≠ 0⊢ p ∈ ↑(Finset.range (m + 1))refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))this:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0 simpa [Nat.lt_succ_iff] using Nat.le_of_dvd (Nat.pos_of_ne_zero h3) h2 All goals completed! 🐙refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))this:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0)refine_1 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2m:ℕp:ℕhp:p ∈ Function.support fun y ↦ primeDivTerm (m, y).1 (m, y).2h:p ∉ ↑(Finset.range (m + 1))this:¬(Nat.Prime p ∧ p ∣ m ∧ m ≠ 0)⊢ (fun y ↦ primeDivTerm (m, y).1 (m, y).2) p = 0
simp [primeDivTerm, this] All goals completed! 🐙
· refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2 have hs : Summable (fun m : ℕ => (m : ℝ) ^ 1 * (1 / 2 : ℝ) ^ m) :=
summable_pow_mul_geometric_of_norm_lt_one 1 (by hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2⊢ ‖1 / 2‖ < 1 refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ m⊢ Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2 norm_num All goals completed! 🐙refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ m⊢ Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2)refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ m⊢ Summable fun x ↦ ∑' (y : ℕ), primeDivTerm (x, y).1 (x, y).2
refine Summable.of_nonneg_of_le (fun m => tsum_nonneg (fun p => hnn (m, p))) (fun m => ?_) hs refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ∑' (y : ℕ), primeDivTerm (m, y).1 (m, y).2 ≤ ↑m ^ 1 * (1 / 2) ^ m
simp only refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ∑' (y : ℕ), primeDivTerm m y ≤ ↑m ^ 1 * (1 / 2) ^ m
rw [tsum_primeDivTerm_right, refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) / 2 ^ m ≤ ↑m ^ 1 * (1 / 2) ^ m refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹ one_div, refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) / 2 ^ m ≤ ↑m ^ 1 * 2⁻¹ ^ mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹ inv_pow, refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) / 2 ^ m ≤ ↑m ^ 1 * (2 ^ m)⁻¹refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹ pow_one, refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) / 2 ^ m ≤ ↑m * (2 ^ m)⁻¹refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹ div_eq_mul_inv refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹]refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
have : (ω m : ℝ) ≤ m := by ⊢ Summable fun x ↦ primeDivTerm x.1 x.2 refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
rw [cardDistinctFactors_eq_card_primeFactors hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑m.primeFactors.card ≤ ↑m hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹] hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕ⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
have hsub : m.primeFactors ⊆ Finset.Icc 1 m := by ⊢ Summable fun x ↦ primeDivTerm x.1 x.2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
intro p hp hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕp:ℕhp:p ∈ m.primeFactors⊢ p ∈ Finset.Icc 1 m hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
obtain ⟨h1, h2, h3⟩ := Nat.mem_primeFactors.mp hp hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕp:ℕhp:p ∈ m.primeFactorsh1:Nat.Prime ph2:p ∣ mh3:m ≠ 0⊢ p ∈ Finset.Icc 1 m hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
exact Finset.mem_Icc.mpr ⟨h1.pos, Nat.le_of_dvd (Nat.pos_of_ne_zero h3) h2⟩ hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹ hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
have := Finset.card_le_card hsub hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 mthis:m.primeFactors.card ≤ (Finset.Icc 1 m).card⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
simp only [Nat.card_Icc, Nat.add_sub_cancel] at this hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕhsub:m.primeFactors ⊆ Finset.Icc 1 mthis:m.primeFactors.card ≤ m⊢ ↑m.primeFactors.card ≤ ↑mrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
exact_mod_cast thisrefine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹refine_2 hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ ↑(ω m) * (2 ^ m)⁻¹ ≤ ↑m * (2 ^ m)⁻¹
exact mul_le_mul_of_nonneg_right this (by hnn:0 ≤ fun x ↦ primeDivTerm x.1 x.2hs:Summable fun m ↦ ↑m ^ 1 * (1 / 2) ^ mm:ℕthis:↑(ω m) ≤ ↑m⊢ 0 ≤ (2 ^ m)⁻¹ positivity All goals completed! 🐙)The generating series for the number of distinct prime divisors converges at one half.
lemma summable_cardDistinctFactors_div_two_pow :
Summable (fun n : ℕ => (ω n : ℝ) / 2 ^ n) :=
summable_primeDivTerm.prod.congr (fun n => tsum_primeDivTerm_right n)The generating series for the number of distinct prime divisors, evaluated at one half, is a sum over primes of reciprocals of Mersenne numbers.
lemma tsum_cardDistinctFactors_div_two_pow :
∑' n : ℕ, (ω n : ℝ) / 2 ^ n = ∑' p : {n : ℕ | n.Prime}, 1 / (2 ^ p.1 - 1) := by ⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
let A := { n : ℕ | n.Prime } A:Set ℕ := {n | Nat.Prime n}⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
have h2 : ∑' m : ℕ, (ω m : ℝ) / 2 ^ m = ∑' m, ∑' p, primeDivTerm m p :=
tsum_congr fun m => (tsum_primeDivTerm_right m).symm A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
have h3 : ∑' m, ∑' p, primeDivTerm m p = ∑' p, ∑' m, primeDivTerm m p :=
(Summable.tsum_comm (f := primeDivTerm) summable_primeDivTerm).symm A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
have h4 : ∑' p, ∑' m, primeDivTerm m p =
∑' p, A.indicator (fun p : ℕ => 1 / (2 ^ p - 1 : ℝ)) p := by
refine tsum_congr fun p => ?_ A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕ⊢ ∑' (m : ℕ), primeDivTerm m p = A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
by_cases hp : p ∈ A pos A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∈ A⊢ ∑' (m : ℕ), primeDivTerm m p = A.indicator (fun p ↦ 1 / (2 ^ p - 1)) pneg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ A⊢ ∑' (m : ℕ), primeDivTerm m p = A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
· pos A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∈ A⊢ ∑' (m : ℕ), primeDivTerm m p = A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) rw [Set.indicator_of_mem hp, pos A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∈ A⊢ ∑' (m : ℕ), primeDivTerm m p = 1 / (2 ^ p - 1) All goals completed! 🐙 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) tsum_primeDivTerm_left hp pos A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∈ A⊢ 1 / (2 ^ p - 1) = 1 / (2 ^ p - 1) All goals completed! 🐙 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)] All goals completed! 🐙 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
· neg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ A⊢ ∑' (m : ℕ), primeDivTerm m p = A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) rw [Set.indicator_of_notMem hp neg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ A⊢ ∑' (m : ℕ), primeDivTerm m p = 0 neg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ A⊢ ∑' (m : ℕ), primeDivTerm m p = 0 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)]neg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ A⊢ ∑' (m : ℕ), primeDivTerm m p = 0 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
have hp' : ¬ p.Prime := hp neg A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m pp:ℕhp:p ∉ Ahp':¬Nat.Prime p⊢ ∑' (m : ℕ), primeDivTerm m p = 0 A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
simp [primeDivTerm, hp'] A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (n : ℕ), ↑(ω n) / 2 ^ n = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1)
rw [h2, A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) All goals completed! 🐙 h3, A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) All goals completed! 🐙 h4, A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p = ∑' (p : ↑{n | Nat.Prime n}), 1 / (2 ^ ↑p - 1) All goals completed! 🐙 tsum_subtype A (fun p : ℕ => 1 / (2 ^ p - 1 : ℝ)) A:Set ℕ := {n | Nat.Prime n}h2:∑' (m : ℕ), ↑(ω m) / 2 ^ m = ∑' (m : ℕ) (p : ℕ), primeDivTerm m ph3:∑' (m : ℕ) (p : ℕ), primeDivTerm m p = ∑' (p : ℕ) (m : ℕ), primeDivTerm m ph4:∑' (p : ℕ) (m : ℕ), primeDivTerm m p = ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p⊢ ∑' (p : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) p = ∑' (x : ℕ), A.indicator (fun p ↦ 1 / (2 ^ p - 1)) x All goals completed! 🐙] All goals completed! 🐙end ArithmeticFunction