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.

Transpose is weak to weak continuous

Statement

Every bounded scalar-linear T:X→Y between real or complex normed spaces is weak-to-weak continuous. Its transpose T∗:Y∗→X∗ is continuous for σ(Y∗,Y∗∗) and σ(X∗,X∗∗). No choice principle is needed.

Facts & Assumptions

[F1]

The transpose is (T∗g)(x)=g(Tx), a bounded functional of x (The transpose of a bounded operator).

[F2]

Weak convergence is coordinate convergence under bounded functionals, for arbitrary nets (Weak convergence of nets and sequences).

Proof

Given: a bounded scalar-linear map T:X→Y.

1.1givenF1F2

For g∈Y∗, g∘T∈X∗ and ∣(g∘T)(x)∣≤∥g∥∥T∥∥x∥. The inverse under T of a weak subbasic set g−1(V) is (g∘T)−1(V), which is weakly open in X. Inverse images preserve unions and finite intersections, proving continuity of T. Equivalently, F2 gives g(Txi)→g(Tx) for every weakly convergent net.

2.1step 1.1F1algebra

Taking the supremum over ∥x∥≤1 in the bound of step 1.1 gives ∥T∗g∥≤∥T∥∥g∥, so T∗ is bounded. Apply the step 1.1 argument to this bounded map: for every Φ∈X∗∗, Φ∘T∗∈Y∗∗ since ∣Φ(T∗g)∣≤∥Φ∥∥T∥∥g∥. Thus inverse weak subbasic sets are weakly open, proving weak-to-weak continuity of T∗. The estimates remain valid for zero maps and zero spaces. □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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