Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose

Statement

Let V be a finite-dimensional real or complex inner product space, let T:VV be linear, and let E be an orthonormal basis of V. Write

A=[T]EE.

Then:

  1. T is self-adjoint if and only if A=A.
  2. T is normal if and only if AA=AA.

Over R, A is just AT.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V, a linear map T:VV, an orthonormal basis E, and the matrix A=[T]EE.

[L1]

In orthonormal bases, the matrix of the adjoint is the conjugate transpose (In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix).

[L2]

Matrix representation sends composition to matrix multiplication ([ST]BD=[S]CD[T]BC).

Proof

technique · direct
1.1

By the definition of self-adjointness in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, T is self-adjoint exactly when T=T. By [L1], this is equivalent to A=[T]EE=[T]EE=A.

L1
2.1

By the definition of normality in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, T is normal exactly when TT=TT; using [L2] and then [L1], this is equivalent to [TT]EE=A[T]EE=AA=[T]EEA=AA=[TT]EE, hence to AA=AA.

L1L2

Depends on

Used by

Dependency tree · two levels

13 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