Documentation

LeanPool.OSforGFF.General.PositiveDefinite

Positive Definite Functions

This file contains the definition of positive definite functions and basic lemmas. Extracted from Minlos.lean to avoid circular imports with GaussianRBF.lean.

Key definitions:

Key lemmas:

Positive Definiteness #

Namespaced under GFF4D to avoid clash with IsPositiveDefinite from the bochner library (which requires both hermitian + nonneg).

def GFF4D.IsPositiveDefinite {α : Type u_1} [AddGroup α] (φ : α) :

A function φ : α → ℂ is positive definite if for any finite collection of points x₁, ..., xₘ and complex coefficients c₁, ..., cₘ, we have ∑ᵢⱼ cbarᵢ cⱼ φ(xᵢ - xⱼ) ≥ 0

This is the standard definition in harmonic analysis and probability theory.

Equations
Instances For
    theorem GFF4D.isPositiveDefinite_precomp_linear {E : Type u_1} {H : Type u_2} [AddCommGroup E] [AddCommGroup H] [Module E] [Module H] (ψ : H) (hPD : IsPositiveDefinite ψ) (T : E →ₗ[] H) :
    IsPositiveDefinite fun (f : E) => ψ (T f)

    Composition preserves positive definiteness: if ψ is positive definite on H and T : E →ₗ[ℝ] H is linear, then ψ ∘ T is positive definite on E.