Alphabeta Math
TheoremStatement: 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 canonical bidual map is an isometry

Statement

Assume the Axiom of Choice. Let K=R or C. For every normed X, the map JX:X→X∗∗ is linear and ∥JXx∥=∥x∥ for every x∈X. In particular it is injective.

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 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 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

For a,b∈K, evaluation gives JX(ax+by)(f)=af(x)+bf(y) for every f. Also ∣f(x)∣≤∥f∥∥x∥ gives ∥JXx∥≤∥x∥.

2.1F2step 1.1∎

If x≠0, a norming f satisfies ∥f∥=1 and f(x)=∥x∥, so ∥JXx∥≥∥x∥. For x=0 both norms are zero. Equality of norms now forces JXx=0 only for x=0, including when X is the zero space.

Depends on

Used by

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