Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

Every linear map between finite-dimensional inner product spaces has a unique adjoint

Statement

Every linear map T:V→W between finite-dimensional real or complex inner product spaces has a unique adjoint T∗:W→V.

Facts & Assumptions

Given: A linear map T:V→W between finite-dimensional inner product spaces.

[L1]

Every linear functional on a finite-dimensional inner product space has a unique representing vector (Finite-dimensional Riesz representation: every functional is uniquely v↦⟨v,w⟩).

[L2]

An adjoint must satisfy ⟨Tv,w⟩W=⟨v,T∗w⟩V for all v,w (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V).

[L3]

Inner products separate vectors: equality of all pairings forces equality of the paired vectors (Inner products separate vectors, and the induced norm is homogeneous: ∥λv∥=∣λ∣∥v∥).

Proof

technique · direct
1.1L1L2

Fix w∈W. The function v↦⟨Tv,w⟩W is a linear functional on V, so [L1] supplies a unique vector, call it T∗w, satisfying [L2].

2.1step 1.1L3algebra

For scalars a,b and w1,w2∈W, pairing the representatives from step 1.1 shows T∗(aw1+bw2) and aT∗w1+bT∗w2 have the same pairing with every v. By [L3] they are equal. Thus T∗ is linear.

3.1step 1.1step 2.1L1∎

Any adjoint must assign to each w the unique representative from step 1.1, so it equals T∗. This proves existence and uniqueness, including when either space is zero.

Depends on

Used by

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