Parseval identity for the prime sum
ProvedLL_Decomp1535a.parseval_of_orthAssume that for every integer , equals if and otherwise. Then for every natural number , .
import Mathlib import Definitions.Def_LL_Decomp1535a_S open MeasureTheory
namespace LL_Decomp1535a
theorem parseval_of_orth
(horth : ∀ k : ℤ, ∫ α in (0 : ℝ)..1, Complex.exp (2 * Real.pi * Complex.I * α * k) =
if k = 0 then 1 else 0) (N : ℕ) :
∫ α in (0 : ℝ)..1, ‖S N α‖ ^ 2 =
∑ p ∈ (Finset.range (N + 1)).filter Nat.Prime, Real.log p ^ 2 := by sorry
end LL_Decomp1535aRead-back
What the Lean code literally says, in plain math · claude-haiku
LL_Decomp1535a.parseval_of_orth
For a natural number , the declaration assumes the hypothesis horth: for every integer ,
where is the imaginary unit and is the circle constant. Horth is a true identity for every integer , so it is satisfiable and does not make the statement vacuous.
Under this hypothesis, the declaration concludes
where is the natural logarithm, is the complex modulus, and is a complex-valued function of the real variable . The definition of lives in an imported module that this read-back does not expand, so the left side is only as explicit as that definition.
The right side sums over the primes with , so is included when is prime. For or there are no such primes and the right side is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.