Article
Version 1
Preserved in Portico This version is not peer-reviewed
An Endpoint Functional Continuous Uncertainty Principle
Version 1
: Received: 12 August 2023 / Approved: 14 August 2023 / Online: 15 August 2023 (09:08:33 CEST)
How to cite: KRISHNA, K.M. An Endpoint Functional Continuous Uncertainty Principle. Preprints 2023, 2023081108. https://doi.org/10.20944/preprints202308.1108.v1 KRISHNA, K.M. An Endpoint Functional Continuous Uncertainty Principle. Preprints 2023, 2023081108. https://doi.org/10.20944/preprints202308.1108.v1
Abstract
Let $(\Omega, \mu)$, $(\Delta, \nu)$ be measure spaces. Let $(\{f_\alpha\}_{\alpha\in \Omega}, \{\tau_\alpha\}_{\alpha\in \Omega})$ and $(\{g_\beta\}_{\beta\in \Delta}, \{\omega_\beta\}_{\beta\in \Delta})$ be continuous 1-Schauder frames for a Banach space $\mathcal{X}$. Then for every $x \in \mathcal{X}\setminus\{0\}$, we show that \begin{align*} \mu(\operatorname{supp}(\theta_f x)) \geq \frac{1}{\displaystyle\sup_{\alpha \in \Omega, \beta \in \Delta}|f_\alpha(\omega_\beta)|}, \quad \nu(\operatorname{supp}(\theta_g x))\geq \frac{1}{\displaystyle\sup_{\alpha \in \Omega , \beta \in \Delta}|g_\beta(\tau_\alpha)|}. \end{align*} where \begin{align*} &\theta_f: \mathcal{X} \ni x \mapsto \theta_fx \in \mathcal{L}^1(\Omega, \mu); \quad \theta_fx: \Omega \ni \alpha \mapsto (\theta_fx) (\alpha):= f_\alpha (x) \in \mathbb{K},\\ &\theta_g: \mathcal{X} \ni x \mapsto \theta_gx \in \mathcal{L}^1(\Delta, \nu); \quad \theta_gx: \Delta \ni \beta \mapsto (\theta_gx) (\beta):= g_\beta (x) \in \mathbb{K}. \end{align*} This solves a problem asked by K. M. Krishna in the paper 'Functional Continuous Uncertainty Principle' \textit{[arXiv:2308.00312v1]}.
Keywords
Uncertainty Principle, Parseval Frame, 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