Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

The canonical map is natural

Statement

Let K=R or C. If T:X→Y is bounded linear between normed spaces, then T∗∗JX=JYT:X⟶Y∗∗.

Facts & Assumptions

Given: The spaces, maps, scalar field, and hypotheses in the statement above. All duals consist of linear functionals over the ambient field; evaluation has no conjugation.

[F1]

From The canonical evaluation map into the bidual, with its stated hypotheses: Let K=R or C. For a normed X, define JX:X→X∗∗,(JXx)(f)=f(x)(f∈X∗). With the dual norm from def-dual-space-of-a-normed-space, evaluation is linear in f and ∣(JXx)(f)∣≤∥x∥∥f∥, so JXx is a bounded functional on X∗. The map is canonical and uses no chosen basis or conjugation.

[F2]

From The transpose of a bounded operator, with its stated hypotheses: Let K=R or C. Let T:X→Y be bounded and linear between normed spaces. Its transpose, or Banach adjoint, is T∗:Y∗⟶X∗,(T∗g)(x)=g(Tx). The duals are def-dual-space-of-a-normed-space. Composition is bounded by lem-composition-operator-norm-inequality, so this has the displayed codomain. It is linear in g over K. No complex conjugation is inserted; a Hilbert adjoint uses a separate inner-product identification.

Proof

1.1F1F2

By [F2], T∗ is bounded, so its transpose T∗∗:X∗∗→Y∗∗ is defined. For x∈X and g∈Y∗, (T∗∗JXx)(g)=(JXx)(T∗g)=(T∗g)(x).

2.1F1F2step 1.1∎

The last expression is g(Tx)=(JYTx)(g). Equality at every g proves equality in Y∗∗ and then equality of operators for every x. With x=0 or T=0 every expression vanishes; the same calculation covers zero spaces.

Depends on

Used by

Dependency tree · two levels

4 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