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.
Krein–Milman closed-convex-hull form
Statement
Assume the Axiom of Choice. If is a compact convex subset of a locally convex Hausdorff real or complex topological vector space, then
The empty set is allowed, with .
Facts & Assumptions
Given: AC, a locally convex Hausdorff real or complex TVS , and a compact convex subset .
Under AC, every nonempty compact convex subset of has an extreme point (Krein–Milman existence of extreme points).
Assuming HB, a nonempty compact convex set and a disjoint nonempty closed convex set are strictly separated by the real part of a continuous linear functional (Uniform strict separation of compact and closed convex sets).
A continuous real affine functional has a compact minimizer face, and faces of faces are faces (Minimizer face of a continuous affine functional).
AC supplies Hahn–Banach dominated extension (Hahn-Banach dominated extension theorem for real vector spaces).
A compact subset of a Hausdorff space is closed (In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, claim 3).
The closure of a convex subset of a real or complex TVS is convex (Convex closures and hulls of finitely many compact convex sets).
Proof
If , then and both sides are empty by the stated convention. Hence suppose and put and . By [F1], and therefore are nonempty.
The set is closed by [F5] and convex by hypothesis, and it contains ; therefore it contains and its closure . The set is closed by definition and convex by [F6].
Suppose for contradiction that . Apply [F2] to the compact convex singleton and the nonempty closed convex set , using HB supplied from AC by [F4]. After naming , the resulting inequalities give .
By [F3], the minimizer set is a nonempty compact face of . By [F1], has an extreme point . Then is a face of , so face transitivity in [F3] makes a face of ; hence .
Since minimizes on and , one has ; step 3.1 gives , whereas gives , a contradiction. Thus no exists, so .
Step 2.1 gives and step 5.1 gives the reverse inclusion; together with the empty case in step 1.1 this proves the asserted equality in every case.
Depends on
- Krein–Milman existence of extreme points
- Uniform strict separation of compact and closed convex sets
- Minimizer face of a continuous affine functional
- Hahn-Banach dominated extension theorem for real vector spaces
- In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones
- Convex closures and hulls of finitely many compact convex sets
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- Bühler–Salamon, Functional Analysis (standard reference, not scraped)
- Hanche-Olsen, Topological vector spaces (standard reference, not scraped)