Article
Version 1
Preserved in Portico This version is not peer-reviewed
Functional Kuppinger-Durisi-Bölcskei Uncertainty Principle
Version 1
: Received: 1 January 2024 / Approved: 4 January 2024 / Online: 4 January 2024 (15:15:01 CET)
How to cite: KRISHNA, K.M. Functional Kuppinger-Durisi-Bölcskei Uncertainty Principle. Preprints 2024, 2024010389. https://doi.org/10.20944/preprints202401.0389.v1 KRISHNA, K.M. Functional Kuppinger-Durisi-Bölcskei Uncertainty Principle. Preprints 2024, 2024010389. https://doi.org/10.20944/preprints202401.0389.v1
Abstract
Let $\mathcal{X}$ be a Banach space. Let $\{\tau_j\}_{j=1}^n, \{\omega_k\}_{k=1}^m\subseteq \mathcal{X}$ and $\{f_j\}_{j=1}^n$, $\{g_k\}_{k=1}^m\subseteq \mathcal{X}^*$ satisfy $ |f_j(\tau_j)|\geq 1$ for all $ 1\leq j \leq n$, $|g_k(\omega_k)|\geq 1 $ for all $1\leq k \leq m$. If $x \in \mathcal{X}\setminus \{0\}$ is such that $x=\theta_\tau\theta_f x=\theta_\omega\theta_g x$, then we show that \begin{align}\label{FKDB} \|\theta_fx\|_0\|\theta_gx\|_0\geq \frac{\bigg[1-(\|\theta_fx\|_0-1)\max\limits_{1\leq j,r \leq n,j\neq r}|f_j(\tau_r)|\bigg]^+\bigg[1-(\|\theta_g x\|_0-1)\max\limits_{1\leq k,s \leq m,k\neq s}|g_k(\omega_s)|\bigg]^+}{\left(\displaystyle\max_{1\leq j \leq n, 1\leq k \leq m}|f_j(\omega_k)|\right)\left(\displaystyle\max_{1\leq j \leq n, 1\leq k \leq m}|g_k(\tau_j)|\right)}. \end{align} We call Inequality (\ref{FKDB}) as \textbf{Functional Kuppinger-Durisi-B\"{o}lcskei Uncertainty Principle}. Inequality (\ref{FKDB}) improves the uncertainty principle obtained by Kuppinger, Durisi and B\"{o}lcskei \textit{[IEEE Trans. Inform. Theory (2012)]} (which improved the Donoho-Stark-Elad-Bruckstein uncertainty principle \textit{[SIAM J. Appl. Math. (1989), IEEE Trans. Inform. Theory (2002)]}). We also derive functional form of the uncertainity principle obtained by Studer, Kuppinger, Pope and B\"{o}lcskei \textit{[EEE Trans. Inform. Theory, (2012)]}.
Keywords
Uncertainty Principle, Hilbert space, Banach space.
Subject
Computer Science and Mathematics, Analysis
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment