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

Operator perturbation bound for QSVT

Statement

Let A,B:HR→HL be contractions between the same finite-dimensional complex-inner-product spaces, let P be the scalar polynomial of an exact degree-d QSVT phase sequence, and put δ=∥A−B∥op. Then, for the corresponding odd or even singular-value transforms,

∥PSV(A)−PSV(B)∥op≤4dδ.

For d=0 the transform is constant on the relevant singular space and the difference is zero. The lemma is an operator statement; the unitary completions used in the proof are finite-dimensional existence constructions and do not supply an efficient implementation or any additional query access.

Facts & Assumptions

Given: Same-dimension contractions A,B:HR→HL and an exact degree-d QSVT phase sequence with scalar polynomial P.

[F1]

Projected-unitary encoding and singular vectors: a PUE compression has singular values in [0,1] and its finite SVD uses orthonormal left and right bases.

[F2]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional map has complete orthonormal singular bases and a positive-term SVD formula.

[F3]

QSVT action on singular subspaces: for any PUE realization of a contraction C, the phase sequence's projected block is PSV(C).

[F4]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum action on unit vectors, and the zero-domain norm is zero.

[F6]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: range and orthogonal-complement components give the orthogonal decomposition defining a projection.

[F7]

Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.

[F11]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: ∥ST∥op≤∥S∥op∥T∥op.

Proof

1.1F1F2F4algebra

If either HR or HL is zero, both maps are zero and the odd transforms agree; when HR=0 the even right transforms are also the same scalar map on the zero space, and when HL=0 the even right transforms are P(0)IHR for both. The inequality is then immediate. Assume both dimensions are positive. Let m=dim⁡HL, n=dim⁡HR, q=min⁡(m,n), and extend an SVD of any contraction C:HR→HL to orthonormal bases u1,…,um and v1,…,vn, with σj=0 for any missing singular values up to q.

1.2F1F2F4F6F7F10constructalgebra

On K=HL⊕HR, choose orthonormal input bases a1,…,am in the first summand and v1,…,vn in the second, and output bases u1,…,um and b1,…,bn in the two summands. For 1≤j≤q, define VCaj=1−σj2 uj−σjbj and VCvj=σjuj+1−σj2 bj. These two images are orthonormal by direct expansion; map any remaining aj to the corresponding unused uj, and any remaining vj to the corresponding unused bj. The resulting images form an orthonormal basis, so VC is unitary. If ΠR0 projects onto the second summand and ΠL0 onto the first, then ΠL0VCΠR0∣HR=C by the SVD formula. Thus every finite contraction has a PUE unitary completion with fixed subspaces of dimensions n,m.

2.1F1F2F4F8F9F10step 1.2constructalgebra

Let δ>0 and set D=(B−A)/δ. Homogeneity of the operator norm gives ∥D∥op=1, so D is a contraction. By step 1.2, choose unitary completions VA,VD of A,D on the same K with the same projectors ΠR0,ΠL0. On K⊕K, let V=VA⊕VD and let ΠR,ΠL select the right and left subspaces, respectively, in the first copy only. Put c=(1+δ)−1/2, s=δ/(1+δ), and W=(cI−sIsIcI); c2+s2=1 makes W unitary. For x in the first-copy right subspace, W(x,0)=(cx,sx), V maps this to (cVAx,sVDx), and W∗ returns first component c2VAx+s2VDx. Projection to the first-copy left subspace therefore gives c2Ax+s2Dx=(A+δD)x/(1+δ)=Bx/(1+δ). Since V and W are unitary, [F8]–[F9] show V′=W∗VW is unitary; it is a PUE completion of B/(1+δ) for the same projectors.

3.1F4F5F10step 2.1algebra

Direct multiplication gives (W−I)∗(W−I)=2(1−c)I, hence ∥W−I∥op=2−2c. With t=1+δ≥1, the inequality 2−2/t≤t2−1 follows from (t−1)2(t+2)≥0, so ∥W−I∥op≤δ. For every unit x, write Vx−W∗VWx=(I−W∗)Vx+W∗V(I−W)x. By [F10], V and W∗ preserve norms; the two summands therefore have norms at most ∥W−I∥op. Using [F5] and [F4] gives ∥V−V′∥op≤2δ.

4.1F3F4F5F6F7F10F11step 2.1step 3.1algebra

The exact QSVT phase product contains d signal factors, each either V or V∗; its remaining phase factors are identical for V and V′. Telescoping the two products one signal factor at a time gives operator-norm difference at most d∥V−V′∥op: the factor differences for V have that norm, and for V∗ the identity V∗−V′∗=V∗(V′−V)V′∗ plus [F10]–[F11] gives the same norm; multiplying by unchanged unitary factors preserves the bound. Compression by orthogonal projections cannot increase the bound, since projections are contractions by [F6]–[F7]. By [F3], the compressed blocks are PSV(A) and PSV(B/(1+δ)). Steps 2.1 and 3.1 therefore give ∥PSV(A)−PSV(B/(1+δ))∥op≤2dδ.

5.1F3F4F5step 1.2step 2.1step 3.1step 4.1algebra∎

For the second comparison, use step 1.2 to choose completions VB,V0 of B and the zero map on the same K, and put T=VB⊕V0. With the same projectors and the same W,c,s from step 2.1, T compresses to B, while W∗TW compresses to c2B+s20=B/(1+δ). The calculation of step 3.1 gives ∥T−W∗TW∥op≤2δ; the telescoping and compression argument of step 4.1 therefore gives ∥PSV(B)−PSV(B/(1+δ))∥op≤2dδ. Combining this with step 4.1 by the triangle inequality proves the asserted 4dδ bound. If δ=0 the two transforms are identical, and if d=0 the transform is independent of the input; both cases satisfy the same bound.

Depends on

Used by

Dependency tree · two levels

44 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