Abstract harmonic analysis Positive definite functions Theorem
Schoenberg's theorem on negative definite kernels
Builds on Conditionally negative definite functionPositive-definite kernel
Statement
Let be a nonempty set, and let be a function with and for all . Then the following are equivalent.
- is a conditionally negative definite kernel: whenever and the real numbers satisfy .
- For every , the kernel is positive-definite.
Remarks
Proof idea: from 2 to 1, if , then , and the left side tends to as . From 1 to 2, fix ; then is a positive-definite kernel. By the Schur product theorem, is positive-definite, and is again positive-definite.
Example: on is conditionally negative definite, so every Gaussian kernel is positive-definite.
For a group , applied to , the theorem says that is a conditionally negative definite function exactly when is a positive-definite function for every .
Going deeper
For a student
Schoenberg's theorem is the standard way to produce positive-definite kernels, such as the Gaussian kernel, from conditionally negative definite ones. For groups, it links affine isometric actions on Hilbert space, which give conditionally negative definite functions, with unitary representations, which give positive-definite functions. This is the mechanism behind the Delorme–Guichardet theorem on property (T) and behind the Haagerup property. In probability, a complex-valued version of the theorem underlies the Lévy–Khintchine description of the characteristic exponents of Lévy processes.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
Further reading
About this page
| Tag | 7C0F34FGE3 |
|---|---|
| URI | m2://7C0F34FGE3 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 43A35, 46E22 |
| Status | This copy of the site has no build data. Run m2 status 7C0F34FGE3. |
| About | Conditionally negative definite function, Positive-definite kernel |
| Uses | Conditionally negative definite function, Positive-definite kernel |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.