Alphabeta Math
LemmaStatement: 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.

Hermitian block-encoding signal subspaces

Statement

Let (U,J,α) be an exact Hermitian block encoding from Qubitization access model, and choose an orthonormal eigenbasis Kψj=λjψj. Put xj=λj/α and sj=1−xj2. For ∣xj∣<1, define ηj=(I−Π)UJψj/sj,η~j=(I−Π)U∗Jψj/sj. The ηj are orthonormal in ker⁡Π, as are the η~j. In the paired input basis (Jψj,η~j) and output basis (Jψj,ηj), U has matrix (xjsjsj−xj). The unitary U∗ maps in the reverse direction by the same matrix. If ∣xj∣=1, the complement is absent and UJψj=xjJψj=U∗Jψj; no division by zero is used. The value xj=0 is an ordinary two-dimensional signal plane.

Facts & Assumptions

Given: A finite-dimensional self-adjoint K, an exact block encoding, and the associated signal projector Π.

[F1]

Qubitization access model: J∗UJ=K/α and Π=JJ∗; taking adjoints and using K=K∗ gives J∗U∗J=K/α.

[F2]

PUE singular-space invariant decomposition: the positive singular pairs of a projected unitary give orthogonal paired two-dimensional subspaces; their endpoint complements are absent.

[F3]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional self-adjoint endomorphism has an orthonormal eigenbasis with real eigenvalues.

[F4]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: ⟨Tx,y⟩=⟨x,T∗y⟩, so a unitary and its adjoint preserve inner products.

[F5]

Finite block encoding: the normalized compression has operator norm at most one, hence ∣λj/α∣≤1.

Proof

Given: As in Facts & Assumptions.

1.1givenF1F4F5algebra

Fix an eigenvector ψj with unit norm and write vj=Jψj. From [F1], ΠUvj=xjvj and ΠU∗vj=xjvj, because K=K∗. Since U,U∗ preserve norm, orthogonal decomposition by Π gives ∥(I−Π)Uvj∥2=∥(I−Π)U∗vj∥2=1−xj2=sj2. For ∣xj∣<1, the displayed ηj,η~j are therefore unit vectors in ker⁡Π.

2.1F1F3F4step 1.1algebra

If i≠j, orthogonality of eigenvectors and [F4] give ⟨Uvi,Uvj⟩=⟨vi,vj⟩=0, while ⟨ΠUvi,ΠUvj⟩=xixj⟨vi,vj⟩=0. Subtracting the projected components shows ⟨ηi,ηj⟩=0; the same calculation for U∗ proves orthogonality of the η~j.

2.2F1F4step 1.1algebra

Decomposing Uvj into its Π and I−Π parts gives Uvj=xjvj+sjηj. Also sjUη~j=U(I−Π)U∗vj=vj−UΠU∗vj=vj−xjUvj=sj2vj−xjsjηj. Division by sj>0 yields Uη~j=sjvj−xjηj, which is the second column of the displayed matrix. Taking adjoints gives the reverse-basis action of U∗.

3.1F1F2F3step 1.1algebra∎

If ∣xj∣=1, the orthogonal complement of ΠUvj=xjvj has squared norm 1−∣xj∣2=0, so Uvj=xjvj; the same argument for U∗ gives U∗vj=xjvj. Thus the endpoint plane collapses. At xj=0, step 1.1 has sj=1, so both normalized vectors are well-defined. The mutually orthogonal paired spaces and endpoint lines exhaust the clean input and output signal spaces by the SVD decomposition in [F2]; their orthogonal residual complements stay in ker⁡Π and cannot contribute to the clean compression.

Depends on

Used by

Dependency tree · two levels

34 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