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.

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∘={f∈X∗:∣f(u)∣≤1 for every u∈U}

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∘={f∈X∗:∣f(u)∣≤1 ∀u∈U} (Absolute polar in a normed dual pair).

Proof

technique · direct
1.1F3given

Choose ε>0 with {x:∥x∥<ε}⊆U and put r=ε/2. Then rBX⊆U. If f∈U∘ and ∥x∥≤1, then rx∈U, whence r∣f(x)∣≤1. Thus ∥f∥≤r−1 and U∘⊆r−1BX∗.

1.2F2F3

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

1.3F1F2

The map f↦r−1f is a weak-star homeomorphism with inverse g↦rg, by continuity of scalar multiplication. It carries BX∗ onto r−1BX∗, so the latter is compact by [F1]. The ultrafilter lemma enters only through [F1].

2.1step 1.1step 1.2step 1.3∎

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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