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 existence of extreme points

Statement

Assume the Axiom of Choice. Every nonempty compact convex subset K of a locally convex Hausdorff real or complex topological vector space has an extreme point.

Facts & Assumptions

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

[F1]

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

[F2]

Assuming HB, the continuous dual of a Hausdorff locally convex space separates distinct points by their real parts (The continuous dual separates points in a Hausdorff locally convex space).

[F3]

Compactness is equivalent to the nonempty-intersection property for closed families having the finite-intersection property (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection).

[F4]

Under AC, a nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).

[F5]

AC says every family of nonempty sets has a choice function (The Axiom of Choice).

[F6]

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

Proof

technique · Zorn's lemma on closed faces ordered by reverse inclusion
1.1

Let P be the set of nonempty faces of K that are closed in K, ordered by FG when FG. It is a nonempty poset because KP.

given
2.1

Let C be a chain in P. If C=, then K is an upper bound. Otherwise every finite subfamily of C has intersection equal to its inclusion-smallest member and hence nonempty. Its members are closed in compact K, so [F3] gives a nonempty intersection H:=FCF, and H is closed and convex.

F3step 1.1
3.1

If x,yK, 0<t<1, and (1t)x+tyH, then this combination lies in every FC; since each F is a face, x,y lie in every F and therefore in H. Thus H is a face, hence belongs to P, and FH for every FC, so H is an upper bound in the reverse-inclusion order.

step 1.1step 2.1
4.1

By [F4], using AC as declared in [F5], P has a maximal element M; equivalently, M is an inclusion-minimal nonempty closed face of K.

F4F5step 1.1step 3.1
5.1

Suppose p,qM are distinct. AC supplies HB by [F6], so [F2] gives fX with u(p):=Ref(p)Ref(q)=:u(q). The restriction uM is continuous, real-valued, and affine.

F2F6step 4.1
6.1

By [F1], the minimizer set N of uM is a nonempty compact face of M, hence a face of K. It is closed in M and M is closed in K, so it is closed in K and lies in P. Since u(p)u(q), at least one of p,q is not a minimizer, so NM, contradicting the inclusion-minimality of M.

F1step 4.1step 5.1
7.1

Hence M is a singleton, say M={x}. Since M is a face of K, the singleton characterization in the face definition makes x an extreme point of K.

step 4.1step 6.1
8.1

The empty-chain case in step 2.1 and the nonempty-chain construction in steps 2.1–3.1 verify every chain hypothesis of Zorn; steps 4.1–7.1 then produce the required extreme point.

step 2.1step 3.1step 4.1step 7.1

Depends on

Used by

Dependency tree · two levels

27 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