Papers
Topics
Authors
Recent
Search
2000 character limit reached

Christoffel Function & Its Applications

Updated 11 July 2026
  • Christoffel function is a key concept in approximation theory defined via orthogonal polynomials and moment matrices.
  • It underpins methods in support recovery, anomaly detection, classification, and optimal design through its reciprocal representation.
  • Its detailed kernel and asymptotic analyses enable practical algorithms for empirical regression, adaptive sampling, and density estimation.

The Christoffel function is a classical object from approximation theory and orthogonal polynomials. For a finite Borel measure μ\mu on Rp\mathbb{R}^p with finite moments and positive definite moment matrix Md(μ)M_d(\mu), its degree-dd form is

Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},

where vd(x)v_d(x) is the vector of monomials up to degree dd and {Pα}\{P_\alpha\} is an orthonormal polynomial basis. Equivalently,

Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.

On compact domains with uniform weight, the same extremal definition is used for algebraic polynomials of bounded total degree. In the literature represented here, the Christoffel function and its reciprocal—the diagonal of the Christoffel–Darboux kernel—encode moment data, orthogonal-polynomial geometry, and support information, and they underpin results on pointwise asymptotics, support recovery, anomaly detection, classification, optimal design, and weighted least-squares approximation (Lasserre et al., 2017, Lasserre, 2023, Prymak et al., 2018).

1. Definition, kernel representation, and basic formulations

For a measure μ\mu, the Christoffel–Darboux kernel is

Rp\mathbb{R}^p0

and the Christoffel function is its reciprocal on the diagonal: Rp\mathbb{R}^p1 In domain-based notation, for a compact planar domain Rp\mathbb{R}^p2 with nonempty interior and uniform weight Rp\mathbb{R}^p3, the Christoffel function of degree Rp\mathbb{R}^p4 is

Rp\mathbb{R}^p5

where Rp\mathbb{R}^p6 is any orthonormal basis of Rp\mathbb{R}^p7, and equivalently

Rp\mathbb{R}^p8

This extremal form is the main tool in several geometric analyses (Prymak et al., 2017, Prymak et al., 2018).

The reciprocal quantity is often emphasized. In multivariate polynomial regression and experimental design, the Christoffel polynomial is written

Rp\mathbb{R}^p9

with Christoffel function Md(μ)M_d(\mu)0. The same extremal characterization appears there: Md(μ)M_d(\mu)1 This notational shift reflects whether the diagonal kernel or its reciprocal is the primary object in a given application (Castro et al., 2017).

Several structural identities recur. For fixed Md(μ)M_d(\mu)2, the optimizer in the variational problem is the normalized reproducing kernel

Md(μ)M_d(\mu)3

and one has

Md(μ)M_d(\mu)4

The function is also affine invariant in the measure-based formulation, while on domains one has affine covariance

Md(μ)M_d(\mu)5

for nondegenerate affine maps Md(μ)M_d(\mu)6, as well as monotonicity

Md(μ)M_d(\mu)7

These properties are central in reductions to model geometries and in data-analytic uses such as affine matching (Lasserre et al., 2017, Prymak et al., 2018).

2. Pointwise asymptotics and boundary geometry

A major branch of the theory studies the pointwise behavior of Md(μ)M_d(\mu)8 as Md(μ)M_d(\mu)9, with explicit dependence on the geometry of the support. For planar convex domains, a lower bound can be expressed through a modification of the parallel section function. If dd0, dd1 is a unit vector, dd2, and dd3 are the two half-lengths of the section orthogonal to dd4 through dd5, then under dd6,

dd7

Combined with a recent upper estimate,

dd8

this yields a sharp pointwise asymptotic whenever the section lengths are comparable along inward normal motion. In that regime,

dd9

so the Christoffel function is determined by the local section geometry (Prymak et al., 2017).

For the model family

Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},0

the modified section lengths satisfy

Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},1

where Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},2 is a nearest boundary point and Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},3 is the outward unit normal there. Consequently, for interior points sufficiently close to the boundary,

Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},4

The formula interpolates between smooth arcs of the boundary and the curvature-degenerate points Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},5 and Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},6 (Prymak et al., 2017).

For planar domains with piecewise Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},7 boundary and corner angles strictly between Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},8 and Λμ,d(x)=[vd(x)TMd(μ)1vd(x)]1=(αNdpPα(x)2)1,\Lambda_{\mu,d}(x)=\big[v_d(x)^T M_d(\mu)^{-1}v_d(x)\big]^{-1} =\left(\sum_{\alpha\in N_d^p}P_\alpha(x)^2\right)^{-1},9, the pointwise behavior is described uniformly in both vd(x)v_d(x)0 and vd(x)v_d(x)1. Writing

vd(x)v_d(x)2

Theorem 1.1 gives

vd(x)v_d(x)3

Near a smooth boundary portion there is one boundary factor, whereas near a corner the behavior is multiplicative in the distances to the two adjacent arcs. The method covers nonconvex domains and domains with holes, but it does not handle cusps or interior angles vd(x)v_d(x)4 (Prymak et al., 2018).

Other boundary-sensitive formulas occur for weighted and modified supports. For generalized Jacobi measures on a quasidisk vd(x)v_d(x)5,

vd(x)v_d(x)6

where vd(x)v_d(x)7 is a conformal boundary scale and the weight has algebraic factors vd(x)v_d(x)8 with vd(x)v_d(x)9. The quasidisk assumption is essential: the paper proves that the analogous lower bound can fail dramatically on a non-quasidisk Jordan domain (Andrievskii, 2016).

A distinct modified setting is the unit ball with an additional mass uniformly distributed on the sphere. There the reciprocal Christoffel function is the diagonal of a modified reproducing kernel dd0. The leading asymptotic is unchanged in the interior,

dd1

but on the sphere the added mass changes the boundary regime: dd2 Thus the singular boundary term is asymptotically invisible in the bulk but dominant on the support of the added mass (Martínez et al., 2017).

3. Empirical Christoffel functions, support recovery, and density estimation

Replacing dd3 by the empirical measure

dd4

yields the empirical Christoffel function

dd5

or equivalently

dd6

For fixed degree dd7, the empirical and population Christoffel functions satisfy the almost sure uniform convergence

dd8

The same work shows that thresholding the scaled Christoffel function can recover a compact support in Hausdorff distance, and that the method extends from uniform measures to measures with density bounded below on the support (Lasserre et al., 2017).

A finite-sample theory makes this heuristic quantitative. With

dd9

and explicit choices of degree {Pα}\{P_\alpha\}0 and threshold {Pα}\{P_\alpha\}1 as functions of the sample size, one obtains with probability at least {Pα}\{P_\alpha\}2,

{Pα}\{P_\alpha\}3

where

{Pα}\{P_\alpha\}4

Under an additional tube-volume condition on the boundary, the same rate holds for the symmetric difference: {Pα}\{P_\alpha\}5 The analysis relies on concentration inequalities for the empirical Christoffel function and on bounds for the supremum of the Christoffel–Darboux kernel on sets with smooth boundaries (Vu et al., 2019).

The classical asymptotic relation

{Pα}\{P_\alpha\}6

contains the density {Pα}\{P_\alpha\}7 of the equilibrium measure of the support, which is usually unknown. A regularized alternative replaces point evaluation by averaging over an {Pα}\{P_\alpha\}8-box: {Pα}\{P_\alpha\}9 Its reciprocal is an explicit sum-of-squares polynomial in Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.0,

Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.1

and for fixed Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.2,

Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.3

The same modified function retains the classical dichotomy: its reciprocal grows at most polynomially inside the support and exponentially outside (Lasserre, 2023).

