Bochner's theorem (orthogonal polynomials)

A classification theorem identifying the classical orthogonal-polynomial sequences that are eigenfunctions of a second-order differential operator with polynomial coefficients.

Version

v1 · 2026-09-08 · History

Domain-specific #

3498

Origin domain

orthogonal polynomials

Subdomain

orthogonal polynomials

Core Idea

Under standard degree and orthogonality hypotheses, a polynomial sequence satisfying one fixed second-order differential equation belongs, up to affine changes and limiting cases, to the Hermite, Laguerre, or Jacobi families. Degree preservation forces the leading differential coefficient to be at most quadratic and the first-order coefficient at most linear; positivity and boundary conditions then restrict admissible weights. 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.

Scope of Application

Bochner's theorem (orthogonal polynomials) belongs to orthogonal polynomials and is useful where the analyst can specify the typed orthogonal polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification. The scope is broad within that domain but bounded by the need for the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification. 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 the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification 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 Bochner's theorem (orthogonal polynomials) 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 Bochner's theorem (orthogonal polynomials). Bochner's theorem (orthogonal polynomials) 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

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed orthogonal polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of orthogonal polynomials because they reuse the typed orthogonal polynomials carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Degree preservation forces the leading differential coefficient to be at most quadratic and the first-order coefficient at most linear; positivity and boundary conditions then restrict admissible weights., and type the carrier, state every parameter and convention in the definition, test that the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Bochner's theorem (orthogonal polynomials) Domain-specific

Parents (1) — more general patterns this builds on

• Bochner's theorem (orthogonal polynomials) is a kind of Classification Prime

  The proposed strict upward parent is prime:classification.

Hierarchy path (1) — routes to 1 parentless root

• Bochner's theorem (orthogonal polynomials) → Classification

Neighborhood in Abstraction Space

Bochner's theorem (orthogonal polynomials) sits in a crowded region of the domain-specific corpus (40^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Polynomial Algebra & Field Structure (25 abstractions)

Nearest neighbors

• Bochner–Martinelli formula — 0.90
• Stable polynomial — 0.90
• Christoffel–Darboux formula — 0.90
• Quadratic function — 0.89
• Zolotarev polynomials — 0.89

Computed from structural-signature embeddings · 2026-09-08