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.
Inverse compression for positive resolvents
Statement
Let be finite-dimensional complex inner-product spaces, let be positive definite, and let satisfy . For every ,
where means that is non-negative. If , both sides are the unique endomorphism of .
Facts & Assumptions
Given: The spaces , the positive definite operator , the isometry , and in the Statement.
Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, conjugate-linear in its second, and positive definite.
Non-negative and positive operators: positive definiteness means self-adjointness and strictly positive quadratic form on nonzero vectors.
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: non-negative operators are self-adjoint with nonnegative quadratic form.
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.
Proof
All adjoints of the finite-dimensional linear maps used below exist uniquely by [F5]. Let be positive definite on a finite-dimensional space and any vector. The operator is injective by [F3], hence invertible in finite dimension; put . Expanding with [F1]–[F2] gives . The last term is nonnegative by [F3] and vanishes at , so .
If the assertion is immediate. Otherwise fix , put and . By [F2] and , , which is positive definite. Restrict the maximum in step 1.1 to ; the isometry identity gives and . Hence . This holds for every , so the self-adjoint operator difference is non-negative by [F4], proving the order inequality.
Depends on
- Real and complex inner-product spaces and their induced length
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Non-negative and positive operators
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
Used by
Dependency tree · two levels
16 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
- John Watrous, The Theory of Quantum Information, §5.2.3 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, §11.8 (standard reference, not scraped)