Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Cosine-Sine Block Decomposition

Statement

Let k≥1 and let U∈U(2k) be partitioned into k×k blocks U=(ABCD). There are block-diagonal unitaries L=diag⁡(L0,L1) and R=diag⁡(R0,R1) and nonnegative real diagonal matrices C0,S0 such that U=L(C0−S0S0C0)R,C02+S02=I,0≤C0,S0≤I. The singular values at 0 and 1 are allowed, with no nondegeneracy assumption.

Facts & Assumptions

Given: An integer k≥1 and a unitary matrix U∈M2k(C) partitioned as in the Statement.

[F1]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: a linear map between finite-dimensional real or complex inner-product spaces has orthonormal bases in which it is diagonal with nonnegative singular values, including zero values.

[F2]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique adjoint.

[F3]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional real or complex inner-product space has an orthonormal basis.

Proof

1.1givenF1F2algebra

Apply [F1] to A to obtain unitary L0,R0 and C0=diag⁡(c1,…,ck) with A=L0C0R0∗ and ci≥0. Since A is the compression of the unitary U to the first block, ∥Av∥≤∥v∥ for every v, so each singular value satisfies ci≤1. Put S0=diag⁡(si) with si=1−ci2.

2.1F3step 1.1algebra

The first block row of UU∗=I gives AA∗+BB∗=I, hence (L0∗B)(L0∗B)∗=S02. For every i with si>0, the row si−1ei∗L0∗B has norm one, and these rows are mutually orthogonal by the displayed Gram identity. Extend them to an orthonormal basis using [F3], and choose the signs of the completed rows so that a unitary W satisfies L0∗B=−S0W∗.

3.1F3step 1.1step 2.1algebra

The first block column of U∗U=I gives A∗A+C∗C=I, hence (CR0)∗(CR0)=S02. For every i with si>0, the column si−1CR0ei has norm one, and these columns are mutually orthogonal. Extend them to an orthonormal basis using [F3]; the resulting unitary Z satisfies CR0=ZS0. Therefore U~:=diag⁡(L0∗,Z∗)Udiag⁡(R0,W)=(C0−S0S0E) for some E.

4.1step 3.1algebra

The upper-right block of U~U~∗=I gives S0E∗=C0S0. Thus, for each i with si>0, column i of E is ciei. The lower-right blocks of U~U~∗=I and U~∗U~=I give EE∗=E∗E=C02. For such i, the prescribed entry Eii=ci already contributes ci2 to row i's squared norm, so EE∗=C02 forces every other entry in that row to vanish. Thus both the rows and columns indexed by P={i:si>0} have no cross-block entries. On K={i:si=0} one has ci=1; the K×K block of E has orthonormal rows and columns and is therefore unitary. This also covers ci=0, where the corresponding row and column are zero, and ci=1, where the index belongs to K.

5.1step 4.1step 3.1algebra∎

Let Q be that unitary K×K block and replace Z by Z′=Zdiag⁡(I,Q). Since Q acts only where S0=0 and C0=I, this leaves CR0=Z′S0 unchanged and changes the lower-right block to C0. Hence U=diag⁡(L0,Z′)(C0−S0S0C0)diag⁡(R0∗,W∗). Both outside factors are unitary, and C02+S02=I by definition. The argument includes ci=0, ci=1, repeated values, and empty positive or zero supports.

Depends on

Used by

Dependency tree · two levels

12 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