Bauer Maximum Principle

A convex upper-semicontinuous function on a nonempty compact convex set attains its maximum at an extreme point.

Version

v2 · 2026-09-06 · History

Domain-specific #

1354

Origin domain

mathematics

Subdomain

convex analysis

Aliases

Bauer's maximum principle, Bauer maximum theorem

Core Idea

The Bauer maximum principle states that a convex upper-semicontinuous real-valued function on a nonempty compact convex subset of a locally convex Hausdorff topological vector space attains its maximum at an extreme point. A common elementary statement assumes continuity, which is stronger than upper semicontinuity.

The recognition invariant is compact convex feasible set + convex objective + upper-semicontinuity + maximum witnessed at an extreme point.

Scope of Application

The principle reduces convex maximization over compact convex sets to extreme points in functional analysis, moment problems, probability measures, differential equations, and mathematical economics. For a polytope it recovers the familiar fact that a linear objective has an optimal vertex, while also covering nonpolyhedral and infinite-dimensional settings under the stated hypotheses.

Clarity

An extreme point cannot be written as a nontrivial convex combination of two distinct points of \(K\). It need not be topologically isolated. Compactness, convexity, objective convexity, and upper semicontinuity perform different jobs; dropping one requires a separate theorem or counterexample.

Manages Complexity

The result replaces a search over every feasible point with an existence claim on the extreme boundary. It does not necessarily make computation finite: a compact convex set can have infinitely many extreme points and identifying them may be difficult.

Abstract Reasoning

1. Fix the ambient locally convex topology.
2. Verify that the feasible set is nonempty, compact, and convex.
3. Verify objective convexity and upper semicontinuity.
4. Establish that a maximum is attained.
5. If a maximizer is not extreme, decompose it into a nontrivial segment.
6. Use convexity to move to an endpoint without lowering the objective.
7. Continue with an extreme-point argument justified by compact convex structure.
8. Report existence separately from uniqueness or computability.

Knowledge Transfer

The portable structure is relocating an optimum from a convex bulk to an indecomposable boundary witness. The proposed immediate parent is Optimization.

Relationships to Other Abstractions

Current abstraction Bauer Maximum Principle Domain-specific

Parents (1) — more general patterns this builds on

• Bauer Maximum Principle is a kind of Optimization Prime

  Optimization is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

• Bauer Maximum Principle → Optimization

Neighborhood in Abstraction Space

Bauer Maximum Principle sits in a sparse region of the domain-specific corpus (83^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Quasiconvex Function — 0.83
• Schauder Fixed-Point Theorem — 0.82
• Brauner space — 0.81
• Maximum Theorem — 0.80
• Grothendieck Space — 0.80

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