Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Normalization and nonzero success weight of the supported pseudoinverse target

Statement

In the block-encoded QLSP model, let ∣b⟩ be the normalized codomain input, let ∥A∥op≤α, and suppose ∣b⟩=∑j=1rβj∣uj⟩ is supported on positive singular values σj≥γ>0. Then (δ/2)Aˉ+∣b⟩∥(δ/2)Aˉ+∣b⟩∥=A+∣b⟩∥A+∣b⟩∥,∥(δ/2)Aˉ+∣b⟩∥2≥δ24,δ=γ/α,Aˉ=A/α. In particular the ideal inverse-branch success probability is positive and has the stated crude lower bound.

Facts & Assumptions

Given: The finite-dimensional map and singular-gap promise of Block-encoded QLSP input and singular-gap promise, with ∥b∥=1.

[F1]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: there are orthonormal singular vectors uj,vj and positive singular values σj with Avj=σjuj on the supported singular subspace.

[F2]

Quantum linear-systems state-output task: the normalized input has b≠0, b∈ran⁡A, and every nonzero supported singular coefficient has σj≥γ.

[F3]

The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations: B=A+ exactly when ABA=A, BAB=B, and AB,BA are self-adjoint.

[F4]

Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: the matrix satisfying the four Penrose equations exists and is unique.

[F5]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: on a nonzero finite-dimensional domain, ∥A∥op is the maximum of ∥Av∥ over unit vectors v.

Proof

1.1givenF1F3F4constructalgebra

By [F1], in ordered orthonormal singular bases write A=UΣV∗ with positive diagonal entries σ1,…,σr. Define B=VΣ+U∗ by replacing each positive σj with 1/σj and leaving zeros zero. Direct multiplication gives ABA=A, BAB=B, AB=Udiag⁡(Ir,0)U∗ and BA=Vdiag⁡(Ir,0)V∗, both self-adjoint. Thus [F3] makes B a Moore–Penrose inverse, and [F4] gives B=A+=∑jσj−1∣vj⟩⟨uj∣.

2.1givenF1F2F5step 1.1algebra

Since b is normalized and its coefficients in the orthonormal singular vectors are βj, ∑j∣βj∣2=1. Each vj is a unit vector and Avj=σjuj, so [F1] and [F5] give σj=∥Avj∥≤∥A∥op≤α. Step 1.1 therefore yields ∥A+b∥2=∑j∣βj∣2/σj2≥α−2>0. Thus its normalized state is defined.

2.2givenF1step 1.1algebra

The singular values of Aˉ=A/α are σj/α with the same left and right vectors. Repeating the construction in step 1.1 gives (A/α)+=αA+ because α>0. Hence (δ/2)Aˉ+b=(γ/2)A+b, and multiplication by the positive scalar γ/2 preserves the normalized vector.

3.1givenF1F2F5step 2.2algebra∎

By [F2], coefficients outside the supported positive singular subspace vanish. By [F1] and [F5], each unit right singular vector satisfies σj=∥Avj∥≤∥A∥op≤α. Since δ=γ/α, step 2.2 gives ∥(δ/2)Aˉ+b∥2=∑j=1r∣βj∣2(γ/(2σj))2≥∑j=1r∣βj∣2γ2/(4α2)=δ2/4. This is the ideal QSVT flag weight; any implementation error requires a separate error budget.

Depends on

Used by

Cited to discharge well-definedness by Block-encoded QLSP input and singular-gap promise.

Dependency tree · two levels

27 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