Alphabeta Math
Pipeline-generated
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.

Banach Alaoglu Goldstine and Krein Milman

1 · Prerequisites

2 · Summary

Weak-star compactness begins with a concrete product embedding of the dual ball. Banach–Alaoglu spends the ultrafilter lemma only at the product- compactness step, while separability turns bounded weak-star sets into metric spaces and hence makes compactness sequential. Goldstine instead uses the relative Hahn–Banach principle to solve finite approximation problems, with no compactness assumption. The Banach–Dieudonné criterion records its additional DC and compactness costs explicitly.

The second half develops compact convex geometry. Faces and extreme points are intrinsic real-convex notions in either scalar field. Minimal closed faces give Krein–Milman under full AC, separation gives the closed-convex-hull form, and an extremal-subset proof establishes Bauer's principle without pretending that a convex function's maximizer set is convex. Milman's converse is proved from a finite compact-convex decomposition. The final corollary applies this framework to weak-star compact dual balls with the combined AC cost stated.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Dual ball as a closed subset of a product

Statement

Let X be a normed space over K{R,C} and let BX={fX:f1}. For each xX put

Dx={zK:zx}.

The evaluation map

E:BXxXDx,E(f)=(f(x))xX.

is a homeomorphism onto a closed subspace of the product. This includes X={0}.

Facts & Assumptions

Given: A normed space X over R or C.

[F1]

The weak-star topology on X is the initial topology of the evaluations ff(x) (The weak-star topology from finite evaluations).

[F3]

Elements of X are bounded linear functionals and f=supx1f(x) (The dual space X^* of a normed space and its dual norm).

Proof

technique · direct
1.1

If fBX, then f(x)x, so E(f) belongs to the displayed product; evaluations separate functionals, so E is injective. By the two initial-topology descriptions, the subspace topology pulled back by E is exactly σ(X,X) on the ball.

F1F2F3
1.2

Inside the product let C be the set of all z=(zx)xX satisfying

zx+y=zx+zy,zλx=λzx(x,yX, λK).

Each equality defines a closed set: it is the inverse image of {0} under a continuous finite linear combination of coordinate projections. Hence C, their intersection, is closed. [F2]

2.1

Every E(f) lies in C. Conversely, if zC, then fz(x)=zx is linear and its coordinate bound gives fz(x)x for every x. Thus fz is bounded with fz1, so z=E(fz). Consequently E[BX]=C.

F3step 1.2
3.1

Steps 1.1 and 2.1 show that E is a homeomorphism onto the closed subspace C. When X={0}, both the ball and the product are one-point spaces and the same argument applies.

F2step 1.1step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Banach–Alaoglu

Statement

Assume the ultrafilter lemma. If X is a real or complex normed space, then its closed dual unit ball BX is compact in the weak-star topology σ(X,X). Completeness of X is not required.

Facts & Assumptions

Given: The ultrafilter lemma and a real or complex normed space X.

[F1]

Evaluation is a weak-star homeomorphism of BX onto a closed subspace of xX{z:zx} (Dual ball as a closed subset of a product).

[F2]

Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F4]

Proof

technique · direct
1.1

For each xX, the disk Dx={zK:zx} is compact and Hausdorff: for K=R it is a closed bounded interval, and for K=C it is the closed Euclidean disk in R2. This finite-dimensional fact uses no choice; when x=0, Dx={0}.

F3
2.1

The product P=xXDx is compact by compact-Hausdorff Tychonoff. This is the unique step that uses the assumed ultrafilter lemma.

F2step 1.1
3.1

By [F1], evaluation carries BX homeomorphically onto a closed subspace C of P. The subspace C is compact by [F4].

F1F4step 2.1
4.1

An open cover of BX transports under the homeomorphism to an open cover of C; a finite subcover of C pulls back to a finite subcover of the ball. Therefore BX is weak-star compact. No step used completeness of X; if X=0, both spaces in [F1] are singletons.

F1step 3.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Absolute polar in a normed dual pair

Definition

Let X be a real or complex normed space and let UX. The absolute polar of U in the continuous dual The dual space X^* of a normed space and its dual norm is

U={fX:f(u)1 for every uU}.

