Sum of squared logs below log N times theta
ProvedLL_Decomp1535a.sum_log_sq_leFor every natural number , .
import Mathlib import Definitions.Def_LL_Decomp1535a_theta open MeasureTheory
namespace LL_Decomp1535a
theorem sum_log_sq_le (N : ℕ) :
∑ p ∈ (Finset.range (N + 1)).filter Nat.Prime, Real.log p ^ 2 ≤
Real.log N * theta N := by sorry
end LL_Decomp1535aRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp1535a.sum_log_sq_le
Statement. For every natural number , including :
Quantifiers and inputs. There is one input, , and no hypotheses. The statement is claimed for all such .
Left side. The sum runs over the primes in the set , so it covers exactly the primes . Each term is , where is the natural logarithm of viewed as a real number.
Right side. is the natural logarithm of , viewed as a real number. The symbol is the function evaluated at . It is defined in the imported module Definitions.Def_LL_Decomp1535a_theta, whose contents were not supplied for this read-back, so is not expanded here. The right side is the product of and .
Degenerate cases. For and there are no primes , so the left side is the empty sum . In this formalization the logarithm of is taken to be , and , so the right side is as well and the inequality reads . For the only prime is , so the left side is .
Strength. The relation is a non-strict inequality (), with the left side on the small side and the right side on the large side.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.