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:XY between real or complex normed spaces is weak-to-weak continuous. Its transpose T:YX is continuous for σ(Y,Y) and σ(X,X). No choice principle is needed.

Facts & Assumptions

[F1]

The transpose is (Tg)(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:XY.

1.1

For gY, gTX and (gT)(x)gTx. The inverse under T of a weak subbasic set g1(V) is (gT)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.

givenF1F2
2.1

Taking the supremum over x1 in the bound of step 1.1 gives TgTg, so T is bounded. Apply the step 1.1 argument to this bounded map: for every ΦX, ΦTY since Φ(Tg)ΦTg. 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.

step 1.1F1algebra

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