Weakened squarefree-counting lower bound (Kriz–Nordentoft Lemma 5.7 core)
ProvedHorizontalPadicL.squarefree_counting_lower_boundWeakened squarefree-counting core of the Kriz--Nordentoft log-lower-bound argument (Lemma 5.7, weakened form): there is a uniform positive constant c such that, for every N ≥ 1, at least c·N of the integers 0, …, N are squarefree. This is the elementary counting lemma that the character-counting theorem supportedPrimePowerCharacters_logLowerBound (Kriz–Nordentoft, Horizontal p-adic L-functions, https://arxiv.org/pdf/2310.20678, Section 2.3.3, Lemma 5.7) reduces to once its hypothesis HasPrimeNaturalDensity supplies the weighting for the sieve; removing the lower-order characters afterwards only improves the bound.
MATHLIB-NATIVE RESTATEMENT (2026-09-24): the leaf's counting predicates (characterConductorCount, supportedPrimePowerCharacters, HasLogPowerLowerBound) live in the custom Definitions.Def_KN_PrimePowerPropagation tower with no Mathlib counterparts, so the node as stated is not attackable. This restatement carries the log-lower-bound content in provable elementary form: Mathlib's Squarefree, Finset.filter and Finset.card. The intended proof is a sieve union bound: every non-squarefree n ≥ 1 is divisible by some square x^2 with x ≥ 2, at most N/x^2 integers below N are divisible by x^2, and ∑_{x≥2} 1/x^2 = π^2/6 − 1 < 0.645, giving c = 1/3. The namespace HorizontalPadicL keeps it connected to the Kriz–Nordentoft mission graph.
import Mathlib set_option autoImplicit false
namespace HorizontalPadicL
/-- Weakened squarefree-counting core of the log-lower-bound argument
(Kriz--Nordentoft Lemma 5.7, weakened form): a uniform positive proportion
of the integers below any bound are squarefree. The character-counting
statement `supportedPrimePowerCharacters_logLowerBound` reduces to this
counting estimate once the hypothesis `HasPrimeNaturalDensity` supplies
the weighting for the sieve; the lower-order characters removed afterwards
only improve the bound. Stated with Mathlib's `Squarefree` and
`Finset.filter`/`Finset.card` so it is attackable with elementary sieve
methods (union bound over square divisors plus the Basel sum
`∑' n, 1 / n ^ 2 = π ^ 2 / 6`). -/
theorem squarefree_counting_lower_bound :
∃ c : ℝ, 0 < c ∧ ∀ N : ℕ, 1 ≤ N →
c * (N : ℝ) ≤ (((Finset.range (N + 1)).filter (fun n : ℕ => Squarefree n)).card : ℝ) := by
sorry
end HorizontalPadicL