Proper Convex Function¶
An extended-real convex function whose effective domain is nonempty and which nowhere takes negative infinity, excluding the two degenerate functions that break convex-analytic operations.
Core Idea¶
A proper convex function is an extended-real-valued convex function that is finite somewhere and never equals negative infinity. With the minimization convention, write the effective domain as dom f = {x : f(x) < +infinity}. Properness says that this set is nonempty and that f(x) > -infinity everywhere. Equivalently, it excludes the identically positive-infinite function and every function attaining negative infinity.
The qualifier is not a synonym for convex. It is a domain-admissibility condition that makes extended-value notation useful without allowing its two destructive degeneracies. Positive infinity can encode exclusion from the feasible domain, while finite values retain ordinary objective information. Properness is therefore the gate through which many conjugacy, subdifferential, and optimization statements enter convex analysis.
Scope of Application¶
The abstraction belongs to convex analysis, variational analysis, optimization, monotone operator theory, and convex duality. It appears wherever constraints are folded into objectives through extended-real indicator functions. For a nonempty convex set C, the indicator delta_C equals zero on C and positive infinity outside; it is proper exactly when C is nonempty. This representation lets one state constrained minimization as unconstrained minimization of an extended-valued function.
Clarity¶
The fastest diagnostic is two questions. First, is f(x) finite for at least one x? Second, does f avoid negative infinity everywhere? If both answers are yes and convexity is already established, f is proper. The test explains why positive infinity is permitted: it marks exclusion from the effective domain. What is disallowed is having no finite point at all or using negative infinity as an attained objective value.
Manages Complexity¶
Extended values unify objectives and constraints. Instead of carrying “minimize g(x) subject to x in C” through every theorem, one studies g + delta_C. The effective domain records feasibility, addition intersects admissible domains, epigraphs encode value and feasibility geometrically, and conjugation converts the combined object into a dual representation.
Abstract Reasoning¶
Properness licenses controlled inferences. A proper convex function has a nonempty convex effective domain because convexity preserves finite-valued mixtures. It has at least one finite epigraph point. Its indicator-function examples correspond to nonempty convex sets. These claims follow directly from the recognition roles.
Other conclusions need additional hypotheses. Fenchel–Moreau recovery generally invokes properness together with lower semicontinuity and convexity. Existence of minimizers may require compact sublevel sets or coercivity.
Knowledge Transfer¶
Within convex analysis the role package transfers literally among finite-dimensional optimization, function spaces, optimal control, signal recovery, statistics, and economics. A loss function plus a regularizer plus indicator constraints can remain proper when their effective domains share a suitable finite point. The terminology, however, stays mathematical.
The broader transferable structure is a nondegeneracy gate: retain sentinel values that encode exclusion while banning states that erase the object. That portable intuition is already captured by catalog-level Constraint, Boundary, and Convexity.
Relationships to Other Abstractions¶
Current abstraction Proper Convex Function Domain-specific
Parents (1) — more general patterns this builds on
-
Proper Convex Function is a kind of Convexity Prime
Proper Convex Function is a strict specialization of
prime:convexity: every member carries the convex-function chord inequality, with additional extended-value admissibility conditions.
Hierarchy path (1) — routes to 1 parentless root
- Proper Convex Function → Convexity → Optimization
Neighborhood in Abstraction Space¶
Proper Convex Function sits in a sparse region of the domain-specific corpus (72nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Applied Linear & Special Functions (18 abstractions)
Nearest neighbors
- Schauder Fixed-Point Theorem — 0.88
- Spherical Design — 0.84
- Dispersion Function — 0.84
- Compact Operator — 0.83
- Remmert–Stein Theorem — 0.83
Computed from structural-signature embeddings · 2026-09-08