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.

Membership in the transpose range by an operator estimate

Statement

Assume the Axiom of Choice. Let K=R or C. Let T:X→Y be bounded linear between normed spaces and f∈X∗. Then f∈ran⁡T∗⟺∃C≥0 ∀x∈X: ∣f(x)∣≤C∥Tx∥. For any such C, a representing g∈Y∗ can be chosen with ∥g∥≤C.

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 norm-preserving extension [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 A bounded linear functional on an arbitrary subspace extends with the same norm, without assuming the subspace is closed, with its stated hypotheses: Let X be a normed space over R or C, let M⊆X be a linear subspace, and let f0:M→R or f0:M→C be a bounded linear functional over the ambient scalar field. Then there exists a bounded linear extension F of f0 to all of X such that ∥F∥=∥f0∥. No closedness hypothesis on M is needed.

Proof

1.1F1

If f=T∗g, then ∣f(x)∣=∣g(Tx)∣≤∥g∥∥Tx∥ for all x. Take C=∥g∥≥0.

1.2given

Conversely suppose the domination bound holds. It forces f to vanish on ker⁡T. Therefore h(Tx)=f(x) defines a linear functional on ran⁡T: if Tx=Tx′, the difference is in the kernel and f(x)=f(x′). The bound says ∣h(y)∣≤C∥y∥ there.

2.1F1F2step 1.2∎

Extend h to g∈Y∗ with ∥g∥=∥h∥≤C, without assuming the range is closed. Then T∗g=f. If C=0, f=0 and g=0 works; for T=0 the bound holds precisely for f=0.

Depends on

Used by

Dependency tree · two levels

10 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