{"title":"Frame dimension functions and phase retrievability","authors":"Deguang Han, Kai Liu","doi":"10.1007/s43036-024-00331-y","DOIUrl":null,"url":null,"abstract":"<div><p>The frame dimension function of a frame <span>\\({{\\mathcal {F}}}= \\{f_j\\}_{j=1}^{n}\\)</span> for an <i>n</i>-dimensional Hilbert space <i>H</i> is the function <span>\\(d_{{{\\mathcal {F}}}}(x) = \\dim {\\textrm{span}}\\{ \\langle x, f_{j}\\rangle f_{j}: j=1,\\ldots , N\\}, 0\\ne x\\in H.\\)</span> It is known that <span>\\({{\\mathcal {F}}}\\)</span> does phase retrieval for an <i>n</i>-dimensional real Hilbert space <i>H</i> if and only if <span>\\({\\textrm{range}} (d_{{{\\mathcal {F}}}}) = \\{ n\\}.\\)</span> This indicates that the range of the dimension function is one of the good candidates to measure the phase retrievability for an arbitrary frame. In this paper we investigate some structural properties for the range of the dimension function, and examine the connections among different exactness of a frame with respect to its PR-redundance, dimension function and range of the dimension function. A subset <span>\\(\\Omega \\)</span> of <span>\\(\\{1,\\ldots , n\\}\\)</span> containing <i>n</i> is attainable if <span>\\({\\textrm{range}} (d_{{{\\mathcal {F}}}}) = \\Omega \\)</span> for some frame <span>\\({{\\mathcal {F}}}.\\)</span> With the help of linearly connected frames, we show that, while not every <span>\\(\\Omega \\)</span> is attainable, every (integer) interval containing <i>n</i> is always attainable by an <i>n</i>-linearly independent frame. Consequently, <span>\\({\\textrm{range}}(d_{{{\\mathcal {F}}}})\\)</span> is an interval for every generic frame for <span>\\({\\mathbb {R}}\\,^n.\\)</span> Additionally, we also discuss and post some questions related to the connections among ranges of the dimension functions, linearly connected frames and maximal phase retrievable subspaces.</p></div>","PeriodicalId":44371,"journal":{"name":"Advances in Operator Theory","volume":"9 2","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Operator Theory","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s43036-024-00331-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The frame dimension function of a frame \({{\mathcal {F}}}= \{f_j\}_{j=1}^{n}\) for an n-dimensional Hilbert space H is the function \(d_{{{\mathcal {F}}}}(x) = \dim {\textrm{span}}\{ \langle x, f_{j}\rangle f_{j}: j=1,\ldots , N\}, 0\ne x\in H.\) It is known that \({{\mathcal {F}}}\) does phase retrieval for an n-dimensional real Hilbert space H if and only if \({\textrm{range}} (d_{{{\mathcal {F}}}}) = \{ n\}.\) This indicates that the range of the dimension function is one of the good candidates to measure the phase retrievability for an arbitrary frame. In this paper we investigate some structural properties for the range of the dimension function, and examine the connections among different exactness of a frame with respect to its PR-redundance, dimension function and range of the dimension function. A subset \(\Omega \) of \(\{1,\ldots , n\}\) containing n is attainable if \({\textrm{range}} (d_{{{\mathcal {F}}}}) = \Omega \) for some frame \({{\mathcal {F}}}.\) With the help of linearly connected frames, we show that, while not every \(\Omega \) is attainable, every (integer) interval containing n is always attainable by an n-linearly independent frame. Consequently, \({\textrm{range}}(d_{{{\mathcal {F}}}})\) is an interval for every generic frame for \({\mathbb {R}}\,^n.\) Additionally, we also discuss and post some questions related to the connections among ranges of the dimension functions, linearly connected frames and maximal phase retrievable subspaces.