Kernel Barriers mathematical objects
DefinitionAnalyticCombinatorics_Ch8_Partitions_KernelBarriersanalytic-combinatoricscontraction-recordslean4partitions-support
For , kernelMass n is the total recurrence-kernel mass , and for reals , kernelWindow a b n is the same sum restricted to the indices with .
Definition code
import Definitions.Def_AnalyticCombinatorics_Ch8_Partitions_ErdosKernel
import Mathlib
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Barrier-package foundations (HR Stage I.5)
Definitions and the easy layers of the logarithmic-barrier route to two-sided boundedness
of `u` (route R6, audited): `kernelMass`/`kernelWindow`, the barriers `1 ∓ A/log(n+E)`,
the slack scale `1/(√n log²(n+E))`, the positive fixed window (from the banked
`erdos_kernel_window` + integral positivity), barrier range bounds, and boundary-vs-slack
negligibility (from the banked cube-decay lemma). Opus-authored.
-/
set_option maxHeartbeats 400000
noncomputable section
open Filter Finset
open scoped BigOperators Topology
namespace AnalyticCombinatorics.Ch8.Partitions.Erdos
/-- Total kernel mass. -/
noncomputable def kernelMass (n : ℕ) : ℝ :=
∑ m ∈ Finset.Icc 1 (n - 1), erdosWeight n m
/-- Half-open window kernel mass `(a√n, b√n]`. -/
noncomputable def kernelWindow (a b : ℝ) (n : ℕ) : ℝ :=
∑ m ∈ Finset.Icc 1 (n - 1),
if a * Real.sqrt (n : ℝ) < (m : ℝ) ∧ (m : ℝ) ≤ b * Real.sqrt (n : ℝ)
then erdosWeight n m else 0
end AnalyticCombinatorics.Ch8.Partitions.Erdos
Source