Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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:VW between finite-dimensional real or complex inner product spaces has a unique adjoint T:WV.

Facts & Assumptions

Given: A linear map T:VW 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 vv,w).

[L2]

An adjoint must satisfy Tv,wW=v,TwV for all v,w (The adjoint T:WV is characterised by Tv,wW=v,TwV).

[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.1

Fix wW. The function vTv,wW is a linear functional on V, so [L1] supplies a unique vector, call it Tw, satisfying [L2].

L1L2
2.1

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

step 1.1L3algebra
3.1

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.

step 1.1step 2.1L1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 42 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources