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 error adds under finite unitary products
Statement
Let and be unitary operators on the same finite-dimensional Hilbert space, and suppose with . With empty products equal to the identity and empty sums equal to zero,
Facts & Assumptions
Given: Two finite lists of unitaries on one finite-dimensional Hilbert space and their individual error bounds.
The operator norm is induced by the Hilbert-space norm, and a unitary preserves that vector norm. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
The operator norm is submultiplicative. On a nonzero Hilbert space, for a unitary , its norm and the norm of are both by [F1], so submultiplicativity gives by applying the same upper bound to and the reverse bound to . The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
Proof
If , both products are , so their difference is zero and the empty sum is zero. This is the claimed bound in the empty case.
If the Hilbert space is zero-dimensional, its unique endomorphism has norm zero, so the product difference is zero and the claimed bound holds. Otherwise, for , insert and subtract mixed products to obtain Expansion cancels adjacent terms and leaves exactly the left side. Each outer product is unitary and has norm one by [F1]; [F2] and the unitary invariance derived there show that each summand has norm at most . The operator-norm triangle inequality then gives the stated sum.
Depends on
Used by
Dependency tree · two levels
8 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
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)