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.

Dual ball weak-star metrizable for a separable predual

Statement

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

d(f,g)=∑n=1∞2−nmin⁡{1,∣(f−g)(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 A⊆X∗, and M<∞ with ∥f∥≤M for every f∈A.

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

The series defining d converges because its terms lie between 0 and 2−n. 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 (f−g)(xn)=0 for all n; for any x∈X, take for each k≥1 the least index nk with ∥x−xnk∥<1/k. Then xnk→x and ∣(f−g)(x)∣≤2M∥x−xnk∥→0. Thus f=g. This also covers M=0, when A has at most one point.

2.1F1step 1.1

Fix f∈A and a basic weak-star neighborhood U={g∈A:∣(g−f)(yj)∣<ε, 1≤j≤m}. If m=0, take any metric ball. Otherwise, when M>0, choose nj with ∥yj−xnj∥<ε/(4M); when M=0 the assertion is immediate. Put δ=min⁡j2−njmin⁡(1,ε/2)>0. If d(f,g)<δ, then ∣(g−f)(xnj)∣<ε/2, and hence ∣(g−f)(yj)∣<2Mε/(4M)+ε/2=ε. Thus a d-ball about f lies in U.

2.2F1step 1.1

Conversely, given η>0, choose N so that ∑n>N2−n<η/2 and put ρ=min⁡(1,η/2). The weak-star neighborhood V={g∈A:∣(g−f)(xn)∣<ρ, 1≤n≤N} satisfies d(f,g)<ρ∑n≤N2−n+η/2<η.

3.1step 2.1step 2.2∎

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.

Depends on

Used by

Dependency tree · two levels

2 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