Christoffel–Darboux formula¶

An identity collapsing a finite weighted sum of products of orthogonal polynomials into a quotient involving only two consecutive polynomial degrees.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3680
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Orthogonal Polynomials, Kernel Identities → Mathematics

Core Idea¶

The Christoffel–Darboux formula rewrites the degree-n kernel sum of products of orthogonal polynomials as an antisymmetric expression in the nth and next polynomial divided by the point difference. Terms generated by the three-term recurrence cancel telescopically, leaving only a boundary pair; taking coincident points yields the confluent derivative form. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Cancel-Out Trick

Some math helpers are special number-patterns that line up in a neat order. If you add up a long list made from them, a trick happens: almost every piece cancels out a neighbor, like one step forward and one step back. At the end you only need the last two patterns to know the whole answer.

The Last-Two Shortcut

Mathematicians study special families of formulas called orthogonal polynomials, where each new member is built from the two before it. Sometimes you need a big total: multiply matching members together at two points and add them all up to a certain size. The Christoffel–Darboux formula says you don't have to add them one by one. Because of the way each member is built from its neighbors, almost everything cancels out, and the whole total can be written using only the last two members, divided by how far apart the two points are.

Telescoping Kernel Identity

Orthogonal polynomials are a sequence of polynomials p0, p1, p2, ... that are 'perpendicular' to each other under a chosen weighted average, and each one can be built from the previous two by a three-term recurrence. A common object is the kernel: the sum of p_k(x)·p_k(y) over k from 0 to n, suitably scaled. The Christoffel–Darboux formula rewrites that whole sum as a short expression involving only p_n and p_(n+1) at the two points, divided by (x − y). The reason is telescoping: plugging in the recurrence makes consecutive terms cancel, leaving just a 'boundary' pair. If you let x and y become the same point, you get a version with derivatives instead of a difference. The formula only holds if you use the same normalization and scaling conventions on both sides.

Let {p_k} be orthogonal polynomials with respect to some weight, satisfying a three-term recurrence. The degree-n kernel K_n(x,y) = Σ_{k=0}^{n} p_k(x)p_k(y)/h_k (with h_k the squared norms) is a sum of n+1 products. The Christoffel–Darboux formula states that this kernel equals a constant (fixed by leading coefficients and norms) times [p_{n+1}(x)p_n(y) − p_n(x)p_{n+1}(y)] / (x − y). The expression in the bracket is antisymmetric in x and y, which is why dividing by x − y gives a polynomial. The proof multiplies the recurrence through and observes that consecutive terms telescope, leaving only the boundary pair of degrees n and n+1. Letting y → x gives the confluent form, involving p_n, p_{n+1} and their derivatives. The identity is sensitive to conventions: the normalization, norm weights and leading-coefficient ratio must be stated consistently, or the constant comes out wrong.

Scope of Application¶

Christoffel–Darboux formula belongs to orthogonal polynomials and is useful where the analyst can specify an orthogonal-polynomial sequence, an inner-product measure, squared norms and leading coefficients, two evaluation points, a finite reproducing-kernel sum, and the three-term recurrence, then evaluate polynomial normalization, norm weights and leading-coefficient convention are consistent on both sides of the identity. The scope is broad within that domain but bounded by the need for polynomial normalization, norm weights and leading-coefficient convention are consistent on both sides of the identity. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making polynomial normalization, norm weights and leading-coefficient convention are consistent on both sides of the identity the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Christoffel–Darboux formula can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Christoffel–Darboux formula. Christoffel–Darboux formula compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: an orthogonal-polynomial sequence, an inner-product measure, squared norms and leading coefficients, two evaluation points, a finite reproducing-kernel sum, and the three-term recurrence. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express polynomial normalization, norm weights and leading-coefficient convention are consistent on both sides of the identity independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of orthogonal polynomials because they reuse an orthogonal-polynomial sequence, an inner-product measure, squared norms and leading coefficients, two evaluation points, a finite reproducing-kernel sum, and the three-term recurrence, Terms generated by the three-term recurrence cancel telescopically, leaving only a boundary pair; taking coincident points yields the confluent derivative form., and type the carrier, state every parameter and convention in the definition, test that polynomial normalization, norm weights and leading-coefficient convention are consistent on both sides of the identity, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Christoffel–Darboux formula Domain-specific

Parents (1) — outgoing typed relations

Christoffel–Darboux formula is a kind of Compression Prime

The identity compresses a long orthogonal-polynomial sum into boundary data.

Hierarchy paths (3) — routes to 3 parentless roots

Christoffel–Darboux formula → is a kind of Compression → is a kind of Abstraction

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Christoffel–Darboux formula sits in a crowded region of the domain-specific corpus (25^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Orthogonal Polynomials & Special Functions (14 abstractions)

Nearest neighbors

Bochner's theorem (orthogonal polynomials) — 0.90
Mott polynomials — 0.89
Bombieri norm — 0.89
Stable polynomial — 0.89
Constant-recursive sequence — 0.89

Computed from structural-signature embeddings · 2026-10-25