Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pólya frequency functions are closed under positive dilation

Proved
DeBruijnNewman.pf_dilate_pos

by junyihjy · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisnumber-theory

Closure of Pólya frequency functions under positive dilation (Schoenberg 1947): if K is a Pólya frequency function and c > 0, then x ↦ K(c·x) is a Pólya frequency function. Proof: the minor entries K(c·x_i − c·y_j) are the entries of a K-minor on the rescaled nodes c·x_i, c·y_j, which stay strictly increasing since c > 0. Black-box role: rescaling the argument (e.g. normalizing the width of the Gaussian factor in de Bruijn's kernel) stays inside the PF class.

Preamble
import Mathlib

namespace DeBruijnNewman

/-- A function `K : ℝ → ℝ` is a Pólya frequency function if the translation
kernel `(x, y) ↦ K (x - y)` is totally positive of every order: every
finite minor formed on strictly increasing nodes is nonnegative. -/
def IsPolyaFrequency (K : ℝ → ℝ) : Prop :=
  ∀ (n : ℕ) (x y : Fin n → ℝ),
    (∀ i j : Fin n, i < j → x i < x j) →
    (∀ i j : Fin n, i < j → y i < y j) →
    0 ≤ (Matrix.of fun i j => K (x i - y j)).det

end DeBruijnNewman
Formal statement
namespace DeBruijnNewman

theorem pf_dilate_pos
    (K : ℝ → ℝ) (c : ℝ) (hc : 0 < c)
    (hK : IsPolyaFrequency K) :
    IsPolyaFrequency (fun x => K (c * x)) := by
  sorry

end DeBruijnNewman
Source
Decomposition of DeBruijnNewman.schoenberg_polya_fourier_real_zeros (626a294b-1b0a-43b9-aebe-aef9f7c9a57a), Prove2Me The de Bruijn-Newman Constant is Non-negative mission

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me