This convention uses the absolute value over both scalar fields. In particular, it is not the one-sided real polar defined by inequalities f(u)1. If U=, then U=X; if U={0}, the same conclusion holds because every linear functional vanishes at zero.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Weak-star compactness of polar sets

Statement

Assume the ultrafilter lemma. Let X be a real or complex normed space and let U be a norm-neighborhood of 0. Then its absolute polar

U={fX:f(u)1 for every uU}

is weak-star compact. Neither convexity nor balancedness of U is required.

Facts & Assumptions

Given: The ultrafilter lemma, a real or complex normed space X, and a norm-neighborhood U of zero.

[F1]

Under the ultrafilter lemma the closed dual unit ball is weak-star compact, without completeness of the predual (Banach–Alaoglu).

[F2]

Finite evaluation sets form a weak-star neighborhood basis, and scalar multiplication is continuous in the weak-star topology (Basic weak star neighborhoods).

[F3]

The absolute polar is U={fX:f(u)1 uU} (Absolute polar in a normed dual pair).

Proof

technique · direct
1.1

Choose ε>0 with {x:x<ε}U and put r=ε/2. Then rBXU. If fU and x1, then rxU, whence rf(x)1. Thus fr1 and Ur1BX.

F3given
1.2

The polar is weak-star closed. Indeed, if f0U, some uU satisfies f0(u)>1; the basic neighborhood {f:(ff0)(u)<f0(u)1} misses U by the reverse triangle inequality.

F2F3
1.3

The map fr1f is a weak-star homeomorphism with inverse grg, by continuity of scalar multiplication. It carries BX onto r1BX, so the latter is compact by [F1]. The ultrafilter lemma enters only through [F1].

F1F2
2.1

By steps 1.1 and 1.2, U is a closed subset of the compact space in step 1.3. Adding its open complement to any open cover of U gives an open cover of that compact space, so deleting the complement from a finite subcover proves that U is compact. For X=0 this says that a singleton is compact.

step 1.1step 1.2step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Dual ball weak-star metrizable for a separable predual

Statement

Let X be a real or complex normed space and let (xn)n1 be a fixed dense sequence in X. On every norm-bounded subset AX, the weak-star topology is induced by

d(f,g)=n=12nmin{1,(fg)(xn)}.

The boundedness of A is essential to this assertion; no metric on all of X is claimed.

Facts & Assumptions

Given: A dense sequence (xn) in a real or complex normed space X, a subset AX, and M< with fM for every fA.

[F1]

The weak-star neighborhood basis consists of conditions on finitely many evaluations, and the topology is Hausdorff (Basic weak star neighborhoods).

Proof

technique · direct
1.1

The series defining d converges because its terms lie between 0 and 2n. Symmetry and the triangle inequality follow from those of the absolute value and from min(1,a+b)min(1,a)+min(1,b). If d(f,g)=0, then (fg)(xn)=0 for all n; for any xX, take for each k1 the least index nk with xxnk<1/k. Then xnkx and (fg)(x)2Mxxnk0. Thus f=g. This also covers M=0, when A has at most one point.

given
2.1

Fix fA and a basic weak-star neighborhood U={gA:(gf)(yj)<ε, 1jm}. If m=0, take any metric ball. Otherwise, when M>0, choose nj with yjxnj<ε/(4M); when M=0 the assertion is immediate. Put δ=minj2njmin(1,ε/2)>0. If d(f,g)<δ, then (gf)(xnj)<ε/2, and hence (gf)(yj)<2Mε/(4M)+ε/2=ε. Thus a d-ball about f lies in U.

F1step 1.1
2.2

Conversely, given η>0, choose N so that n>N2n<η/2 and put ρ=min(1,η/2). The weak-star neighborhood V={gA:(gf)(xn)<ρ, 1nN} satisfies d(f,g)<ρnN2n+η/2<η.

F1step 1.1
3.1

Step 2.1 makes every weak-star neighborhood contain a metric neighborhood, while step 2.2 makes every metric neighborhood contain a weak-star neighborhood. Hence the two relative topologies on A agree.

step 2.1step 2.2
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A separable predual has weak-star sequentially compact dual ball

Statement

