Weighted count of prime pairs
DefinitionLL_Decomp1525c_PsiVFor real , sums over prime pairs satisfying , , and .
Definition code
import Mathlib
open Finset Real MeasureTheory intervalIntegral
open scoped Classical
noncomputable section
namespace LL_Decomp1525c
def PsiV (x : ℝ) : ℝ :=
∑ p₁ ∈ (Icc 3 ⌊x - 3⌋₊).filter Nat.Prime,
∑ _p₂ ∈ (Icc 1 ⌊2 * x - p₁⌋₊).filter (fun p : ℕ => p.Prime ∧ x - p₁ < (p : ℝ)), Real.log p₁
end LL_Decomp1525cRead-back
What the Lean code literally says, in plain math · claude-haiku
For , no hypotheses, with and , the Nat.floor. Since the summand does not depend on , this equals . For natural , matches , so the bounds are the real inequalities, strict below and non-strict above. For the outer range is empty and ; is only evaluated at primes , so no junk values arise. Classical only affects decidability.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.