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

Operator-norm error bounds a basis-outcome probability change

Statement

Let V be a nonzero finite-dimensional complex inner-product space with a finite orthonormal basis (ey)y∈Y. Let ψ∈V be unit, let U,W:V→V be unitary, and let ρ≥0 satisfy ∥W−U∥op≤ρ. If pU(y) and pW(y) are the computational-basis measurement probabilities after applying U and W to ψ, respectively, then for every y∈Y, ∣pW(y)−pU(y)∣≤2ρ.

Facts & Assumptions

Given: The space, orthonormal basis, unit vector, two unitary maps, and operator-norm bound in the Statement.

[F1]

The measurement law for a finite continuous-time walk: for a unit vector v, the probability of basis outcome y is ∣⟨v,ey⟩∣2.

[F2]

Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis: for one unit vector ey, ∣⟨v,ey⟩∣2≤∥v∥2.

[F3]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| defines ∥T∥op as the maximum of ∥Tv∥ over unit v on a nonzero finite-dimensional domain; The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector proves that this maximum exists and is attained.

[F4]

Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary is a linear isometry and preserves every vector norm.

[F5]

Real and imaginary parts, complex conjugation, and modulus: if z=a+ib, then ∣z∣=a2+b2.

[F6]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: the Euclidean norm on R2 satisfies the triangle inequality. Under the coordinates z↦(Re⁡z,Im⁡z) this gives ∣z1+z2∣≤∣z1∣+∣z2∣ for complex numbers.

Proof

technique · direct
1.1givenF3construct

Put δ:=(W−U)ψ. Since ψ is unit, [F3] and the operator-norm hypothesis give ∥δ∥≤ρ.

2.1givenF2F4step 1.1

Fix y and put a:=⟨Wψ,ey⟩ and b:=⟨Uψ,ey⟩. By [F2] applied to δ, ∣a−b∣≤∥δ∥. By [F4], Wψ and Uψ are unit; [F2] then gives ∣a∣≤1 and ∣b∣≤1.

3.1F1F5F6step 1.1step 2.1algebra∎

The triangle inequality [F5]–[F6] implies the reverse triangle inequality ∣∣a∣−∣b∣∣≤∣a−b∣. Factoring the difference of squares and using step 2.1 gives ∣∣a∣2−∣b∣2∣≤∣a−b∣(∣a∣+∣b∣)≤2ρ. By [F1], the left side is ∣pW(y)−pU(y)∣. Since y was arbitrary, the claimed bound holds for every basis outcome.

Depends on

Used by

Dependency tree · two levels

38 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