Skip to main content
AlexKontorovich/PrimeNumberTheoremAnd
Source indexedtheorem · leanprover/lean4:v4.32.0

Chebyshev.T.weighted_eq_sum

PrimeNumberTheoremAnd.IEANTN.Chebyshev · PrimeNumberTheoremAnd/IEANTN/Chebyshev.lean:126 to 158

Mathematical statement

Exact Lean statement

@[blueprint
  "cheby-T-E"
  (title := "Relating a weighted sum of $T$ to an $E$-weighted sum of von Mangoldt")
  (statement := /-- If $\nu : \N \to \R$ is finitely supported, then
$$ \sum_m \nu(m) T(x/m) = \sum_{n \leq x} E(x/n) \Lambda(n).$$ -/)
  (latexEnv := "lemma")
  (discussion := 834)]
theorem T.weighted_eq_sum (ν : ℕ →₀ ℝ) (x : ℝ) : ν.sum (fun m w ↦ w * T (x/m)) = ∑ n ∈ Icc 1 ⌊x⌋₊, Λ n * E ν (x/n)

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
@[blueprint  "cheby-T-E"  (title := "Relating a weighted sum of $T$ to an $E$-weighted sum of von Mangoldt")  (statement := /-- If $\nu : \N \to \R$ is finitely supported, then$$ \sum_m \nu(m) T(x/m) = \sum_{n \leq x} E(x/n) \Lambda(n).$$ -/)  (latexEnv := "lemma")  (discussion := 834)]theorem T.weighted_eq_sum (ν :  ) (x : ) : ν.sum (fun m w  w * T (x/m)) = ∑ n  Icc 1 ⌊x⌋₊, Λ n * E ν (x/n) := by  simp_rw [T.eq_sum_Lambda, E, Finsupp.mul_sum]  rw [ sum_finsetSum_comm]  apply Finsupp.sum_congr fun y hy  ?_  rw [Finset.mul_sum]  by_cases hy : y = 0  · simp [hy]  have one_le_y : 1  (y : ) := by grind [Nat.one_le_cast]  by_cases hx : x < 1  · simp [hx, show x / y < 1 from div_lt_one (by linarith)|>.mpr (by linarith)]  apply sum_subset_zero_on_sdiff  · apply Icc_subset_Icc_right    gcongr    exact div_le_self (by linarith) one_le_y  · intro t ht    simp only [mem_sdiff, mem_Icc, not_and, not_le] at ht    simp only [mul_eq_zero, Nat.cast_eq_zero, Nat.floor_eq_zero]    right    right    apply div_lt_one (by linarith)|>.mpr    have := ht.2 ht.1.1    apply div_lt_iff₀ (by simp; grind)|>.mpr    rw [Nat.floor_lt <| div_nonneg (by linarith) (by linarith)] at this    have := div_lt_iff₀ (by linarith)|>.mp this    rwa [mul_comm] at this  · grind