The Resolvent Transform of Square-Integrable Tuples: Consistency, Concatenation, the Lipschitz Bound and Universal Polynomial Recovery
lemmaAnalysislem:l2-resolvent-transform-basic-2026aThe resolvent transform of tuples is consistent with the bounded one, respects concatenation, is 1-Lipschitz in , and a fixed sequence of polynomials recovers every self-adjoint vector from its transform.
In the setting of Tracial W*-Probability Spaces and Square-Integrable Tuples: Standing Notation, let . Resolvent transforms of tuples and of self-adjoint vectors are those of The Resolvent of a Self-Adjoint Vector and the Resolvent Transform of a Square-Integrable Tuple, and resolvent transforms of self-adjoint tuples in are those of Resolvents of Bounded Self-Adjoint Operators and the Resolvent Transform of a Self-Adjoint Tuple §transform; vacuum tuples of self-adjoint tuples in are those of Tracial W*-Probability Spaces and Square-Integrable Tuples: Standing Notation §tuples; and is the value of at an -tuple in as in Noncommutative Laws, Couplings and the Wasserstein Distance: Standing Notation §polynomials.
1. (Consistency and concatenation)¶ Let be a tracial W*-probability space and let be an -tuple and an -tuple of it. Then is a self-adjoint -tuple in whose entries have operator norm at most ; for every self-adjoint -tuple in ; and is the -tuple .
2. (Lipschitz bound)¶ For every tracial W*-probability space and all -tuples of it, and are -tuples and .
3. (Universal polynomial recovery)¶ There is a sequence in such that, for every tracial W*-probability space and every , the sequence converges to in .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.