Representation function at odd arguments
ProvedLL_Decomp1526a.rep_of_oddFor every natural number that is not even, if is prime, and otherwise, where is natural subtraction.
import Mathlib import Definitions.Def_LL_Decomp1526a_rep open Finset Real open scoped Chebyshev Classical
namespace LL_Decomp1526a
theorem rep_of_odd {N : ℕ} (hN : ¬ Even N) :
rep N = if (N - 2).Prime then 2 * Real.log 2 * Real.log ((N - 2 : ℕ) : ℝ) else 0 := by sorry
end LL_Decomp1526aRead-back
What the Lean code literally says, in plain math · claude-haiku
Let be a natural number with not even, that is, odd. For every such , the statement asserts
Here is a function from to that is defined in an imported file. Its definition is not unfolded in this read-back, and the statement uses it only as given.
The subtraction is natural-number subtraction, so it is truncated at . For , , which is not prime, so the statement gives . For , , which is not prime, so . For , is prime, so the first case applies.
The primality test is applied to the natural number . The logarithm is the real natural logarithm, applied to the real number obtained by casting to .
The statement covers odd only and says nothing about even . It has no further hypotheses. The proof is not supplied in the declaration (it is given as sorry).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.