Assume the ultrafilter lemma. If X is a separable real or complex normed space, then every sequence in BX has a subsequence converging in the weak-star topology. Completeness of X is not required.

Facts & Assumptions

Given: The ultrafilter lemma and a separable real or complex normed space X.

[F1]

A separable space has an at most countable dense subset (Separability: the existence of an at most countable dense subset).

[F2]

A fixed dense sequence metrizes the weak-star topology on every norm-bounded subset of the dual (Dual ball weak-star metrizable for a separable predual).

[F3]

Under the ultrafilter lemma, BX is weak-star compact, without completeness of X (Banach–Alaoglu).

Proof

technique · direct
1.1

Fix an at most countable dense set DX. It is nonempty because 0X and the empty set is not dense in a nonempty space. If D is countably infinite, a witnessing bijection ND is a dense sequence. If D is finite, a witnessing finite list can be repeated periodically (and its first entry repeated after the list ends) to give a sequence with range D. Thus X has a fixed dense sequence; no countable family of choices was made.

F1given
1.2

The same ball is weak-star compact by Banach–Alaoglu; the ultrafilter lemma is used at this step through [F3].

F3
2.1

Applying [F2] to the norm-bounded set BX gives a metric inducing precisely its relative weak-star topology.

F2step 1.1
3.1

By steps 2.1 and 1.2 the ball is a compact metric space, hence countably compact by [F4] and sequentially compact by [F5]. Equivalently, every sequence in it has a weak-star convergent subsequence.

F4F5step 2.1step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Goldstine's theorem

Statement

Assume HB. For every real or complex normed space X, the canonical image JX(BX) is weak-star dense in BX. No compactness or completeness hypothesis is used.

Facts & Assumptions

Given: HB, a real or complex normed space X, and the canonical evaluation map JX:XX.

[F1]

Under HB the canonical bidual map is a scalar-linear isometry: JX(x)(f)=f(x) and JXx=x (Relative Hahn–Banach makes the canonical bidual map an isometry).

[F2]

A point outside a nonempty closed convex subset of a finite-dimensional real Euclidean space admits strict real-linear separation (A point outside a nonempty closed convex set is strictly separated from it).

[F3]

Weak-star neighborhoods are determined by finitely many evaluations (Basic weak star neighborhoods).

[F4]

HB is the real dominated-extension principle, with no topology or completeness hypothesis (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

technique · direct
1.1

By [F1], JX(BX)BX. This is where HB supplies the norm equality needed for the stated canonical isometric embedding.

F1F4
1.2

Fix xBX and a basic weak-star neighborhood determined by f1,,fmX and ε>0. If m=0, it contains JX(0). Suppose m1, put T(x)=(f1(x),,fm(x)), v=(x(f1),,x(fm)), and let C be the Euclidean closure of T(BX) in Km, viewed as Rm or R2m. The set C is nonempty, closed and convex because BX is nonempty and convex and T is real-linear.

F3given
2.1

If vC, [F2] gives a nonzero real-linear functional and a real b with (z)b<(v) for every zC. Every real-linear functional on Km has the form (z)=Rej=1mcjzj: in the complex case write its coefficients on real and imaginary coordinate vectors and take cj=ajibj.

F2step 1.2
3.1

Put f=jcjfjX. The separation inequalities give supxBXRef(x)<Rex(f). Yet supxBXRef(x)=f: the inequality is the norm bound, while for any x rotate or change its sign so that f(x) becomes the nonnegative real f(x), and then take the supremum. Since x1, one also has Rex(f)x(f)f.

step 2.1algebra
4.1

The strict inequality in step 3.1 would therefore read f<Rex(f)f, which is impossible. Hence vC.

step 3.1
5.1

Because v lies in the closure of T(BX), the open coordinate box {z:zjvj<ε, 1jm} meets T(BX). Thus some xBX satisfies JX(x)(fj)x(fj)<ε for every j, so JX(x) belongs to the chosen neighborhood.

F1step 1.2step 4.1
6.1

Every basic weak-star neighborhood of every xBX therefore meets JX(BX), including the empty-test and zero-space cases handled in step 1.2. This is exactly weak-star density.

F3step 1.1step 1.2step 5.1
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Goldstine finite-data approximation

Statement

Assume HB. Let X be a real or complex normed space, xBX, f1,,fmX, and ε>0. There exists xBX such that

fj(x)x(fj)<ε(1jm).

The finite list may be empty.

Facts & Assumptions

Given: HB and the space, bidual vector, finite test list, and positive tolerance in the statement.

[F1]

Under HB, JX(BX) is weak-star dense in BX (Goldstine's theorem).

[F2]

Finite evaluation inequalities with positive tolerance form basic weak-star neighborhoods, including the empty list (Basic weak star neighborhoods).

[F3]

HB is the real dominated-extension principle named as an additional hypothesis over ZF (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

technique · constructive
1.1

Define U={yX:y(fj)x(fj)<ε for 1jm}. It is a basic weak-star neighborhood of x; when m=0, it is all of X.

F2construct
2.1

By Goldstine, U meets JX(BX), so there is xBX with JX(x)U. This invocation carries the HB hypothesis; no sequence or family of approximants is selected.

F1F3step 1.1
3.1

Since JX(x)(fj)=fj(x), the witness x from step 2.1 satisfies every displayed inequality, and hence is the required finite-data approximant.

step 2.1discharge-construct: step 1.1step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Banach–Dieudonné linear-subspace criterion

Statement

Assume the ultrafilter lemma, DC, and HB. Let X be a real or complex Banach space and let E be a linear subspace of X. Then E is weak-star closed if and only if EBX is weak-star closed.

Facts & Assumptions

Given: The ultrafilter lemma, DC, HB, a real or complex Banach space X, and a linear subspace EX.

[F1]

Under the ultrafilter lemma, every closed dual ball is weak-star compact (Banach–Alaoglu).

[F2]

Compact-Hausdorff Tychonoff is available under the ultrafilter lemma and is the product-compactness input in Banach–Alaoglu (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F3]

DC supplies an N-indexed chain for an entire relation from a prescribed initial state (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F4]

HB extends a dominated real-linear functional from a real subspace to the whole real normed space (The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

Every continuous linear functional on real c0 is pairing with a unique 1 sequence, with equality of norms (The continuous dual of c0 is ell-one).

[F6]

Every absolutely convergent series in a Banach space converges (Series criterion for Banach spaces).

[F7]

Finite evaluation conditions form a weak-star neighborhood basis, and the weak-star vector operations are continuous (Basic weak star neighborhoods).

Proof

technique · direct
1.1

If E is weak-star closed, then so is EBX, because BX=xBX{f:f(x)1} is an intersection of closed evaluation constraints.

F7
1.2

For the reverse implication first suppose K=R and A:=EBX is weak-star closed. If fnE and fnf in norm, boundedness of the convergent sequence gives R>0 with R1fnA; norm convergence implies weak-star convergence, so closedness of A gives R1fA and fE. If some f0E had inffEff0=0, DC could select fnE with fnf0<1/(n+1), contradicting this sequential norm-closedness. Hence d:=dist(f0,E)>0; fix 0<δ<d.

F3F7given
2.1

For finite sets SkBX, let Pn(S1,,Sn1) mean: every fE with ff0nδ violates at least one earlier test, so (ff0)(x)>kδ for some 1k<n and xSk. The assertion P1 is vacuous because δ<d.

step 1.2
3.1

Suppose Pn holds. For finite SBX, let E(S) consist of those fE with ff0(n+1)δ, all earlier tests at most kδ, and the S-test at most nδ. Put R=f0+(n+1)δ. The set K=ERBX=RA is weak-star compact: RBX is compact by scaling [F1], RA is weak-star closed, and [F1] uses the ultrafilter lemma through [F2]. Each E(S) is weak-star closed in K, because each norm bound is the intersection over xBX of closed evaluation constraints. If every E(S) were nonempty, the identity i=1qE(Si)=E(iSi) would give the finite-intersection property; compactness would produce f in every E(S). Taking singleton S={x} for every xBX would give ff0nδ, while all earlier tests hold, contradicting Pn. Thus some finite listed Sn has E(Sn)=, and that emptiness is exactly Pn+1.

F1F2F7step 2.1
4.1

Apply DC to the relation that extends a finite list (S1,,Sn1) satisfying Pn by a finite listed Sn supplied in step 3.1. Starting from the empty list, it yields finite listed sets SnBX for all n1 with every Pn true. Recording the finite listing as part of each state avoids a later countable choice of enumerations.

F3step 3.1
5.1

Concatenate, for n=1,2,, the finite list n1Sn followed by one zero padding term, obtaining a sequence (xi) in BX. If a term lies in the nth block its norm is at most 1/n; because each block is finite and nonempty after padding, the block number tends to infinity with i. Hence xi0.

step 4.1
6.1

For every fE, choose an integer nmax(2,δ1ff0). Property Pn gives k<n and xSk with (ff0)(x)>kδ; the coordinate x/k occurs in (xi), so supi(ff0)(xi)>δ.

step 2.1step 4.1step 5.1
7.1

Define T:Xc0 by T(f)=(f(xi))i. Step 5.1 makes every image a null sequence, and T(f)fsupixi, so T is bounded and linear. With y0=T(f0), step 6.1 gives T(f)y0>δ for every fE; therefore the closed linear subspace M=T(E) has dist(y0,M)δ.

step 5.1step 6.1
8.1

On M+Ry0 define g(m+ay0)=a. This is well defined because y0M, and m+ay0aδ shows gδ1. Applying HB to the sublinear function δ1 extends g to β(c0) with β(y0)=1, βM=0, and βδ1. This is the sole HB use.

F4step 7.1
9.1

By [F5] there is α=(αi)1 with β(y)=iαiyi for yc0 and iαi=βδ1.

F5step 8.1
10.1

Since iαixiiαiδ1 and X is Banach, [F6] gives x0=iαixiX with x0δ1.

F6step 5.1step 9.1
11.1

Continuity of every fX allows evaluation term by term: f(x0)=iαif(xi)=β(Tf). Thus f0(x0)=1 and f(x0)=0 for every fE. The weak-star neighborhood {h:(hf0)(x0)<1/2} therefore misses E.

F7step 7.1step 8.1step 9.1step 10.1
12.1

Every f0E has the weak-star neighborhood constructed in step 11.1 disjoint from E, so E is weak-star closed in the real case. Together with step 1.1 this proves both directions there.

step 1.1step 11.1
13.1

Now let X be complex and write XR for its realification. The map R:X(XR), Rf=Ref, is a real-linear isometric bijection with inverse g(xg(x)ig(ix)): complex linearity follows from the displayed formula, and rotating a vector shows norm equality. It is a weak-star homeomorphism because g(x)=Ref(x) and Imf(x)=g(ix). For a complex-linear E, R(E) is real-linear and R(EBX)=R(E)B(XR). Hence closedness of the complex slice implies closedness of the real slice; step 12.1 makes R(E) real weak-star closed, and the homeomorphism makes E complex weak-star closed.

F7step 12.1
14.1

Step 1.1 proves the forward implication over both scalar fields, step 12.1 proves the reverse implication over R, and step 13.1 proves it over C. Therefore the two weak-star closedness conditions are equivalent.

step 1.1step 12.1step 13.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Extreme point and face

Definition

Let K be a convex subset of a real or complex vector space, where convex combinations always use real coefficients as in Local convexity, convex and balanced sets, and the continuous dual. A point xK is an extreme point of K if

x=(1t)y+tz,y,zK,0<t<1,

implies y=z=x. The set of extreme points is denoted extK.

A face of K is a nonempty convex subset FK such that

(1t)y+tzF,y,zK,0<t<1,

implies y,zF. Thus x is extreme exactly when the singleton {x} is a face. Neither definition requires a topology. A face need not be exposed by a continuous linear functional; “face” below always means the intrinsic endpoint condition just stated.

For K= there are no extreme points and no faces. If K={x}, then x is extreme and K is its unique face. The strict restriction 0<t<1 is essential: at t=0 or t=1 the displayed equality contains no information about the unused endpoint.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Minimizer face of a continuous affine functional

Statement

Let K be a nonempty compact convex subset of a real or complex topological vector space, and let a:KR be continuous and affine for real convex combinations. Then a attains its minimum m, and

F={xK:a(x)=m}

is a nonempty compact face of K. Moreover, if G is a face of F, then G is a face of K.

Facts & Assumptions

Given: A nonempty compact convex set K and a continuous real-valued affine map a on K.

[F3]

A face is a nonempty convex subset satisfying the strict endpoint condition (Extreme point and face).

Proof

technique · direct
1.1

By [F1], some x0K satisfies a(x0)=m:=minxKa(x), so F is nonempty. Since F=a1({m}) and a is continuous, F is closed in K; hence it is compact by [F2].

F1F2given
2.1

If x,yF and 0t1, affinity gives a((1t)x+ty)=(1t)m+tm=m, so convexity of K places the combination in F; thus F is convex.

step 1.1given
2.2

Suppose x,yK, 0<t<1, and (1t)x+tyF. Minimality gives a(x),a(y)m, while affinity gives (1t)a(x)+ta(y)=m; the two positive coefficients force a(x)=a(y)=m, so x,yF. Therefore F is a face by [F3].

F3step 1.1given
3.1

Let G be a face of F, and suppose x,yK, 0<t<1, and (1t)x+tyG. Since GF and F is a face of K, step 2.2 gives x,yF; the face condition for G inside F then gives x,yG. Since G is already nonempty and convex, [F3] makes it a face of K.

F3step 2.2
4.1

Steps 1.1–2.2 prove that the minimum is attained and its level set is a nonempty compact face; step 3.1 proves that faces of faces are faces.

step 1.1step 2.1step 2.2step 3.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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

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

[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.1

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

F1given
2.1

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

F5F6step 1.1given
3.1

Suppose for contradiction that xKC. 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=Ref, the resulting inequalities give u(x)<infcCu(c).

F2F4step 2.1assume-contra
4.1

By [F3], the minimizer set M={yK:u(y)=minKu} 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 eEC.

F1F3step 1.1step 3.1
5.1

Since e minimizes u on K and xK, one has u(e)u(x); step 3.1 gives u(x)<infCu, whereas eC gives u(e)infCu, a contradiction. Thus no xKC exists, so KC.

step 3.1step 4.1discharge-contradiction
6.1

Step 2.1 gives CK 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.

step 1.1step 2.1step 5.1discharge-contradiction
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Upper semicontinuous real map on a topological space

Definition

Let T be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let f:TR. The map f is upper semicontinuous if, for every aR, the strict sublevel set

{xT:f(x)<a}

is open in T. Equivalently, every superlevel set {xT:f(x)a} is closed, because it is the complement of the strict sublevel set.

When T=AR has the subspace topology, this agrees with the existing pointwise definition: the equivalence with openness of all strict sublevels is exactly f is upper semicontinuous on A if and only if {xA:f(x)<α} is relatively open in A for every real α, lower semicontinuous if and only if {xA:f(x)>α} is, and continuous if and only if it is both, claim

  1. The empty-domain condition is vacuous, constant functions are upper semicontinuous, and the inequalities deliberately distinguish the open threshold f<a from the closed threshold fa.
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Bauer maximum principle

Statement

Assume the Axiom of Choice. Let K be a nonempty compact convex subset of a locally convex Hausdorff real or complex topological vector space. Every upper-semicontinuous convex function f:KR attains its maximum at an extreme point of K.

Facts & Assumptions

Given: AC, a locally convex Hausdorff real or complex TVS X, a nonempty compact convex KX, and an upper-semicontinuous convex f:KR.

[F1]

Upper semicontinuity means that each superlevel {x:f(x)a} is closed (Upper semicontinuous real map on a topological space).

[F2]

A singleton is a face exactly when its point is extreme (Extreme point and face).

[F3]

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

[F4]

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

[F5]

Under AC, every nonempty poset whose chains have upper bounds has a maximal element (Zorn's lemma).

[F6]

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

[F7]

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

Proof

technique · Zorn's lemma on closed extremal subsets
1.1

For each yK put Ly={xK:f(x)f(y)}, 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 f(y) are largest, and the corresponding y belongs to every listed Ly; the empty finite intersection is K. Thus [F4] supplies zyKLy, so m:=f(z) is the maximum of f on K.

F1F4given
2.1

The maximizer set M={xK:f(x)=m}={xK:f(x)m} is nonempty and closed by [F1]. Call a subset SK K-extremal when (1t)x+tyS, for x,yK and 0<t<1, implies x,yS.

F1step 1.1construct
3.1

The set M is K-extremal. Indeed, if w=(1t)x+tyM with 0<t<1, convexity and maximality give m=f(w)(1t)f(x)+tf(y)m; positivity of both coefficients and f(x),f(y)m force f(x)=f(y)=m.

step 1.1step 2.1given
4.1

Let P be the nonempty closed K-extremal subsets of M, ordered by reverse inclusion. It is nonempty because MP.

step 2.1step 3.1
5.1

An empty chain has upper bound M. For a nonempty chain CP, every finite intersection is its inclusion-smallest listed member and hence nonempty. Because every member is closed in compact K, [F4] makes H=SCS nonempty and closed. If a strict convex combination lies in H, extremality in every S puts both endpoints in every S, so H is K-extremal. Thus HP and is an upper bound in the reverse-inclusion order.

F4step 4.1
6.1

By [F5], with AC declared in [F6], P has a maximal element M0, equivalently an inclusion-minimal nonempty closed K-extremal subset of M.

F5F6step 4.1step 5.1
7.1

Suppose p,qM0 are distinct. By [F7], AC supplies HB, so [F3] gives a continuous f0X for which u=Ref0 has u(p)u(q).

F3F7step 6.1
8.1

Apply the finite-intersection argument of step 1.1 to the continuous real function uM0: its superlevels in M0 are closed in K because M0 is closed and u is continuous, and the family indexed by yM0 has the finite-intersection property. Hence u has a maximum c on M0, and N={xM0:u(x)=c} is nonempty and closed in K. It is proper because u(p)u(q).

F4step 1.1step 6.1step 7.1
9.1

The set N is K-extremal: if (1t)x+tyN with x,yK and 0<t<1, extremality of M0 first gives x,yM0; linearity yields c=(1t)u(x)+tu(y) while u(x),u(y)c, so positivity forces u(x)=u(y)=c and x,yN. Thus NP is a proper subset of M0, contradicting minimality.

step 6.1step 8.1
10.1

Therefore M0={e} for some eM. Since this singleton is K-extremal, it satisfies the singleton face condition in [F2], so e is extreme in K; and eM gives f(e)=m=maxKf.

F2step 2.1step 6.1step 9.1
11.1

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.

step 1.1step 3.1step 6.1step 10.1

Remarks

The maximizer set need not be convex: for f(x)=x2 on [1,1] it is {1,1}. The proof therefore does not apply Krein–Milman to that set; it uses closed K-extremal subsets, exactly as the endpoint calculation above requires.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Milman converse for compact generating sets

Statement

Let K be a compact convex subset of a locally convex Hausdorff real or complex topological vector space, and let AK. If

K=co(A),

then extKA. In particular, if A is compact and generates K in this sense, then extKA.

Facts & Assumptions

Given: A locally convex Hausdorff real or complex TVS X, a compact convex KX, and AK with K=co(A).

[F1]

Extreme points are characterized by strict two-endpoint convex representations (Extreme point and face).

[F2]

Every zero-neighborhood in a locally convex TVS contains an open convex zero-neighborhood (Local convexity, convex and balanced sets, and the continuous dual).

[F5]

The convex hull of finitely many nonempty compact convex sets is compact, is closed in a Hausdorff TVS, and has the displayed one-point-from-each-set representation (Convex closures and hulls of finitely many compact convex sets).

[F6]

If N is a natural number and F is a function with domain N whose values are nonempty, then the family F[N] has a choice function in ZF. Repetitions among the listed values are allowed (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

technique · contradiction from a finite compact-convex decomposition
1.1

The conclusion is immediate if K=. Otherwise A, because the closed convex hull of the empty set is empty. Put B=A. Since K is closed by [F3] and contains A, one has BK; hence B is closed in compact K and compact by [F4].

F3F4given
2.1

Assume for contradiction that wextKB. The open set XB contains w, so translation gives a zero-neighborhood V with w+VXB. Continuity of subtraction at (0,0) gives a zero-neighborhood W with WWV, and [F2] gives an open convex zero-neighborhood UW. Thus (w+UU)B=.

F2step 1.1givenassume-contra
3.1

The family {b+U:bB} is an open cover of the nonempty compact set B. Compactness supplies a listed subcover O1,,On with n1. For in={0,,n1} put Ci={bB:b+U=Oi+1}. Each Ci is nonempty because Oi+1 belongs to the displayed cover. Apply [F6] to the function iCi with domain n; if c is the resulting choice function on its family of values, set bi+1=c(Ci). Then bi+1B, Oi+1=bi+1+U, and hence Bj=1n(bj+U). Put Bj=B(bj+U) and Kj=co(Bj). Each Bj is nonempty because it contains bj.

F6step 1.1step 2.1
4.1

Each Kj is a nonempty compact convex subset of K: the closed convex set K contains Bj, hence its closed convex hull, and Kj is closed in compact K, so [F4] applies. Moreover wKj. Indeed co(Bj)bj+U by convexity; if w lay in its closure, the open neighborhood w+U of w would meet bj+U, giving bjw+UU, contrary to bjB and step 2.1.

F4step 2.1step 3.1
5.1

Let H=co(K1Kn). By [F5], H is compact and therefore closed in the Hausdorff ambient space, and every point of H is j=1ntjxj with xjKj, tj0, and jtj=1. Since ABjBjH, closedness and convexity of H give K=co(A)H; conversely every KjK and K is convex, so HK. Hence H=K.

F5step 3.1step 4.1given
6.1

Apply the representation in step 5.1 to w: write w=jtjxj with xjKj. If exactly one coefficient is positive, it equals one and gives w=xjKj, contradicting step 4.1. Otherwise, for each i with ti>0 one has 0<ti<1 and may write w=tixi+(1ti)yi, where yi=(1ti)1jitjxjK.

step 4.1step 5.1
7.1

Since w is extreme, [F1] applied to the strict representation in step 6.1 gives xi=w for every positive coefficient ti. At least one coefficient is positive, so wKi for some i, again contradicting step 4.1. Therefore no such w exists and extKB=A.

F1step 2.1step 4.1step 6.1discharge-contradiction
8.1

If A is compact, then it is closed by [F3], so A=A and step 7.1 gives extKA. This proves both assertions, including the empty case from step 1.1.

F3step 1.1step 7.1discharge-contradiction
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Dual unit ball has extreme points

Statement

Assume the Axiom of Choice. The closed unit ball of the dual of every nonzero real or complex normed space has an extreme point.

Facts & Assumptions

Given: AC and a nonzero real or complex normed space X.

[F1]

Under the ultrafilter lemma the closed dual unit ball is weak-star compact (Banach–Alaoglu).

[F2]

Under AC every nonempty compact convex subset of a locally convex Hausdorff real or complex TVS has an extreme point (Krein–Milman existence of extreme points).

[F3]

The weak-star topology on X is Hausdorff and locally convex without any choice assumption (Basic weak star neighborhoods).

[F4]

AC is the declared ambient choice principle (The Axiom of Choice).

[F6]

AC supplies the Hahn–Banach theorem used inside locally convex separation in the selected Krein–Milman proof (Hahn-Banach dominated extension theorem for real vector spaces).

Proof

technique · direct
1.1

By [F5], the assumed AC supplies the ultrafilter lemma. Therefore [F1] makes BX compact for the weak-star topology.

F1F4F5given
1.2

By [F3], X with the weak-star topology is a locally convex Hausdorff real or complex TVS. The set BX is nonempty because it contains the zero functional, and it is convex by the triangle inequality and homogeneity of the dual norm.

F3given
2.1

Apply [F2] to the nonempty weak-star compact convex set BX. Its proof uses Zorn under AC and separation under HB; [F6] records that the same AC hypothesis supplies that HB input. Hence BX has an extreme point.

F2F6step 1.1step 1.2
3.1

This proves the stated nonzero case. In fact the same argument includes X={0}, whose dual ball is the singleton {0} and whose unique point is extreme.

step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources