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 star to weak star continuous

Statement

Assume HB (The real dominated-extension principle as an additional hypothesis over ZF). For normed real or complex spaces X,Y, a bounded scalar-linear T:XY has weak-star continuous transpose T:YX, (Tf)(x)=f(Tx). Conversely every bounded weak-star continuous scalar-linear S:YX is T for a unique bounded scalar-linear T:XY. No completeness or reflexivity is required. The forward implication is choice-free.

Facts & Assumptions

[F1]

Under HB every weak-star continuous scalar-linear functional on Y is evaluation at a unique point of Y (Continuous dual of a weak star topology).

[F2]

Under HB the norm is recovered as the supremum of absolute values under dual unit-ball functionals, which separate points (Relative dual norming, point separation, and recovery of the norm).

Proof

Given: the spaces and the maps of the respective assertions; HB for the converse.

1.1

For bounded T, (Tf)(x)=f(Tx)fTx. Thus TfX and T is bounded and scalar-linear. For every xX, the composite of T with evaluation at x is evaluation at Tx. Its inverse scalar-open sets are weak-star open by the defining evaluation topology in F1. Thus T is weak-star continuous.

givenF1algebra
2.1

For the converse, fix xX. The map f(Sf)(x) is weak-star continuous and scalar-linear, since S is and evaluation at x is. F1 gives a unique point TxY with f(Tx)=(Sf)(x) for all fY. Unique specification defines T on all X without choosing from a family of non-singleton sets. For scalars a,b, evaluation gives f(T(ax+bz))=(Sf)(ax+bz)=af(Tx)+bf(Tz) for every f. Point separation makes T(ax+bz)=aTx+bTz.

step 1.1F1F2given
3.1

By F2 and boundedness of S, Tx=supf1(Sf)(x)Sx. Hence T is bounded, and its defining identity says S=T. Any other preadjoint has the same evaluations at each x and therefore equals T by point separation. Zero spaces and S=0 satisfy the same formulas, with T=0.

step 2.1F2algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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