High-dimensional inference motivates further modifications. One paper replaces the total-degree polynomial space by a coordinate-wise degree space, preserving a support dichotomy while adapting to product structure; for product measures, the coordinate-wise Christoffel polynomial factors into univariate terms. A sparsified rational Christoffel function is then built from clique and separator marginals of a junction tree associated with a graphical model. Its computational complexity depends on the treewidth of the model rather than on the ambient dimension, while it preserves the qualitative inside/outside support dichotomy and admits a regularized density-approximation variant (Lasserre et al., 2024).

4. Outlier detection, classification, and distribution regression

In data analysis, the reciprocal Christoffel function is frequently used as a score. For polynomial features Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.4, the inverse Christoffel function is

Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.5

and large values indicate that a point lies far from the data cloud. Its level sets were observed to follow the geometry of the sample, leading to anomaly detectors of the form

Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.6

A kernelized lower bound makes this practical in high dimensions by replacing the Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.7 moment-matrix inverse with kernel computations. The resulting method was evaluated on 15 benchmark outlier-detection datasets. The reported summary statistics were: KIC2 highest average AUPRC Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.8, KIC2-RBF best average rank Λμ,d(x)=minPR[X]d{P(z)2dμ(z): P(x)=1}.\Lambda_{\mu,d}(x)=\min_{P\in\mathbb{R}[X]_d}\left\{\int P(z)^2\,d\mu(z):\ P(x)=1\right\}.9, and KIC2 lowest RMSD μ\mu0 (Askari et al., 2018).

A complementary perturbation theory studies how Christoffel–Darboux kernels change under small-norm perturbations and finite atomic additions to a base measure. For a discrete perturbation

μ\mu1

the leverage score

μ\mu2

serves as a quantitative criterion for outlier detection. In the setting of area measure on a planar domain plus finitely many exterior point masses, the leverage score of an outlier converges exponentially fast to μ\mu3, while Christoffel level sets converge in Hausdorff distance to the union of the bulk support and the outlier set (Beckermann et al., 2018).

For supervised classification, the procedure is classwise. If class μ\mu4 has empirical measure μ\mu5, then the empirical class score is

μ\mu6

and the classifier is

μ\mu7

Under disjoint compact class supports with nonempty interior and densities bounded below by a positive constant, the classifier is eventually correct on points that stay a positive distance away from class boundaries, and for fixed μ\mu8 this property holds almost surely for sufficiently large sample size μ\mu9 (Lasserre, 2022).

The Christoffel function has also been used for distribution regression and multiple-instance learning. Given bags Rp\mathbb{R}^p00, one first computes a bag-specific Christoffel function

Rp\mathbb{R}^p01

which acts as a weight measuring how concentrated the bag is near a query point Rp\mathbb{R}^p02. These weights define a second weighted moment matrix on the outcome variable Rp\mathbb{R}^p03, leading to a conditional Christoffel function

Rp\mathbb{R}^p04

A Gauss quadrature for the second-step measure then produces candidate outcomes Rp\mathbb{R}^p05 and normalized probabilities Rp\mathbb{R}^p06 (Malyshkin, 2015).

5. Polynomial optimization, optimal design, and adaptive sampling

In D-optimal design for multivariate polynomial regression on a compact semi-algebraic set Rp\mathbb{R}^p07, the Christoffel polynomial is the dual object that links a moment formulation to the geometry of the optimal support. The ideal design problem is

Rp\mathbb{R}^p08

and the dual/KKT conditions yield the positivity certificate

Rp\mathbb{R}^p09

The optimal measure is supported on the contact set

Rp\mathbb{R}^p10

Thus the Christoffel polynomial acts as an implicit equation for the support of the D-optimal design (Castro et al., 2017).

This design-theoretic role is part of a broader connection with sum-of-squares certificates. If Rp\mathbb{R}^p11 is the degree-Rp\mathbb{R}^p12 Christoffel–Darboux kernel, then

Rp\mathbb{R}^p13

admits the usual moment-matrix and variational representations, but inverse Christoffel functions also appear directly in semialgebraic positivity certificates. One paper shows that if a polynomial lies in the interior of the truncated quadratic module, then it can be represented as a sum of terms of the form

