S-procedure¶
The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality.
Core Idea¶
S-procedure is treated here as the recurring control theory identity summarized by this source-grounded definition: The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality.
The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization. Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds.
Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0. holds if and only if there exists some nonnegative number λ such that.
For S-procedure, the abstraction is narrower than the article's general subject matter: a positive case must preserve The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in control theory, which is why this identity is domain-specific rather than prime.
Structural Signature¶
Sig role-phrases:
- Defining carrier — Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers.
- Constitutive relation — Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds.
- Operating condition — x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0.
- Recognition evidence — holds if and only if there exists some nonnegative number λ such that.
- Admissible variation — \lambda \begin{bmatrix} F_1 & g_1 \ g_1^T & h_1 \end{bmatrix} - \begin{bmatrix} F_2 & g_2 \ g_2^T & h_2 \end{bmatrix}.
- Characteristic consequence — The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality.
- Failure boundary — The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization.
What It Is Not¶
- Not the whole field of control theory. The node requires the specific identity stated by The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality.
- Not an over-broad reading. The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization.
- Not an over-broad reading. Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers.
- Not an over-broad reading. Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds.
- Not automatically Linear matrix inequality. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.
Scope of Application¶
S-procedure applies literally inside control theory wherever the source-defined carrier and relation can be established. Its documented habitats include:
- Documented setting. The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization.
- Statement of the S-procedure. Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers.
- Statement of the S-procedure. Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds.
- Statement of the S-procedure. x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0.
- Statement of the S-procedure. holds if and only if there exists some nonnegative number λ such that.
- Statement of the S-procedure. \lambda \begin{bmatrix} F_1 & g_1 \ g_1^T & h_1 \end{bmatrix} - \begin{bmatrix} F_2 & g_2 \ g_2^T & h_2 \end{bmatrix}.
Outside control theory, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.
Clarity¶
A clear use of S-procedure names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. The strongest recognition evidence in the frozen account is: holds if and only if there exists some nonnegative number λ such that. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization. so that a reader can reproduce the classification rather than infer it from topical resemblance.
Manages Complexity¶
S-procedure compresses multiple control theory details into a stable diagnostic relation. The source shows both the central mechanism—assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds.—and the practical consequence—the S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.
Abstract Reasoning¶
- Type the carrier. Identify the control theory entities to which the claim applies.
- State the relation. Use the source-grounded identity: The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality.
- Check operation and conditions. x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0.
- Demand recognition evidence. holds if and only if there exists some nonnegative number λ such that.
- Test variation. Change an implementation or setting while preserving \lambda \begin{bmatrix} F_1 & g_1 \ g_1^T & h_1 \end{bmatrix} - \begin{bmatrix} F_2 & g_2 \ g_2^T & h_2 \end{bmatrix}.
- Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
- Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.
Knowledge Transfer¶
Within the home domain. Knowledge about S-procedure transfers literally when a new case preserves the same carrier type, relation, and recognition test. The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization. Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers.
Beyond the home domain. No canonical parent is asserted for S-procedure. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.
Examples¶
Canonical¶
Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.
Mapped back: carrier → the entities in the documented case; operation → The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality; recognition evidence → holds if and only if there exists some nonnegative number λ such that
Applied / In Practice¶
Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.
Mapped back: changed setting → Statement of the S-procedure; invariant → The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality; boundary → the case exits the class when the S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization
Structural Tensions¶
T1 — Stable identity versus admissible variation. The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: Which changes preserve the defining relation, and which replace it?
T2 — Recognition versus proxy. Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: Does the cited evidence establish the identity or only a correlated sign?
T3 — Definition versus implementation. Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: Is the observed implementation constitutive, optional, or merely common?
T4 — Scope versus overextension. x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: Can every claimed application fill the same typed roles without metaphor?
T5 — Transfer versus domain accent. Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: Does the receiving case instantiate S-procedure literally, co-instantiate Pattern, or only resemble it?
T6 — Autonomy versus reduction. Assume that there is some x 0 such that the strict inequality x_0^T F_1 x_0 + 2g_1^T x_0 + h_1 holds. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.
Diagnostic: What does S-procedure distinguish that the broader parent Pattern leaves together?
Structural–Framed Character¶
S-procedure is mixed or framed-leaning. Its structural side is the repeatable organization summarized by The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. Its framed side is the control theory vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.
Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: x^T F_1 x + 2g_1^T x + h_1 \le 0 \Longrightarrow x^T F_2 x + 2g_2^T x + h_2 \le 0. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.
Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.
Structural Core vs. Domain Accent¶
What is skeletal. The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. Assume that there is some x 0 such that the strict inequality x0^T F1 x0 + 2g1^T x0 + h1 holds. It further constrains recognition and variation through: x^T F1 x + 2g1^T x + h1 \le 0 \Longrightarrow x^T F2 x + 2g2^T x + h2 \le 0. holds if and only if there exists some nonnegative number λ such that.
What is domain-bound. control theory supplies the operative entities, technical vocabulary, warrants, and exceptions that make S-procedure literal. Its documented scope includes the condition that The S-procedure was developed independently in a number of different contexts and has applications in control theory, linear algebra and mathematical optimization. Another bounded application condition is that Let F 1 and F 2 be symmetric matrices, g 1 and g 2 be vectors and h 1 and h 2 be real numbers. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.
Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—\lambda \begin{bmatrix} F1 & g1 \ g1^T & h1 \end{bmatrix} - \begin{bmatrix} F2 & g2 \ g2^T & h2 \end{bmatrix}.—and future graph densification may discover a defensible relation only if it preserves that boundary.
Instantiates / Related Primes¶
- Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for S-procedure. The reviewed identity is: The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
- Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.
Neighborhood in Abstraction Space¶
S-procedure sits in a crowded region of the domain-specific corpus (19th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Unclustered & Miscellaneous (2551 abstractions)
Nearest neighbors
- Hat matrix — 0.91
- Filling radius — 0.91
- Single Vegetative Obstruction Model — 0.90
- p-Variation — 0.90
- Big O in probability notation — 0.90
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- Pattern. The parent omits the specialist differentia. Tell: Can the case establish The S-procedure or S-lemma is a mathematical result that gives conditions under which a particular quadratic inequality is a consequence of another quadratic inequality?
- Linear matrix inequality. A convex constraint requiring an affine combination of symmetric or Hermitian matrices to be positive semidefinite. Tell: Which entry's carrier, operation, and failure condition are satisfied?
- Symmetric Successive Over-Relaxation. A paired forward–backward relaxed Gauss–Seidel scheme whose symmetric factorization is widely used as a preconditioner for sparse linear systems. Tell: Which entry's carrier, operation, and failure condition are satisfied?
- S2P (complexity). S2P (complexity) denotes complexity class in mathematics, logic, and statistics. Tell: Which entry's carrier, operation, and failure condition are satisfied?
- A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would S-procedure remain present if the detector or downstream effect changed?
- A metaphorical analogue. A similar shape outside control theory lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/S-procedure (revision 1326170207).
- Preserved source candidate: https://dx.doi.org/10.1016/0024-3795(79)90020-X
- Preserved source candidate: https://dx.doi.org/10.1137/S003614450444614X
- Preserved source candidate: https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
- Preserved source candidate: http://en.wikipedia.org/wiki/Wikipedia:Footnotes
The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.