Skip to content

Convex conjugate

The supremum transform mapping an extended-real function on a vector space to the greatest affine lower-bound gap over its dual space.

Version
v1 · 2026-09-08 · History
Domain-specific #
3903
Origin domain
convex analysis
Subdomain
convex analysis
Aliases
Legendre–Fenchel transform, Fenchel conjugate

Core Idea

For f, its Fenchel conjugate f-star at a dual vector is the supremum of the dual pairing minus f; the result is convex and lower semicontinuous even when f is not. Every primal point supplies an affine function on the dual, their pointwise supremum forms the conjugate and repeating the transform yields the closed convex envelope under Fenchel-Moreau hypotheses. 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.

Scope of Application

Convex conjugate belongs to convex analysis and is useful where the analyst can specify the typed convex analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the real vector space and topology, continuous dual and pairing, extended-real function and properness, supremum domain, conjugate convention, lower-semicontinuity and convexity, biconjugate hypotheses and equality cases are explicit. The scope is broad within that domain but bounded by the need for the real vector space and topology, continuous dual and pairing, extended-real function and properness, supremum domain, conjugate convention, lower-semicontinuity and convexity, biconjugate hypotheses and equality cases are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the real vector space and topology, continuous dual and pairing, extended-real function and properness, supremum domain, conjugate convention, lower-semicontinuity and convexity, biconjugate hypotheses and equality cases are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

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 Convex conjugate. Convex conjugate 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.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: the typed convex analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the real vector space and topology, continuous dual and pairing, extended-real function and properness, supremum domain, conjugate convention, lower-semicontinuity and convexity, biconjugate hypotheses and equality cases are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of convex analysis because they reuse the typed convex analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Every primal point supplies an affine function on the dual, their pointwise supremum forms the conjugate and repeating the transform yields the closed convex envelope under Fenchel-Moreau hypotheses., and type the carrier, state every parameter and convention in the definition, test that the real vector space and topology, continuous dual and pairing, extended-real function and properness, supremum domain, conjugate convention, lower-semicontinuity and convexity, biconjugate hypotheses and equality cases are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Convex conjugateParents 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.Convex conjugateDOMAINPrime abstraction: Duality — is a kind ofDualityPRIME

Current abstraction Convex conjugate Domain-specific

Parents (1) — more general patterns this builds on

  • Convex conjugate is a kind of Duality Prime

    The proposed strict upward parent is prime:duality.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

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

Family — Functional Analysis & Normed Spaces (33 abstractions)

Nearest neighbors

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