Alphabeta Math
TheoremStatement: 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.

Infinite dimensional weak topology is not first countable

Statement

Assume HB (The real dominated-extension principle as an additional hypothesis over ZF) and Countable Choice (The Axiom of Countable Choice (ACω)). An infinite-dimensional real or complex normed space has no countable weak neighborhood base at zero.

Facts & Assumptions

[F1]

Weak neighborhoods admit finite-coordinate disk refinements (Basic weak neighborhoods).

[F2]

The weakly continuous scalar-linear dual is precisely X (Continuous dual of a weak topology).

[F3]

The bounded dual is Banach, since its scalar target is Banach (If (Y) is Banach then (\mathcal B(X,Y)) is Banach).

[F4]

In ZF, a Banach space has no countably infinite Hamel basis (A Banach space has no countably infinite Hamel basis).

[F5]

Under HB, bounded functionals separate primal points (Relative dual norming, point separation, and recovery of the norm).

Proof

Given: the stated axioms and an infinite-dimensional normed space X.

1.1

Suppose (Un) is a countable weak local base at zero. For each n the set of finite lists of functionals and positive radii defining a basic neighborhood VnUn is nonempty. Apply Countable Choice once to these sets, fixing such finite lists. Enumerate their entries by pairs of natural numbers, padding each finite list with zero functionals. This gives a sequence (hk) containing every chosen functional.

givenF1
2.1

Fix fX. It is weakly continuous by F2. Some Un lies inside {f<1}, so Vn lies there too. Scaling shows that f vanishes on the common kernel of its finite defining list. For its coordinate map A, the rule (Ax)=f(x) is well-defined by this kernel inclusion. Extend a finite basis of A(X) to one of Km, and set =0 on added basis vectors. If cj are the values of the extension on standard coordinate vectors, then f(x)=jcj(Ax)j. Hence f is a finite linear combination of the defining list. Thus the algebraic span of (hk) is all of X.

step 1.1F2
3.1

Scan (hk) in order, retaining an entry precisely when it is outside the span of preceding retained entries. This deterministic rule gives either a finite basis or an infinite subsequence forming a countably infinite Hamel basis of X: every discarded entry is in the earlier retained span, while each retained entry preserves independence. The infinite outcome is impossible because X is Banach and F4 is choice-free. Therefore X has a finite basis g1,,gd.

step 2.1F3F4
4.1

The map x(g1(x),,gd(x)) is injective: a kernel vector is killed by every member of their span X and is zero by HB separation. But d+1 independent vectors in X would have dependent images in Kd, contradicting injectivity. Such vectors exist by finite induction from infinite dimension. This contradiction excludes the supplied countable local base. Countable Choice was used only in step 1.1 and HB only in this step.

step 3.1F5given

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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