Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge 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.

Hermitian dilation for a rectangular linear system

Statement

For A:Cn→Cm, define HA:Cm⊕Cn→Cm⊕Cn using the adjoint A∗ of The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V by HA(x,y)=(Ay,A∗x). Then HA is Hermitian; its nonzero eigenvalues are +σj,−σj for the positive singular values of A, its kernel is ker⁡(A∗)⊕ker⁡(A), and HA+(b,0)=(0,A+b). When A has positive rank, its nonzero condition number is preserved; the output is tagged in the domain summand.

Facts & Assumptions

Given: A finite-dimensional map A and its singular system.

[F1]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: A has orthonormal singular pairs (uj,vj) with positive values σj; in these bases its matrix is diagonal with entries σj and zero on the remaining coordinates.

[F2]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: ⟨Ax,y⟩=⟨x,A∗y⟩, so the adjoint of a block matrix swaps the blocks and takes their adjoints.

[F3]

The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations: a pseudoinverse G satisfies HGH=H, GHG=G, and HG,GH are self-adjoint; Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: each finite matrix has exactly one such pseudoinverse.

Proof

1.1givenF2algebra

The block matrix of HA is (0AA∗0). Its adjoint, by [F2], is the same block matrix, so HA∗=HA.

1.2F1algebra

Multiplying the SVD in [F1] gives Avj=σjuj and A∗uj=σjvj. Therefore HA(uj,vj)=σj(uj,vj) and HA(uj,−vj)=−σj(uj,−vj). After division by 2 these are unit eigenvectors. Orthonormality of the singular pairs makes all such vectors mutually orthogonal.

1.3F1F3algebra

In the SVD bases, write A=UΣV∗ with positive diagonal entries σj. The diagonal matrix Σ+ that replaces each positive entry by 1/σj and leaves zero entries zero satisfies ΣΣ+Σ=Σ, Σ+ΣΣ+=Σ+, and both products ΣΣ+ and Σ+Σ are diagonal projections. Unitary transport shows VΣ+U∗ satisfies the four equations in [F3], so uniqueness gives A+=VΣ+U∗ and A+uj=vj/σj.

2.1step 1.2algebra

The equation HA(x,y)=0 is equivalent to Ay=0 and A∗x=0, so ker⁡HA=ker⁡(A∗)⊕ker⁡(A). Together with step 1.2, the nonzero eigenvalue magnitudes are exactly the positive singular values, each appearing with both signs. Thus when there is positive rank their maximum-to-minimum ratio is unchanged.

3.1F1F3step 1.2step 2.1step 1.3algebra∎

The vectors from step 1.2 together with orthonormal bases of ker⁡(A∗) and ker⁡(A) form an orthonormal eigenbasis of the direct sum. Define G on this basis by Gwj,+=wj,+/σj, Gwj,−=−wj,−/σj, and G=0 on the kernel. Then HAG and GHA are self-adjoint projections, while diagonal multiplication gives HAGHA=HA and GHAG=G. Thus G satisfies [F3], and uniqueness gives G=HA+. Since (uj,0)=(wj,++wj,−)/2, this definition gives HA+(uj,0)=(0,vj/σj). Complete the positive left singular vectors to the left singular basis from [F1]. The remaining basis vectors have zero singular coordinates, so the diagonal SVD gives A∗uj=0 for each; hence they span the complementary part ker⁡(A∗). Thus every b∈Cm has a decomposition b=∑j:σj>0βjuj+b0 with b0∈ker⁡(A∗). Since A∗b0=0, its positive left-singular coordinates vanish, so Σ+U∗b0=0 and the formula in step 1.3 gives A+b0=0. By step 2.1 (b0,0)∈ker⁡(HA), so HA+(b0,0)=G(b0,0)=0. Applying the positive-pair calculation to the other summands gives HA+(b,0)=(0,A+b) for arbitrary b, including b∉ran⁡(A).

Depends on

Used by

Dependency tree · two levels

18 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