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

Basic weak star neighborhoods

Statement

For a real or complex normed space X, the sets

U(f;x1,…,xm;ε)={g∈X∗:∣(g−f)(xj)∣<ε (1≤j≤m)},ε>0,

form a weak-star neighborhood base at f. The empty list gives X∗. This topology is Hausdorff and locally convex, and addition and joint scalar multiplication are continuous, without HB or any choice assumption.

Facts & Assumptions

[F1]

The weak-star topology is the initial topology of evaluations, with the displayed finite-evaluation basis (The weak-star topology from finite evaluations).

Proof

Given: a real or complex normed space X.

1.1F1given

Each displayed set is a finite intersection of inverse scalar disks. Conversely, every finite intersection of subbasic sets containing f contains such a set by shrinking each scalar open set to a disk and taking the smallest of the finitely many positive radii. The empty intersection needs no shrinking.

2.1step 1.1algebra

For a finite list set p(h)=max⁡j∣h(xj)∣, with p=0 for an empty list. Linearity gives p(h+k)≤p(h)+p(k) and p(ah)=∣a∣p(h). Hence its open balls are balanced and real-convex; the bounds p(h−h0),p(k−k0)<ε/2 imply p(h+k−h0−k0)<ε, proving addition is continuous.

3.1step 2.1algebra

To control scalar multiplication at (a0,h0), use p(ah−a0h0)≤∣a∣p(h−h0)+∣a−a0∣p(h0). The requirements ∣a−a0∣<min⁡(1,ε/(2(p(h0)+1))) and p(h−h0)<ε/(2(∣a0∣+1)) make this less than ε. Thus the topology is a locally convex vector topology.

4.1step 1.1algebra

If f≠g as functions, some x∈X has f(x)≠g(x). Put d=∣f(x)−g(x)∣>0. The evaluation disks of radius d/3 about these two values have disjoint inverse images containing f and g, since a common member would give d<2d/3. This proves Hausdorffness; on a singleton dual it is vacuous. No norming principle is involved. □

Depends on

Dependency tree · 2 levels

Sources