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.
Error Cancellation in an SU(2) Commutator
Statement
Let and , with and . Then
Facts & Assumptions
Given: Four unitary matrices with the stated distances, where .
The operator norm is defined as the maximum over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
The operator norm is submultiplicative (The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).
Proof
From [F1], left multiplication by a unitary preserves norm because for each unit vector ; right multiplication preserves norm because maps the unit sphere bijectively to itself. Taking also gives . Set and . Then are unitary, , and .
Keeping fixed, the commutator difference caused by replacing by is . Unitary left and right multiplication from [F1] leave its norm equal to . Since , . Unitary norm invariance, , and bound this by ; the equality follows from .
After the first replacement, keep fixed and replace by . The commutator difference is . The expansion in step 2.1, with in place of , bounds its norm by , since . The operator-norm triangle inequality follows from [F1] and the vector triangle inequality by taking the maximum over unit vectors. Combining the two replacements gives because .
Depends on
Used by
Dependency tree · two levels
11 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
- Christopher M. Dawson and Michael A. Nielsen, The Solovay–Kitaev Algorithm, arXiv:quant-ph/0505030v2 (standard reference, not scraped)
- Dieter van Melkebeek and Thomas Watson, Time-Space Efficient Simulations of Quantum Computations (standard reference, not scraped)