Explicit squarefree count on a dyadic block
OpenLL_Decomp1543a.squarefree_dyadicFor every natural and real , . Thus the count is restricted to as well as .
import Mathlib import Definitions.Def_LL_Decomp1543a_tBlock open Real Finset ArithmeticFunction
namespace LL_Decomp1543a
theorem squarefree_dyadic (N : ℕ) (M : ℝ) (hM : exp 13.066 ≤ M) :
∑ t ∈ tBlock N M, |(moebius t : ℝ)| ≤ 0.6111 * M := by sorry
end LL_Decomp1543aRead-back
What the Lean code literally says, in plain math · claude-haiku
For every natural number (zero allowed) and every real number with , where , the declaration asserts
Here is a finite set, defined in another item and not shown, whose members are taken to be natural numbers, since is the Möbius function on the naturals with integer values, and is read in . The constant equals . Because , the left side counts the squarefree members of . The value is by convention, so contributes nothing. If is empty for some and , the bound holds trivially. The hypothesis is satisfiable, so it is not vacuous. The proof is left as sorry, so the statement is unproven.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.