Rp\mathbb{R}^p14

The same work interprets lower SOS bounds as searching over signed polynomial densities and upper SOS bounds as searching over positive SOS densities. A related disintegration theorem states that for a joint measure on Rp\mathbb{R}^p15,

Rp\mathbb{R}^p16

so the Christoffel function factorizes into a marginal term and a conditional term in the spirit of measure disintegration (Lasserre, 2023, Lasserre, 2022).

In numerical approximation, Christoffel-based weighting leads to stable least-squares schemes. The Christoffel Least Squares method samples from the equilibrium measure Rp\mathbb{R}^p17 and uses weights

Rp\mathbb{R}^p18

For total-degree polynomial spaces, the key asymptotic matching is

Rp\mathbb{R}^p19

so the effective CLS weight approaches the target orthogonality weight. The method yields a sample-size condition of the form

Rp\mathbb{R}^p20

and the paper reports substantially improved stability over standard Monte Carlo least squares in many bounded and unbounded polynomial families (Narayan et al., 2014).

A related adaptive-sampling construction appears in deep learning. CAS4DL interprets the penultimate layer of a neural network as a dictionary Rp\mathbb{R}^p21, orthogonalizes it on a finite grid by SVD, and defines the normalized reciprocal Christoffel function

Rp\mathbb{R}^p22

Sampling is then driven by the Christoffel function of the learned subspace. Across several smooth test functions and dimensions, the reported errors were often 2 to 10 times smaller than with standard Monte Carlo for the same sample budget, especially with smooth activations such as Rp\mathbb{R}^p23 and ELU (Adcock et al., 2022).

6. Extensions beyond the standard finite-dimensional setting

The Christoffel function extends naturally to biorthogonal and infinite-dimensional contexts, although some classical identities change form. For multiple orthogonal polynomials, the kernel is

Rp\mathbb{R}^p24

where Rp\mathbb{R}^p25 and Rp\mathbb{R}^p26 are biorthogonal rather than identical sequences. The diagonal quantity Rp\mathbb{R}^p27 is no longer a sum of squares, but under a near-diagonal boundedness condition on the associated lower Hessenberg operator Rp\mathbb{R}^p28, the normalized kernel measure

Rp\mathbb{R}^p29

has the same asymptotic moments, and hence the same weak limit under the stated hypotheses, as the normalized zero counting measure of the type II multiple orthogonal polynomials. This extends the classical correspondence between Christoffel kernels and zero distributions to Angelesco, AT, and Nikishin systems (Świderski et al., 2022).

An infinite-dimensional Christoffel function has been defined on a separable real Hilbert space Rp\mathbb{R}^p30 of functions. For polynomial spaces Rp\mathbb{R}^p31 of algebraic degree Rp\mathbb{R}^p32 and harmonic degree Rp\mathbb{R}^p33,

Rp\mathbb{R}^p34

and the Christoffel function is

Rp\mathbb{R}^p35

where Rp\mathbb{R}^p36 is supported on a compact Rp\mathbb{R}^p37. When the moment matrix is nonsingular,

Rp\mathbb{R}^p38

The same inside/outside dichotomy persists: for Rp\mathbb{R}^p39,

Rp\mathbb{R}^p40

while if Rp\mathbb{R}^p41, then

Rp\mathbb{R}^p42

This formulation is used as a score function for detecting abnormal trajectories relative to a database of reference trajectories, and empirical moment matrices admit rank-one updates through Sherman–Morrison–Woodbury when new trajectories arrive (Henrion et al., 2024).

These extensions suggest a common pattern across otherwise different settings. The Christoffel function remains tied to a finite-dimensional polynomial space, a moment matrix, and an extremal normalization constraint; what changes is the geometry encoded by the support, the type of orthogonality, and the role played by the reciprocal diagonal kernel.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Christoffel Function.