Skip to content

Subderivative

A supporting slope or covector that generalizes the derivative of a convex function at a point where an ordinary derivative may not exist.

Version
v1 · 2026-09-08 · History
Domain-specific #
6965
Origin domain
convex analysis
Subdomain
convex analysis

Core Idea

A covector g is a subderivative of convex f at x when f(y) is at least f(x)+ for every y in the domain.[1] Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton. 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 convex analysis. It is Generalized derivatives outside convex analysis may obey different local definitions; the autonomous residual here is the convex supporting-hyperplane relation.. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the global supporting inequality holds for every admissible comparison point 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 global supporting inequality holds for every admissible comparison point. 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 global supporting inequality holds for every admissible comparison point, 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 Subderivative, 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: a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential
  • Inputs or antecedent state: the exact convex analysis carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Subderivative
  • Constitutive operation: Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton.
  • Invariant: the global supporting inequality holds for every admissible comparison point
  • Recognition test: type the carrier, state every parameter and convention in the definition, test that the global supporting inequality holds for every admissible comparison point, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
  • Output or consequence: recognizing and comparing instances of Subderivative, 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 global supporting inequality holds for every admissible comparison point 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 convex analysis. The field contains many questions and methods that do not instantiate Subderivative.
  • It is not its most familiar example. At zero, the absolute-value function has every slope in [-1,1] as a subderivative. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
  • It is not the neighboring catalog concept Directional derivative. A directional derivative is a rate in a chosen direction; a subderivative is a dual vector satisfying a simultaneous global support inequality.
  • 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 Subderivative must control the decision
  • It is not an unrestricted metaphor for any process that seems similar. Outside convex analysis, the vocabulary and validity conditions do not transfer literally.

Scope of Application

Subderivative belongs to convex analysis and is useful where the analyst can specify a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential, then evaluate the global supporting inequality holds for every admissible comparison point. The scope is broad within that domain but bounded by the need for the global supporting inequality holds for every admissible comparison point. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.[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 convex analysis carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Subderivative are converted, constrained, or organized by Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton..
  • 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 Subderivative 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 Subderivative, 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 global supporting inequality holds for every admissible comparison point 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 Subderivative 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 convex analysis carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Subderivative, the structure counts as Subderivative exactly when the global supporting inequality holds for every admissible comparison point.

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 Subderivative. Subderivative 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 Subderivative. 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

  1. Identify the carrier. State what the elements, states, objects, or observations are: a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the global supporting inequality holds for every admissible comparison point independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
  3. Derive consequences. From the global supporting inequality holds for every admissible comparison point, infer recognizing and comparing instances of Subderivative, 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.
  4. Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Subderivative must control the decision and an object that resembles Subderivative 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.
  5. 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 convex analysis because they reuse a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential, Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton., and type the carrier, state every parameter and convention in the definition, test that the global supporting inequality holds for every admissible comparison point, 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 At zero, the absolute-value function has every slope in [-1,1] as a subderivative. to A nonsmooth convex objective is optimal at a point when its subdifferential contains zero under the usual qualification..[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Subderivative, 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

At zero, the absolute-value function has every slope in [-1,1] as a subderivative. The example exposes the carrier and directly tests that the global supporting inequality holds for every admissible comparison point; 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 a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential; the operative rule is Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton.; the invariant is the global supporting inequality holds for every admissible comparison point; and the result supports recognizing and comparing instances of Subderivative, 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 global supporting inequality holds for every admissible comparison point destroys the classification.

Mapped back: a proper convex function, a point in its domain, an ambient vector space and dual pairing, supporting affine minorants, and the subdifferential → Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton. → the global supporting inequality holds for every admissible comparison point → recognizing and comparing instances of Subderivative, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice

A nonsmooth convex objective is optimal at a point when its subdifferential contains zero under the usual qualification. 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 global supporting inequality holds for every admissible comparison point, 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 global supporting inequality holds for every admissible comparison point 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 Subderivative, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Subderivative, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from convex analysis 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, Each qualifying covector defines an affine support below the graph; all such covectors form the convex subdifferential and reduce to the ordinary gradient when differentiability makes it a singleton., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Subderivative, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Subderivative, 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 convex analysis.

The proposed strict upward parent is prime:approximation. prime:approximation supplies the nearest cross-domain structural operation, while Subderivative retains a constitutive identity specific to convex analysis. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Subderivative adds domain-specific constraints.

The entry does not collapse into that parent because Generalized derivatives outside convex analysis may obey different local definitions; the autonomous residual here is the convex supporting-hyperplane relation. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Subderivative. 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:approximation. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for SubderivativeParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.SubderivativeDOMAINPrime abstraction: Approximation — is a kind ofApproximationPRIME

Current abstraction Subderivative Domain-specific

Parents (1) — more general patterns this builds on

  • Subderivative is a kind of Approximation Prime

    The proposed strict upward parent is prime:approximation.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

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

Family — Nonsmooth Analysis & Operator Methods (8 abstractions)

Nearest neighbors

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

Not to Be Confused With

  • Directional derivative. A directional derivative is a rate in a chosen direction; a subderivative is a dual vector satisfying a simultaneous global support inequality.
  • One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
  • Measurement or implementation of Subderivative. A proxy or realization is evidence for the abstraction, not the abstraction itself.
  • Generalized Subderivative. An extension qualifies only when its changed axioms and retained invariant are stated.

References

[1] R. T Rockafellar, 'Convex Analysis', Princeton University Press, 1970. registry ↩a ↩b

[2] Claude Lemaréchal, Jean-Baptiste Hiriart-Urruty, 'Fundamentals of Convex Analysis', Springer-Verlag Berlin Heidelberg, 2001. registry ↩a ↩b

[3] Frank H Clarke, 'Optimization and nonsmooth analysis', John Wiley & Sons, 1983. registry