Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 K is a compact convex subset of a locally convex Hausdorff real or complex topological vector space, then

K=co⁡‾(ext⁡K).

The empty set is allowed, with co⁡‾(∅)=∅.

Facts & Assumptions

Given: AC, a locally convex Hausdorff real or complex TVS X, and a compact convex subset K⊆X.

[F1]

Under AC, every nonempty compact convex subset of X has an extreme point (Krein–Milman existence of extreme points).

[F2]

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).

[F3]

A continuous real affine functional has a compact minimizer face, and faces of faces are faces (Minimizer face of a continuous affine functional).

[F4]

AC supplies Hahn–Banach dominated extension (Hahn-Banach dominated extension theorem for real vector spaces).

[F6]

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

technique · contradiction by strict separation
1.1F1given

If K=∅, then ext⁡K=∅ and both sides are empty by the stated convention. Hence suppose K≠∅ and put E=ext⁡K and C=co⁡‾(E). By [F1], E and therefore C are nonempty.

2.1F5F6step 1.1given

The set K is closed by [F5] and convex by hypothesis, and it contains E; therefore it contains co⁡(E) and its closure C. The set C is closed by definition and convex by [F6].

3.1F2F4step 2.1assume-contra

Suppose for contradiction that x∈K∖C. Apply [F2] to the compact convex singleton {x} and the nonempty closed convex set C, using HB supplied from AC by [F4]. After naming u=Re⁡f, the resulting inequalities give u(x)<inf⁡c∈Cu(c).

4.1F1F3step 1.1step 3.1

By [F3], the minimizer set M={y∈K:u(y)=min⁡Ku} is a nonempty compact face of K. By [F1], M has an extreme point e. Then {e} is a face of M, so face transitivity in [F3] makes {e} a face of K; hence e∈E⊆C.

5.1step 3.1step 4.1discharge-contradiction

Since e minimizes u on K and x∈K, one has u(e)≤u(x); step 3.1 gives u(x)<inf⁡Cu, whereas e∈C gives u(e)≥inf⁡Cu, a contradiction. Thus no x∈K∖C exists, so K⊆C.

6.1step 1.1step 2.1step 5.1discharge-contradiction∎

Step 2.1 gives C⊆K 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

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