Olech theorem
theorem giving sufficient conditions for global asymptotic stability of a two-equation system of non-linear differential equations

In dynamical systems theory, the Olech theorem establishes sufficient conditions for global asymptotic stability of a two-equation system of non-linear differential equations. The result was established by Czesław Olech in 1963, based on joint work with Philip Hartman.
Theorem
The differential equations
x
˙
=
f
(
x
)
{\displaystyle \mathbf {\dot {x}} =f(\mathbf {x} )}
,
x
=
[
x
1
x
2
]
T
∈
R
2
{\displaystyle \mathbf {x} =[x_{1}\,x_{2}]^{\mathsf {T}}\in \mathbb {R} ^{2}}
, where
f
(
x
)
=
[
f
1
(
x
)
f
2
(
x
)
]
T
{\displaystyle f(\mathbf {x} )={\begin{bmatrix}f^{1}(\mathbf {x} )&f^{2}(\mathbf {x} )\end{bmatrix}}^{\mathsf {T}}}
, for which
x
∗
=
0
{\displaystyle \mathbf {x} ^{\ast }=\mathbf {0} }
is an equilibrium point, is uniformly globally asymptotically stable if:
(a) the trace of the Jacobian matrix is negative,
tr
J
f
(
x
)
<
0
{\displaystyle \operatorname {tr} \mathbf {J} _{f}(\mathbf {x} )<0}
for all
x
∈
R
2
{\displaystyle \mathbf {x} \in \mathbb {R} ^{2}}
,
(b) the Jacobian determinant is positive,
|
J
f
(
x
)
|
>
0
{\displaystyle \left|\mathbf {J} _{f}(\mathbf {x} )\right|>0}
for all
x
∈
R
2
{\displaystyle \mathbf {x} \in \mathbb {R} ^{2}}
, and
(c) the system is coupled everywhere with either
∂
f
1
∂
x
1
∂
f
2
∂
x
2
≠
0
,
or
∂
f
1
∂
x
2
∂
f
2
∂
x
1
≠
0
for all
x
∈
R
2
.
Begin with the source’s own compact description: “Olech theorem” is theorem giving sufficient conditions for global asymptotic stability of a two-equation system of non-linear differential equations. The dossier treats that line as a proposition to test through Olech, theorem and giving, not as a finished interpretation.
Why this record matters
The phrase “theorem giving sufficient conditions for global asymptotic stability of a two-equation system of non-linear differential equations” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Jun 14, 2024. The linked authority identifier is Q42417350. The first chronological checks are 1963.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Olech theorem”, its source revision and the description used here.
- Expand the search: follow Olech theorem primary sources, Olech theorem archive and Olech research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Olech theorem”?
- Which institution is responsible for the underlying evidence?
- Which cited source is closest to the event, object or claim?
Search terms from this dossier
This entry incorporates text from “Olech theorem” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.