Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (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 transpose is bounded with the same norm

Statement

Assume the Axiom of Choice. Let K=R or C. For a bounded linear T:X→Y between normed spaces, T∗:Y∗→X∗ is bounded linear and ∥T∗∥=∥T∥.

Facts & Assumptions

Given: The Axiom of Choice, 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.

[A1]

AC is used through the norming-functional supplier [F2] in step 2.1.

[F1]

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.

[F2]

From Every nonzero vector has a norming functional, with its stated hypotheses: Let X be a normed space over R or C, and let x∈X be nonzero. Then there exists f∈X∗ such that ∥f∥=1andf(x)=∥x∥.

Proof

1.1F1

Composition is linear in g, and ∣(T∗g)(x)∣=∣g(Tx)∣≤∥g∥∥T∥∥x∥. Taking the two unit-ball suprema gives ∥T∗∥≤∥T∥.

2.1F2step 1.1∎

If Tx≠0, choose a unit functional g∈Y∗ with g(Tx)=∥Tx∥. Then ∥Tx∥=∣(T∗g)(x)∣≤∥T∗∥∥x∥. If Tx=0 this inequality holds directly. Taking the supremum for ∥x∥≤1 gives the reverse norm bound, including T=0 and zero spaces.

Depends on

Used by

Dependency tree · two levels

8 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