2020
DOI: 10.48550/arxiv.2005.09614
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Every complete Pick space satisfies the column-row property

Michael Hartz

Abstract: In the theory of complete Pick spaces, the column-row property has appeared in a variety of contexts. We show that it is satisfied by every complete Pick space in the following strong form: each sequence of multipliers that induces a contractive column multiplication operator also induces a contractive row multiplication operator. In combination with known results, this yields a number of consequences. Firstly, we obtain multiple applications to the theory of weak product spaces, including factorization, multi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…A combination of Theorem 1.3 of [36] and of Theorem 1.2 of [31] implies that if a Hilbert function space has a normalized complete Pick kernel, then for every h ∈ H ⊙ H, there is a pair of functions f, g ∈ H such that h = f g and h H⊙H = f g . It turns out that subinner/free outer pairs are relevant in this context as well.…”
Section: Definition 12 (A) a Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…A combination of Theorem 1.3 of [36] and of Theorem 1.2 of [31] implies that if a Hilbert function space has a normalized complete Pick kernel, then for every h ∈ H ⊙ H, there is a pair of functions f, g ∈ H such that h = f g and h H⊙H = f g . It turns out that subinner/free outer pairs are relevant in this context as well.…”
Section: Definition 12 (A) a Functionmentioning
confidence: 99%
“…By scaling h, we may assume that h H⊙H = 1. As mentioned in the Introduction, by the factorization result of Jury and Martin and the fact that H has the column-row property with constant 1 (Theorem 1.3 of [36] and Theorem 1.2 of [31]), there exist g 1 , g 2 ∈ H with g 1 = g 2 = 1 and…”
Section: Weak Productsmentioning
confidence: 99%
“…Our next goal is to prove Theorem 1.1 in general. To this end, we use a variant of the Schur algorithm, somewhat similar to the proof of the main result in [13].…”
Section: Von Neumann's Inequality Up To a Constantmentioning
confidence: 99%
“…This is a highly non trivial theorem, proved first in [2] as a consequence of the positive solution of the Kadison-Singer problem [9] and then in [8] using different methods. The first condition is usually called weak separation and the second simply bounded Grammian condition.…”
Section: Introductionmentioning
confidence: 99%