Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Realification preserves Hermitian spectra, norms, and congruence

Statement

For m,n,p∈N and Z=X+iY∈Cm×n with real X,Y, define its realification

R(Z)=(X−YYX)∈R2m×2n.

Use the standard coordinate inner products ⟨z,w⟩=∑jzjwj‾ on Ck and ⟨x,y⟩=∑jxjyj on Rk, with their induced 2-norms. For compatible Z∈Cm×n and W∈Cn×p,

R(ZW)=R(Z)R(W).

For any Z∈Cm×n, R(Z∗)=R(Z)T. For square Z∈Cn×n, Z is invertible exactly when R(Z) is invertible. If H=H∗ is Hermitian with eigenvalues λ1,…,λn counted with multiplicity, then R(H) is real symmetric with eigenvalue multiset {λj,λj:1≤j≤n}. For every complex matrix E∈Cm×n, ∥R(E)∥2=∥E∥2.

Facts & Assumptions

Given: Finite complex matrices Z,W,E of the shapes in the statement and a Hermitian square matrix H.

[F3]

Rank-nullity implies that an injective endomorphism of a finite-dimensional space is surjective (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F4]

The operator norm is induced by the vector norms on finite-dimensional real or complex inner-product spaces (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F5]

The real coordinate inner product is ⟨x,y⟩=∑jxjyj (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F6]

Complex inner products are linear in the first variable, conjugate-linear in the second, and induce the norm ∥z∥=⟨z,z⟩ (Real and complex inner-product spaces and their induced length).

[F7]

In orthonormal coordinate 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).

Proof

1.1givenF6F7algebra

Identify z=x+iy∈Cn with (x,y)∈R2n. For any Z=X+iY∈Cm×n, direct multiplication gives R(Z)(x,y)=(ℜ(Zz),ℑ(Zz)), so realification respects every compatible product. The displayed inner products make the standard coordinate bases orthonormal, so [F7] gives Z∗=XT−iYT and R(Z∗)=(XTYT−YTXT)=R(Z)T.

2.1F3F4F5F6step 1.1algebra

For z=x+iy, ∥z∥22=∑j∣xj+iyj∣2=∑j(xj2+yj2)=∥(x,y)∥22 by [F5, F6]. Thus for n>0 the identification bijects the complex and real unit spheres, so the maxima in [F4] coincide for E and R(E). If n=0, both operator norms are zero by [F4]. If square Z is invertible, R(Z−1) is an inverse of R(Z) by step 1.1; conversely, if R(Z) is invertible, its kernel is zero, so Zz=0 implies z=0, and [F3] makes Z invertible.

3.1F1F2F7step 1.1algebra∎

If n=0, the spectral assertion is immediate. Otherwise, [F7] identifies the Hermitian matrix H=H∗ with a self-adjoint endomorphism in the standard orthonormal basis; [F2] makes it normal, so [F1] gives H=UΛU∗ with U unitary and Λ=diag⁡(λ1,…,λn) real. By step 1.1, R(U) is real orthogonal and R(H)=R(U)R(Λ)R(U)T, where R(Λ)=diag⁡(Λ,Λ). Hence R(H) is real symmetric with each eigenvalue of H repeated twice.

Depends on

Used by

Dependency tree · two levels

38 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