How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Bauer maximum principle
Statement
Assume the Axiom of Choice. Let be a nonempty compact convex subset of a locally convex Hausdorff real or complex topological vector space. Every upper-semicontinuous convex function attains its maximum at an extreme point of .
Facts & Assumptions
Given: AC, a locally convex Hausdorff real or complex TVS , a nonempty compact convex , and an upper-semicontinuous convex .
Upper semicontinuity means that each superlevel is closed (Upper semicontinuous real map on a topological space).
A singleton is a face exactly when its point is extreme (Extreme point and face).
Assuming HB, continuous dual functionals separate distinct points of a Hausdorff locally convex space by their real parts (The continuous dual separates points in a Hausdorff locally convex space).
In a compact space, every closed family with the finite-intersection property has nonempty intersection (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection).
Under AC, every nonempty poset whose chains have upper bounds has a maximal element (Zorn's lemma).
AC says every family of nonempty sets has a choice function (The Axiom of Choice).
AC supplies Hahn–Banach dominated extension (Hahn-Banach dominated extension theorem for real vector spaces).
Proof
For each put , which is closed by [F1]. Any finite subfamily has nonempty intersection: choose from its finite list an index at which the finitely many real values are largest, and the corresponding belongs to every listed ; the empty finite intersection is . Thus [F4] supplies , so is the maximum of on .
The maximizer set is nonempty and closed by [F1]. Call a subset -extremal when , for and , implies .
The set is -extremal. Indeed, if with , convexity and maximality give ; positivity of both coefficients and force .
Let be the nonempty closed -extremal subsets of , ordered by reverse inclusion. It is nonempty because .
An empty chain has upper bound . For a nonempty chain , every finite intersection is its inclusion-smallest listed member and hence nonempty. Because every member is closed in compact , [F4] makes nonempty and closed. If a strict convex combination lies in , extremality in every puts both endpoints in every , so is -extremal. Thus and is an upper bound in the reverse-inclusion order.
By [F5], with AC declared in [F6], has a maximal element , equivalently an inclusion-minimal nonempty closed -extremal subset of .
Suppose are distinct. By [F7], AC supplies HB, so [F3] gives a continuous for which has .
Apply the finite-intersection argument of step 1.1 to the continuous real function : its superlevels in are closed in because is closed and is continuous, and the family indexed by has the finite-intersection property. Hence has a maximum on , and is nonempty and closed in . It is proper because .
The set is -extremal: if with and , extremality of first gives ; linearity yields while , so positivity forces and . Thus is a proper subset of , contradicting minimality.
Therefore for some . Since this singleton is -extremal, it satisfies the singleton face condition in [F2], so is extreme in ; and gives .
The preceding maximum and extremality argument constructs a nonempty closed extremal maximizer set, the Zorn argument produces a minimal one, and the separating-functional argument proves it is a singleton consisting of the required extreme maximizer.
Remarks
The maximizer set need not be convex: for on it is . The proof therefore does not apply Krein–Milman to that set; it uses closed -extremal subsets, exactly as the endpoint calculation above requires.
Depends on
- Extreme point and face
- The continuous dual separates points in a Hausdorff locally convex space
- A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection
- Zorn's lemma
- The Axiom of Choice
- Hahn-Banach dominated extension theorem for real vector spaces
- Upper semicontinuous real map on a topological space
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ian Ball, Bauer’s Maximum Principle for Quasiconvex Functions (standard reference, not scraped)
- Bühler–Salamon, Functional Analysis (standard reference, not scraped)