Definite quadratic form¶

A real quadratic form that is strictly positive on every nonzero vector or strictly negative on every nonzero vector.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4080
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Linear Algebra → Mathematics

Core Idea¶

The scalar field is ordinarily real, positive and negative definite forms are separated by sign, semidefinite permits nonzero null vectors and definiteness is invariant under invertible congruence but not arbitrary coefficient inspection. A symmetric matrix represents the form; its eigenvalue signs, leading principal minors or completed-square decomposition show whether every nonzero direction has the same strict sign. 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 Always-Uphill Bowl

Picture a round bowl. Start at the very bottom and take a step in any direction: you always go up. A definite quadratic form is a math rule shaped like that bowl, where every direction away from the middle goes up. There is also an upside-down kind, like a hilltop, where every direction goes down.

Bowl-Shaped Number Rule

A quadratic form is a rule that takes a point and gives back a number made from squares and products of its coordinates, like x² + y². It is called positive definite if every point except the very center gives a positive number, like a bowl where every direction goes up. It is negative definite if every point except the center gives a negative number, like an upside-down bowl. If some directions go up and others go down, like a saddle, it is not definite. If some direction stays perfectly flat, like a long trough, it is only "semidefinite."

Strictly One-Signed Quadratic Forms

A quadratic form q assigns to each vector v a number built from second-degree terms, such as q(x, y) = 2x^2 + xy + 3y^2. It is positive definite if q(v) > 0 for every nonzero v, and negative definite if q(v) < 0 for every nonzero v. That is stronger than semidefinite, which allows q(v) = 0 for some nonzero directions (a flat trough), and different from indefinite, where some directions are positive and others negative (a saddle). You can test definiteness by writing q with a symmetric matrix and checking the signs of its eigenvalues, or by completing the square. Changing coordinates by an invertible linear change does not change whether a form is definite, even though its coefficients change, so just eyeballing the coefficients is not a reliable test.

On a finite-dimensional real vector space, a quadratic form q is represented by a symmetric matrix A with q(v) = v^T A v, and it comes with an associated symmetric bilinear form. The form is positive definite if q(v) > 0 for all nonzero v and negative definite if q(v) < 0 for all nonzero v; semidefinite forms allow nonzero null vectors, and indefinite forms take both signs. Standard tests: all eigenvalues of A are strictly positive (or strictly negative); Sylvester's criterion on the leading principal minors (all positive, or alternating starting negative); or completing squares to a diagonal form with coefficients of one strict sign. Under an invertible change of basis P, A becomes P^T A P (congruence), which changes the entries but preserves the signature, the counts of positive, negative and zero coefficients (Sylvester's law of inertia). Definiteness is exactly the statement that the signature is all positive or all negative with no zeros. So definiteness is a congruence invariant, and individual matrix entries alone do not decide it.

Scope of Application¶

Definite quadratic form belongs to linear algebra and is useful where the analyst can specify the typed linear algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the finite-dimensional real vector space, quadratic form q and associated symmetric bilinear form or matrix A, nonzero vectors, positive-definite q(v)>0 or negative-definite q(v)<0 condition, eigenvalue and Sylvester criteria, change of basis and congruence invariance, signature and inertia and distinction from semi and indefinite forms are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the finite-dimensional real vector space, quadratic form q and associated symmetric bilinear form or matrix A, nonzero vectors, positive-definite q(v)>0 or negative-definite q(v)<0 condition, eigenvalue and Sylvester criteria, change of basis and congruence invariance, signature and inertia and distinction from semi and indefinite forms are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

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 Definite quadratic form. Definite quadratic form 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: the typed linear algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the finite-dimensional real vector space, quadratic form q and associated symmetric bilinear form or matrix A, nonzero vectors, positive-definite q(v)>0 or negative-definite q(v)<0 condition, eigenvalue and Sylvester criteria, change of basis and congruence invariance, signature and inertia and distinction from semi and indefinite forms are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of linear algebra because they reuse the typed linear algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, A symmetric matrix represents the form; its eigenvalue signs, leading principal minors or completed-square decomposition show whether every nonzero direction has the same strict sign., and type the carrier, state every parameter and convention in the definition, test that the finite-dimensional real vector space, quadratic form q and associated symmetric bilinear form or matrix A, nonzero vectors, positive-definite q(v)>0 or negative-definite q(v)<0 condition, eigenvalue and Sylvester criteria, change of basis and congruence invariance, signature and inertia and distinction from semi and indefinite forms are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Definite quadratic form Domain-specific

Parents (1) — outgoing typed relations

Definite quadratic form is a kind of Invariance Prime

It remains its own entry because its identity is fixed by the finite-dimensional real vector space, quadratic form q and associated symmetric bilinear form or matrix A, nonzero vectors, positive-definite q(v)>0 or negative-definite q(v)<0 condition, eigenvalue and Sylvester criteria, change of basis and congruence invariance, signature and inertia and distinction from semi and indefinite forms.

Hierarchy path (1) — routes to 1 parentless root

Definite quadratic form → is a kind of Invariance

Neighborhood in Abstraction Space¶

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

Family — Structured Matrices & Linear Maps (43 abstractions)

Nearest neighbors

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