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.
Polar correction of a near-unitary matrix
Statement
Let be unitary on a nonzero finite-dimensional complex inner-product space and let be an endomorphism with . Then is invertible and its polar unitary satisfies . The inverse square root is defined by the positive spectral square root. When has effectively computable entries in fixed dimension, the inverse square root also has an effective matrix approximation: expand at , whose norm is less than , and truncate the absolutely convergent binomial series.
Facts & Assumptions
Given: A finite-dimensional space, a unitary , and .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional normal endomorphism has an orthonormal eigenbasis.
The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector: the operator norm is the largest singular value.
Proof
For every vector , . Thus is injective and hence bijective in finite equal dimension. The eigenvalues of are , where each singular value obeys by the triangle inequality and [F2].
By [F1], define by applying the positive scalar inverse-square-root to its positive eigenvalues. Then , so is unitary; moreover the singular-value decomposition, obtained by diagonalizing , gives . Consequently . Finally, has norm at most ; the binomial series for converges absolutely in operator norm, and its geometric tail bound gives effective truncations from effective entries of .
Depends on
Used by
Dependency tree · two levels
9 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)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)