Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Comparing Two Generalized Noncommutative Nevanlinna-Pick Theorems (1512.01308v3)

Published 4 Dec 2015 in math.OA

Abstract: We explore the relationship between two noncommutative generalizations of the classical Nevanlinna-Pick theorem: one proved by Constantinescu and Johnson in 2003 and the other proved by Muhly and Solel in 2004. To make the comparison, we generalize Constantinescu and Johnson's theorem to the context of W*-correspondences and Hardy algebras. After formulating the so-called displacement equation in this context, we are able to follow Constantinescu and Johnson's line of reasoning in our proof. Though our result is similar in appearance to Muhly and Solel's, closer inspection reveals differences. Nevertheless, when the given data lie in the center of the dual correspondence, the theorems are essentially the same.

Summary

We haven't generated a summary for this paper yet.