Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-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 real trace pairing on finite Hermitian matrices is an inner product

Statement

Let Hd be the real vector space of Hermitian d×d complex matrices from the preceding definition. The pairing ⟨A,B⟩HS=Tr⁡(AB) is real-valued, symmetric, real-bilinear, and positive definite on Hd. Its associated norm is ∥A∥HS=Tr⁡(A2). For every m≥1 and finite family F1,…,Fm∈Hd, the Gram matrix Gab=Tr⁡(FaFb) is real symmetric positive semidefinite, equals S∗S for the synthesis map Sc=∑acaFa, and satisfies ker⁡G=ker⁡S.

Facts & Assumptions

Given: d,m≥1, the Hermitian matrices Hd, the trace pairing, the family F1,…,Fm, and the synthesis map defined in the preceding definition.

[F1]

Finite Hermitian frames and their Gram pseudoinverse: Hd is a real vector space, ⟨A,B⟩HS=Tr⁡(AB), and Gab=Tr⁡(FaFb).

[F2]

Finite matrix trace cyclicity and nondegeneracy: Tr⁡(AB)=Tr⁡(BA) for finite square matrices.

[F3]

Finite matrix spectral and state calculus: every finite Hermitian matrix has an orthonormal eigenbasis with real eigenvalues.

[F4]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: in a real or complex inner-product space, ∣⟨u,v⟩∣≤∥u∥∥v∥.

Proof

1.1givenF1F2algebra

For Hermitian A,B, Tr⁡(AB)‾=Tr⁡((AB)∗)=Tr⁡(BA)=Tr⁡(AB) by [F2]. The trace is additive and real-homogeneous, so the pairing is real-valued, symmetric, and real-bilinear.

2.1F3step 1.1algebra

Diagonalize A∈Hd by [F3] with real eigenvalues λ1,…,λd. Then Tr⁡(A2)=∑jλj2≥0, with equality exactly when all λj=0, hence exactly when A=0. This proves positive definiteness and the displayed square-root formula.

3.1F1F2step 1.1step 2.1F4algebra∎

For c∈Rm, bilinearity gives cTGc=Tr⁡((Sc)2)=∥Sc∥HS2≥0. For X∈Hd, the vector v with coordinates va=Tr⁡(FaX) satisfies ⟨Sc,X⟩HS=cTv for every c, so it is S∗X. By [F2], va=Tr⁡(XFa); hence the matrix of S∗S is precisely G. The equality ⟨c,Gc⟩=∥Sc∥HS2 implies ker⁡G=ker⁡S: Sc=0 gives Gc=0, while Gc=0 gives ∥Sc∥HS2=0 and hence Sc=0 by step 2.1. By [F4], ∣⟨A,B⟩HS∣≤∥A∥HS∥B∥HS; expanding ∥A+B∥HS2 and applying this bound gives ∥A+B∥HS≤∥A∥HS+∥B∥HS. Thus the formula is a norm.

Depends on

Dependency tree · 2 levels

Sources