Skip to content

Convexity

Version
v1 · 2026-08-24 · History
Prime #
750
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Optimization → Mathematics

Core Idea

A set is convex when the straight line between any two members stays inside it; a function is convex when the chord between two points on its graph lies on or above the graph. Both express one shape: mixtures preserve membership, and the average of values dominates the value of the average — from which an unusual number of well-behaved properties follow.

How would you explain it like I'm…

The Marble Bowl

Imagine a blob of clay with no dents or caves in it. If you pick any two spots inside the blob and draw a straight line between them, the whole line stays inside. A blob like that is 'easy' clay: roll downhill from anywhere and you always end up at the very lowest spot, never getting stuck in a little dip.

The Smiling Bowl

A shape is convex if you can pick any two dots inside it, draw a straight line between them, and the whole line stays inside — no dents or notches. A bouncy ball is convex; a banana or a star is not. For a curve drawn on paper, convex means it sags like a smiling mouth: if you connect any two points on it with a string, the string never dips below the curve. The neat payoff is that bowl-shaped things have just one lowest point, so rolling downhill always finds it.

Chord Above the Graph

Convexity comes in two matching flavours. A set is convex when the straight line between any two of its members stays entirely inside it. A function is convex when the straight chord connecting any two points on its graph never dips below the graph, so the curve is bowl-shaped. Both say the same thing: blending two things you have always gives you a thing you can have, and the average of two values is at least as big as the value at the average point. The payoff is that a convex problem has no fake bottoms, so a local minimum is automatically the global minimum, which is exactly the trap that non-convex problems set.

 

Convexity is a single second-order condition with outsized consequences. For a set, convexity means closure under mixtures: every convex combination of members is itself a member. For a function, it means the chord between any two graph points lies on or above the graph, equivalently that the average of the values dominates the value of the average (Jensen's inequality). From this one algebraic shape an unusual cluster of well-behaved properties falls out for free. Local minima coincide with global minima, so greedy and gradient methods converge to the true optimum regardless of starting point. Any point outside a convex set can be cleanly separated from it by a hyperplane, which yields checkable certificates of optimality and impossibility. And convex combinations of feasible plans stay feasible, so averaging, pooling, and diversification never violate constraints. These properties show up in optimization, economics, statistics, and physics alike, because they depend only on the shape, not the substrate.

Broad Use

  • Optimization: convex sets and functions are the dividing line between tractable and intractable problems.
  • Economics: convex preferences and production sets underlie general-equilibrium existence; risk-aversion is convexity of disutility.
  • Statistics and ML: concave log-likelihoods make maximum-likelihood convex, and convex relaxations (LP, Lasso, nuclear norm) make hard tasks tractable.
  • Probability: the set of distributions is convex, and Jensen's inequality is the canonical bound behind many results.
  • Decision theory: utilitarian aggregation, mixed strategies, and veil-of-ignorance arguments all use convex combinations.
  • Engineering and physics: Lyapunov functions are convex stability certificates; thermodynamic free energy is convex in extensive variables.

Clarity

Relocates the question of difficulty from "is the data noisy?" to a structural property of the feasible set and objective — once a problem is seen as convex, the local-versus-global distinction collapses and "stuck in a local optimum" stops being a worry.

Manages Complexity

Converts a global question ("is this the best solution anywhere?") into a local one ("does any nearby direction improve?"), answerable by inspection at a single point — the hard accounting of trajectories and competing basins replaced by one shape check.

Abstract Reasoning

Unlocks reusable templates: Jensen's inequality (source of AM–GM, entropy bounds, risk premia), the separating hyperplane (dual certificates, Farkas, supporting prices), the convex hull as feasibility envelope, Carathéodory's bound, and convex relaxation.

Knowledge Transfer

  • Optimization → policy: "local incentives reach a global optimum when the welfare function is concave" tells when decentralized markets succeed.
  • Statistics → diagnosis: "this objective is non-convex" warns that estimation is sensitive to initialization, in econometrics and deep learning alike.
  • Thermodynamics → economics: the common-tangent construction resolving a non-convex free energy is the same convexification turning a non-convex production set into two-firm specialization.

Example

Minimizing portfolio variance over the probability simplex is convex (any mixture of two allocations is an allocation), so the optimum is unique and found by any gradient method regardless of starting point, with dual prices on the constraints.

Relationships to Other Abstractions

Local relationship map for ConvexityParents 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.ConvexityPRIMEPrime abstraction: Optimization — presupposesOptimizationPRIMEDomain-specific abstraction: Log-Sum Inequality — presupposesLog-SumInequalityDOMAINDomain-specific abstraction: Normal Cone — presupposesNormal ConeDOMAINDomain-specific abstraction: 0/1-polytope — is a kind of0/1-polytopeDOMAINDomain-specific abstraction: Convex body — is a kind ofConvex bodyDOMAINDomain-specific abstraction: Convex hull — is a kind ofConvex hullDOMAINDomain-specific abstraction: Gauss–Lucas theorem — is a kind ofGauss–LucastheoremDOMAINDomain-specific abstraction: Geodesic convexity — is a kind ofGeodesicconvexityDOMAINDomain-specific abstraction: Hadamard space — is a kind ofHadamard spaceDOMAINDomain-specific abstraction: Mazur's lemma — is a kind ofMazur's lemmaDOMAINDomain-specific abstraction: Non-convexity (economics) — is a kind ofNon-convexity(economics)DOMAINDomain-specific abstraction: Proper Convex Function — is a kind ofProper ConvexFunctionDOMAINDomain-specific abstraction: Quasiconvex Function — is a kind ofQuasiconvexFunctionDOMAIN+2 more

Current abstraction Convexity Prime

Parents (1) — outgoing typed relations

  • Convexity presupposes Optimization Prime

    Convexity presupposes Optimization, whose structure must already obtain for the child mechanism to be meaningful or operational.

Children (14) — abstractions linked here by typed relations

  • 0/1-polytope Domain-specific is a kind of Convexity

    It remains its own entry because its identity is fixed by the ambient dimension, selected binary vectors, convex-hull definition, affine hull and dimension, vertex minimality, facet inequalities, symmetry and any simple or full-dimensional qualification.

  • Convex body Domain-specific is a kind of Convexity

    A convex body is exactly a case where the convexity mixture property holds, restricted to a compact, full-dimensional Euclidean set.

  • Convex hull Domain-specific is a kind of Convexity

    What makes it its own entry: the domain-specific identity determined by the ambient affine space and scalar field are fixed and the result both contains the source set and is minimal among convex containing sets.

  • Gauss–Lucas theorem Domain-specific is a kind of Convexity

    The conclusion is containment in the convex hull of source roots.

  • Geodesic convexity Domain-specific is a kind of Convexity

    What makes it its own entry: Global uniqueness can fail on manifolds with cut loci, so weak, strong, and local geodesic-convexity conventions must not be conflated.

Hierarchy path (1) — routes to 1 parentless root

Not to Be Confused With

  • Convexity is not Optimization because optimization is the activity of finding a best feasible point, whereas convexity is a structural property of the set and objective that guarantees the search succeeds globally.
  • Convexity is not Linearity because linearity demands the chord lie on the graph (equality), whereas convexity demands only on or above (inequality) — admitting curvature like diminishing returns that linearity forbids.
  • Convexity is not Pareto Efficiency because Pareto efficiency is a property of an outcome, whereas convexity is a property of the feasible region's shape — a convex set makes the frontier well-behaved, but the two are distinct.