Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Extreme points of the dual ball of C(K)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let K be a nonempty compact Hausdorff space, let K be R or C, and let BC(K,K)∗={L:∥L∥≤1} be the closed dual unit ball with the norm topology. Then the extreme points of BC(K,K)∗ (Extreme point and face) are exactly the normalized point evaluations

ext⁡BC(K,K)∗  =  { c δx  :  x∈K, c∈K, ∣c∣=1 },

where δx(f)=f(x). The proof is written for K=C, with the Riesz representation for complex measures. Step 0.1 derives the real signed-measure representation isometrically from that complex interface, after which the same variation argument applies in both scalar fields.

Facts & Assumptions

Given: A nonempty compact Hausdorff space K, a scalar field K∈{R,C}, the Banach space C(K,K) with the supremum norm, and its dual with the operator norm.

[L1]

Every bounded complex-linear functional L on C0(X;C) for X locally compact Hausdorff has a unique representation L(f)=∫Xf dμ by a finite regular complex Borel measure μ, and ∥L∥=∣μ∣(X); conversely every such μ defines a bounded functional (The bounded complex dual of C0(X) is regular complex measures). Applied to X=K compact this identifies BC(K)∗ with the set of regular complex Borel measures μ on K with ∣μ∣(K)≤1.

[L2]

A point x of a convex set K0 is extreme when x=(1−t)y+tz with y,z∈K0, 0<t<1, forces y=z=x (Extreme point and face).

[L3]

The Axiom of Choice holds; in particular the selection of finitely many open sets and of one point from a nonempty compact set used below is licensed, and AC⇒ACω (The Axiom of Choice).

Proof

technique · direct
1.1L1algebra

The measure identification also holds isometrically over R. Indeed, for a bounded real-linear L:C(K,R)→R, define LC(u+iv):=L(u)+iL(v). This is complex-linear. Given h=u+iv, choose θ so that e−iθLC(h)=∣LC(h)∣; then ∣LC(h)∣=L(Re⁡(e−iθh))≤∥L∥ ∥h∥∞, while restriction to real-valued functions gives the reverse norm inequality. Thus ∥LC∥=∥L∥, and [L1] represents LC by a unique regular complex measure μ. The conjugate measure μˉ represents the same functional, since for h=u+iv, ∫Kh dμˉ=∫Khˉ dμ‾=L(u)−iL(v)‾=L(u)+iL(v). Uniqueness in [L1] gives μ=μˉ, so μ is real-valued and hence a finite regular signed measure. Conversely, a regular signed measure defines a bounded real functional; applying the same rotation argument to its complex integral shows that its real and complex operator norms agree, so [L1] gives norm ∣μ∣(K). Together with [L1], this identifies the dual ball with regular signed or complex measures of variation at most one in the respective scalar field.

2.1step 1.1L1L2algebra

Conversely every cδx with ∣c∣=1 is extreme. Suppose cδx=(1−t)ν1+tν2 with 0<t<1 and ∥νj∥≤1. Evaluation at the constant function 1 gives c=(1−t)ν1(K)+tν2(K) with ∣νj(K)∣≤1, so equality in the triangle inequality forces ν1(K)=ν2(K)=c and ∣νj∣(K)=1. For every Borel E, the inequalities 1=∣νj(K)∣≤∣νj(E)∣+∣νj(K∖E)∣≤∣νj∣(E)+∣νj∣(K∖E)=1 are equalities. Thus νj(E)=c∣νj∣(E), so νj=cλj for the probability measure λj:=∣νj∣. The original equality becomes δx=(1−t)λ1+tλ2. Positivity gives zero λj-mass to every compact subset of K∖{x}; regularity gives λ1=λ2=δx, and hence ν1=ν2=cδx.

2.2step 1.1L2L3algebra

Under the measure identification of [step 1.1] and with the selection licensed by [L3], a measure μ with ∣μ∣(K)<1 is not extreme: choose x∈K and 0<ε<1−∣μ∣(K); then μ=12(μ+εδx)+12(μ−εδx) with both summands of variation at most ∣μ∣(K)+ε<1, and the summands differ from μ. Hence every extreme point has norm and total variation one.

2.3step 1.1L1L2algebra

If ∣μ∣(K)=1 and there is a Borel set E with 0<∣μ∣(E)<1, then μ is not extreme. Write μ1:=μ∣E and μ2:=μ∣K∖E. Both are nonzero with ∥μj∥=∣μj∣(K)∈(0,1), and μ=∥μ1∥ν1+∥μ2∥ν2, where νj:=μj/∥μj∥ have norm one. They are distinct because ∣ν1∣(E)=1 whereas ∣ν2∣(E)=0. The positive coefficients sum to one, so this is a proper convex combination inside the ball.

2.4step 1.1L1L2algebra

Suppose ∣μ∣(K)=1 and ∣μ∣(E)∈{0,1} for every Borel E. Then μ=cδy for a unique y∈K and some ∣c∣=1. If ∣μ∣({x})=0, outer regularity gives an open neighbourhood U of x with ∣μ∣(U)<1, and the two-valued hypothesis forces ∣μ∣(U)=0. If every singleton had measure zero, these open zero-measure sets would cover K, so compactness would give a finite such cover and contradict ∣μ∣(K)=1. Thus ∣μ∣({y})=1 for some y. Additivity gives ∣μ∣(K∖{y})=0, so ∣μ∣=δy and y is unique. Since μ is concentrated on {y}, putting c:=μ({y}) gives μ=cδy and ∣c∣=1.

3.1step 2.2step 2.3step 2.4

Let μ be an extreme point. By [step 2.2] ∣μ∣(K)=1. If ∣μ∣ were not {0,1}-valued then [step 2.3] would give a proper convex combination, contradicting extremality; hence [step 2.4] gives μ=cδy with ∣c∣=1.

4.1step 2.1step 3.1∎

By [step 3.1] every extreme point is cδy with ∣c∣=1, and by [step 2.1] every such point is extreme; hence ext⁡BC(K)∗={cδx:x∈K, ∣c∣=1}.

Remarks

  • The real case. Step 1.1 supplies the signed measure and norm equality from the declared complex Riesz theorem. In the subsequent argument every scalar factor is real, so ∣c∣=1 means c∈{+1,−1} and ext⁡BC(K,R)∗={±δx:x∈K}.
  • Where regularity and compactness enter. Outer regularity turns ∣μ∣({x})=0 into an open zero-measure neighbourhood in [step 2.4], and compactness reduces the resulting open cover to a finite one.

Depends on

Used by

Dependency tree · two levels

16 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