Kalman–Yakubovich–Popov lemma¶

A theorem equating a frequency-domain positivity condition for a linear system with existence of a state-space quadratic certificate.

Version: v2 · 2026-09-19 · History
Domain-specific #: 5173
Domain group: Interdisciplinary & Synthetic
Origin domain: Systems Thinking & Cybernetics
Subdomain: Control Theory → Systems Thinking & Cybernetics
Aliases: KYP lemma

Core Idea¶

Multiple strict nonstrict discrete-time and matrix-valued forms exist, controllability detectability and Hurwitz assumptions depend on the version and it is a mathematical equivalence rather than a controller-tuning recipe. A transfer-function inequality over all frequencies is converted into a Lyapunov or linear-matrix equation or inequality with a symmetric storage matrix, linking input-output positivity to dissipativity and stability in state space. 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…

No faithful explanation at this level. A five-year-old version turns an exact equivalence between a frequency-by-frequency test and a stored-energy matrix condition into a vague 'trick for making machines behave', which is the controller-tuning-recipe misconception.

Two Checks That Agree

The Kalman–Yakubovich–Popov lemma is a math fact used by people who study systems like machines and circuits. It says that, for a certain simple kind of system and under certain conditions, two very different-looking checks give the same answer. One check tests how the system responds to every possible speed of wiggling input. The other check looks for a special matrix that acts like a hidden energy store inside the system. It isn't a recipe for building a controller; it's a bridge that lets you swap one check for the other.

Frequency-to-Matrix Equivalence

The Kalman–Yakubovich–Popov (KYP) lemma is an equivalence for linear time-invariant systems described by state-space matrices. It turns an inequality on the transfer function that must hold at all frequencies into an equation or inequality involving a symmetric matrix P, of the Lyapunov or linear-matrix-inequality type. Interpreted physically, P defines a storage function, so the lemma links input-output positivity (the system never generates net energy) to dissipativity and stability in state space. There are several versions: strict and nonstrict, continuous and discrete time, matrix-valued, each needing its own assumptions such as stability, controllability, or minimality. It is a mathematical equivalence, not a method for tuning controllers, and it only applies when its assumptions are checked.

The Kalman–Yakubovich–Popov lemma establishes, for continuous- or discrete-time linear time-invariant state-space systems (A, B, C, D), an equivalence between a frequency-domain inequality on the transfer function over all frequencies and the solvability of a Lyapunov-type linear matrix equation or inequality in a symmetric matrix P, often with auxiliary factors. The matrix P defines a quadratic storage function, so the lemma links input-output positivity (positive-realness) to dissipativity and stability in state space. There are multiple forms: strict and nonstrict, continuous and discrete, scalar and matrix-valued. Which assumptions apply, such as controllability, minimality, detectability, or Hurwitz stability, depends on the version, as do the directions of the equivalence. Correct use requires declaring the system class, the assumptions, the specific inequality, and whether the strict or nonstrict form is meant. It is a mathematical equivalence used to convert frequency conditions into LMIs, not a controller-tuning recipe, and applying it outside its stated assumptions is a common error.

Scope of Application¶

Kalman–Yakubovich–Popov lemma belongs to control theory and is useful where the analyst can specify the typed control theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the continuous or discrete linear time-invariant state-space matrices, stability and controllability or minimality assumptions, frequency-domain transfer expression and positivity inequality, symmetric matrix P and auxiliary factors, Lyapunov or LMI relation, strict or nonstrict version, storage function and dissipativity or positive-real interpretation and equivalence directions are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the continuous or discrete linear time-invariant state-space matrices, stability and controllability or minimality assumptions, frequency-domain transfer expression and positivity inequality, symmetric matrix P and auxiliary factors, Lyapunov or LMI relation, strict or nonstrict version, storage function and dissipativity or positive-real interpretation and equivalence directions 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 Kalman–Yakubovich–Popov lemma. Kalman–Yakubovich–Popov lemma 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 control theory 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 continuous or discrete linear time-invariant state-space matrices, stability and controllability or minimality assumptions, frequency-domain transfer expression and positivity inequality, symmetric matrix P and auxiliary factors, Lyapunov or LMI relation, strict or nonstrict version, storage function and dissipativity or positive-real interpretation and equivalence directions are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of control theory because they reuse the typed control theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, A transfer-function inequality over all frequencies is converted into a Lyapunov or linear-matrix equation or inequality with a symmetric storage matrix, linking input-output positivity to dissipativity and stability in state space., and type the carrier, state every parameter and convention in the definition, test that the continuous or discrete linear time-invariant state-space matrices, stability and controllability or minimality assumptions, frequency-domain transfer expression and positivity inequality, symmetric matrix P and auxiliary factors, Lyapunov or LMI relation, strict or nonstrict version, storage function and dissipativity or positive-real interpretation and equivalence directions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Kalman–Yakubovich–Popov lemma Domain-specific

Parents (1) — outgoing typed relations

Kalman–Yakubovich–Popov lemma is a kind of Verification Prime

It remains its own entry because its identity is fixed by the continuous or discrete linear time-invariant state-space matrices, stability and controllability or minimality assumptions, frequency-domain transfer expression and positivity inequality, symmetric matrix P and auxiliary factors, Lyapunov or LMI relation, strict or nonstrict version, storage function and dissipativity or positive-real interpretation and equivalence directions.

Hierarchy path (1) — routes to 1 parentless root

Kalman–Yakubovich–Popov lemma → is a kind of Verification → is a kind of Evaluation → presupposes Comparison

Neighborhood in Abstraction Space¶

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

Family — Nonlinear & Optimal Control Design (14 abstractions)

Nearest neighbors

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