Hautus lemma¶

A rank-test lemma characterizing controllability, observability, stabilizability, and detectability of linear time-invariant state-space systems at eigenvalues.

Version: v1 · 2026-09-08 · History
Domain-specific #: 4834
Origin domain: linear control theory
Subdomain: linear control theory

Core Idea¶

The Popov–Belevitch–Hautus tests state system properties through full-rank block matrices such as [λI−A,B] or their observability transpose forms.^[1] An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition. 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.

The load-bearing residual is not the broad topic of linear control theory. It is the domain-specific identity determined by the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

Structural Signature¶

Carrier: the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact linear control theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Hautus lemma
Constitutive operation: An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition.
Invariant: the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent
Recognition test: type the carrier, state every parameter and convention in the definition, test that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of linear control theory. The field contains many questions and methods that do not instantiate Hautus lemma.
It is not its most familiar example. A canonical instance directly demonstrates that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Controllability matrix test. The Kalman controllability matrix uses powers of A; the Hautus test evaluates rank at spectral parameters and extends directly to stabilizability conditions.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Hautus lemma must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside linear control theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Hautus lemma belongs to linear control theory and is useful where the analyst can specify the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. The scope is broad within that domain but bounded by the need for the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. Conceptual linear-systems theorem only; safety-critical control design requires validated models and qualified engineering review.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact linear control theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Hautus lemma are converted, constrained, or organized by An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Hautus lemma must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent 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 Hautus lemma can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact linear control theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Hautus lemma, the structure counts as Hautus lemma exactly when the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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 Hautus lemma. Hautus 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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Hautus lemma. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent, infer recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Hautus lemma must control the decision and an object that resembles Hautus lemma in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of linear control theory because they reuse the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition., and type the carrier, state every parameter and convention in the definition, test that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Hautus lemma, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent. The example exposes the carrier and directly tests that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition.; the invariant is the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent; and the result supports recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent destroys the classification.

Mapped back: the typed linear control theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition. → the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent → recognizing and comparing instances of Hautus lemma, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Hautus lemma, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Hautus lemma, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from linear control theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, An uncontrollable or unobservable eigenmode produces a left or right eigenvector annihilated by the input or output map; excluding such vectors is equivalent to the rank condition., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Hautus lemma, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Hautus lemma, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in linear control theory.

The proposed strict upward parent is prime:verification. prime:verification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hautus lemma adds domain-specific constraints.

The entry does not collapse into that parent because the domain-specific identity determined by the system matrices, field, eigenvalue range, and exact full-rank condition corresponding to the claimed control property are stated and equivalent It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hautus lemma. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge.

The prospective workspace queue contains one strict upward edge to prime:verification. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Hautus lemma Domain-specific

Parents (1) — more general patterns this builds on

Hautus lemma is a kind of Verification Prime

The proposed strict upward parent is prime:verification.

Hierarchy path (1) — routes to 1 parentless root

Hautus lemma → Verification → Evaluation → Comparison → Self Checking

Neighborhood in Abstraction Space¶

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

Family — Feedback Control & Dynamical Systems (29 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Controllability matrix test. The Kalman controllability matrix uses powers of A; the Hautus test evaluates rank at spectral parameters and extends directly to stabilizability conditions.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Hautus lemma. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Hautus lemma. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Joao Hespanha, 'Linear Systems Theory', Princeton University Press, 2018. registry ↩a ↩b

[2] Dennis S Bernstein, 'Scalar, Vector, and Matrix Mathematics: Theory, Facts, and Formulas', Princeton University Press, 2018. registry ↩a ↩b

[3] Vasile Mihai Popov, 'Hiperstabilitatea sistemelor automate', Editura Academiei Republicii Socialiste România, 1966. registry ↩