Donoho-Stark's Uncertainty Principles in Real Clifford Algebras
Youssef El Haoui, Said Fahlaoui

TL;DR
This paper extends uncertainty principles, including Donoho-Stark's, to real Clifford algebras using the Clifford Fourier transform, broadening the mathematical framework for analysis in Clifford analysis.
Contribution
It establishes several uncertainty inequalities and qualitative principles within real Clifford algebras, enhancing the theoretical foundation of Clifford analysis.
Findings
Proved Hausdorf-Young inequality in Clifford algebra
Established Donoho-Stark uncertainty principles in Clifford context
Extended uncertainty principles to real Clifford algebras
Abstract
The Clifford Fourier transform (CFT) has been shown to be a powerful tool in the Clifford analysis. In this work, several uncertainty inequalities are established in the real Clifford algebra , \ including the Hausdorf-Young inequality, and three qualitative uncertainty principles of Donoho-Stark.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Donoho-Stark’s Uncertainty Principles in Real Clifford Algebras
**Youssef El Haoui1,111Corresponding author., Said Fahlaoui1
1Department of Mathematics and Computer Sciences, Faculty of Sciences, University Moulay Ismail, Meknes 11201, Morocco
E-MAIL: [email protected], [email protected]
Abstract
The Clifford Fourier transform (CFT) has been shown to be a powerful tool in the Clifford analysis. In this work, several uncertainty inequalities are established in the real Clifford algebra , including the Hausdorf-Young inequality, and three qualitative uncertainty principles of Donoho-Stark.
Key words: Clifford algebras, Clifford-Fourier transform, Uncertainty principle, Donoho-Stark’s uncertainty principle.
1 Introduction
It is well known that the uncertainty principles (UPs) give information about a function and its Fourier transform. Their importance is due to their applications in different areas, e.g. quantum physics and signal processing. In quantum physics, they tell us that the position and the momentum of a particle cannot both be measured with precision.
The qualitative UP is a kind of UPs, which tells us how a signal and its Fourier transform , behave under certain conditions. One such example can be the Donoho-Stark’s UP [4], which expresses the limitations on the simultaneous concentration of , and .
The aim of this work is to generalize Donoho-Stark’s UP in Clifford’s analysis, using the basic properties of Clifford’s algebras and its Fourier transform.
For more details on Clifford Fourier’s transformations, their historical development and applications, we refer to [1, 2, 6, 5].
In [3] Thm. 5.1, and [7] Thm. 8, the authors establish , in different ways, the UP of Donoho-Stark in quaternion algebra which is isomorphic at
The first inequality we deal with is a generalization of the Hausdorf-Young inequality by means of the kernel of the CFT introduced by [5].
Based on this inequality, and following the Donoho-Stark’UP proof techniques for the Dunkel-trabsform [11], we investigate three inequalities in terms of ”-concentration” in the Clifford algebra
This paper is organized as follows. Section 2 is devoted to a reminder of the basics of Clifford algebras. In section 3, we introduce the CFT and review its important properties, and prove the Hausdorf-Young inequality. In section 4, we define the concept of ”-concentration” in CFT-domain, and establish UPs of concentration type, then prove Donoho-Stark bandlimited UP for the CFT. Finally, we give a conclusion in section 5.
2 Preliminaries
Let be an orthonormal basis of the real Euclidean vector space , with
The Clifford geometric algebra (see [10]) over denoted by , is defined as an associative, non commutative algebra which has the graded 2n-dimensional basis
The multiplication of the basis vectors satisfy the rules
, for n,
With is the Kronecker symbol, and \epsilon_{k}=+1,\ for and \ \epsilon_{k}=-1,\ for
Every element \ f\ of Clifford algebra , is called multivector, and can be expressed in the form
[TABLE]
where f_{A},\are real-valued functions, , and, with , and .
Also, a multivector can be written as
[TABLE]
where , denote the vector part of.
And the reverse of is given by
[TABLE]
Where means to change in the basis decomposition of the sign of every vector of negative square \overline{e_{A}}=\epsilon_{{\alpha}_{1}}e_{{\alpha}_{1}}\dots\epsilon_{{\alpha}_{k}}e_{{\alpha}_{k}},\ \ 1\leq{\alpha}_{1}\leq{\alpha}_{2}\leq\dots\leq{\alpha}_{k}\leq n\.
For , the scalar product , is defined by
[TABLE]
In particular, if , then we obtain the modulus of a multivector , defined as
[TABLE]
For , The linear spaces are introduced as :
.
For the - norm is defined by
[TABLE]
Lemma 2.1**.**
For , the following property hold
[TABLE]
Lemma 2.2**.**
Let and , with {\mu}^{2}=-1,\ \we have a natural generalization of Euler’s formula for Clifford algebra, as follows
[TABLE]
Proof. As we have for any real
[TABLE]
3 Clifford-Fourier transform
In this section, we introduce the Clifford Fourier transform (CFT),recall its properties, add one result related to the kernel of the CFT, and we prove the Hausdorf-Young inequality associated with the CFT.
Definition 3.1**.**
Let be a square root of -1, i.e.
The general Clifford Fourier transform (CFT) (see [5]) of , with respect to is
[TABLE]
Where , and
We assume, in the rest of this work, that
[TABLE]
3.1 Properties of the CFT
In the following, we give some important properties of the CFT, For more detailed discussions of the properties of the CFT and their proofs, see e.g. [1, 5, 6]
Left Linearity
For , and constants ,
[TABLE]
Inversion formula
For , we have
[TABLE]
Where …, .
For the function , one has the Parseval identity
[TABLE]
Lemma 3.2**.**
For , and \mu\in{Cl}_{(p,q)},\ with the following inequality holds:
[TABLE]
Proof. By means of Lemma 2.2 and the definition (2.1) of the Clifford norm, we obtain
[TABLE]
Therefore,
However , by combining lemma 3.2 and lemma 2.1, we do have the following result:
Lemma 3.3**.**
Let , and be a square root of -1.
Then,
[TABLE]
Theorem 3.4**.**
Hausdorf-Young inequality associated with CFT
Let ,
then {\ {\mathcal{F}}^{\mu}\left\{f\right\}\in L^{b}(\mathbb{R}^{n},Cl}_{(p,q)})\ \with ,
and we have
[TABLE]
where .
Proof. We have
[TABLE]
Where we used (3.3).
Thus,
[TABLE]
Hence, the CFT is of type (1,) with norm 2 ,
On the other hand, by (Parseval ) one sees that the CFT is of type (2,2) with norm .
We obtain consecutively by the Riesz–Thorin theorem ([8], Thm. 2.1), that the CFT is also of type (, with norm such that
With and with 01.
Then , and 1,and
This completes the proof.
4 Donoho-Stark Uncertainty Principles in Clifford algebra
The Donoho-Stark UP relies on the concept of concentration. We start by giving this definition.
Let be measurable subsets of . And denote by respectively the time limiting operator, and the Dunkel integral operator given by
[TABLE]
Definition 4.1**.**
A function is concentrated on , in norm,
If
[TABLE]
Remark 4.2**.**
If then is the exact support of .
Lemma 4.3**.**
*If , and
Then*
[TABLE]
Where is denoted as the Lebesgue measure of .
Proof. Without loss of generality, we assume that
We have
[TABLE]
Thus,
[TABLE]
In view of
[TABLE]
We have by Hölder inequality, and (3.3))
[TABLE]
Consequently, (4.2) yields
[TABLE]
We are now in the position to establish the first UP of concentration type.
Theorem 4.4**.**
If a non-zero function {\ f\in L^{1}\cap L^{a}(\mathbb{R}^{n},Cl}_{(p,q)}),\ is concentrated on norm, and is -concentrated on norm, .
Then,
[TABLE]
With, the constant of Hausdorf-Young inequality.
Proof. Withouot loss of generality, we may assume that T and have finite measure.
Then we have
[TABLE]
Since is -concentrated on in norm, we obtain that
[TABLE]
On the other hand,
[TABLE]
Where we used the the linearity of in the second inequality, and (3.4) in the last.
And consequently, by the triangle inequality
[TABLE]
[TABLE]
Moreover, again using the triangle inequality, (4.1), and (4.5), implies that
[TABLE]
Hence,
[TABLE]
In view of the Parseval identity (3.2), and (4.3)
Corollary 4.5**.**
Suppose that with f\neq 0,\is concentrated on norm, and is -concentrated on norm.
Then, one has
[TABLE]
Choose ,in Corollary 4.5, and use remark 4.2,
We do have the following result
Corollary 4.6**.**
Suppose that with Supp\ f\subseteq T,\ and
Then,
[TABLE]
The second concentration UP of Donoho-Stark associated with CFT, is given in the following theorem.
Theorem 4.7**.**
Suppose that a non zero function is concentrated on norm, and is -concentrated on norm, .
Then,
[TABLE]
Proof. We assume that and have finite measure, we have by triangle inequality and (4.4)
[TABLE]
Using
[TABLE]
We indeed obtain by (3.5)
[TABLE]
Furthermore, by assuming that is concentrated on in norm, we obtain
[TABLE]
Where we used the Hölder inequality.
Thus,
[TABLE]
Combining the results of (4.6) and (4.7) yields the desired result.
4.1 Donoho-Stark bandlimited UP for the CFT
Let (), , be the set of functions that are bandlimited on i.e.
A function is said bandlimited on in norm, if there is (), with
[TABLE]
Lemma 4.8**.**
Let (), 1\leq a\leq 2,\then
[TABLE]
Proof. We may assume that \left|T\right|<\infty\and .
Using inversion formula (3.1), and the assumption that (), we get
[TABLE]
By (3.3) and Hölder inequality, one has
[TABLE]
Thus, we have
[TABLE]
Theorem 4.9**.**
Let {\ f\in L^{1}(\mathbb{R}^{n},Cl}_{(p,q)}),\ be concentrated on in norm and - bandlimited on in norm,
Then,
[TABLE]
Proof. By definition, there exists (), such that .
This leads to
[TABLE]
From Lemma 4.8, and the fact , we get
[TABLE]
On the other hand, as is concentrated on in norm, we have
[TABLE]
Then,
[TABLE]
By combining (4.8) and (4.9), we conclude the proof.
5 Conclusion
In this paper, we have proven several uncertainty inequalities for the CFT. The first one is the Hausdorf-Young inequality in the Clifford algebra , which we think will be an important tool in the future to prove other geometric inequalities for the CFT. The other three inequalities are the generalization of UPs of concentration type, they are versions. Two are dependent on signal f. However, the third is independent of the bandlimited signal .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Brackx, N. De Schepper, and F. Sommen, The Clifford Fourier transform, J. Fourier Anal. Appl., 6(11), pp. 668-681 (2005)
- 2[2] F. Brackx, N. De Schepper, and F. Sommen, The Fourier transform in Clifford analysis, Advances in Imaging and Electron Physics 156 (2009): pp. 55-201.
- 3[3] L.P. Chen, K.I. Kou, M.S. Liu, Pitt’s inequality and the uncertainty principle associated with thequaternion Fourier transform, J. Math.Anal.Appl.423(2015), pp. 681–700.
- 4[4] D.L. Donoho, P.B. Stark, Uncertainty principles and signal recovery, SIAM J. Appl. Math., 49 (1989), pp. 906-931.
- 5[5] E. Hitzer, The Clifford Fourier transform in real Clifford algebras. In E. Hitzer, K. Tachibana (eds.), ”Session on Geometric Algebra and Applications, IKM 2012”, Special Issue of Clifford Analysis, Clifford Algebras and their Applica- tions, Vol. 2, No. 3, pp. 223-235, (2013). First published in K. Guerlebeck, T. Lahmer and F. Werner (eds.), electronic Proc. of 19th International Confer- ence on the Application of Computer Science and Mathematics in Architecture and Civil Engineering, IK
- 6[6] E. Hitzer, B. Mawardi, Clifford Fourier Transform on Multivector Fields and Uncertainty Principles for Dimensions n = 2(mod 4) and n = 3(mod 4). Adv. Appl. Cliff. Alg. 18 (2008), pp. 715-736.
- 7[7] P. Lian, Uncertainty principle for the quaternion Fourier transform, J. Math. Anal. Appl. (2018), https://doi.org/10.1016/j.jmaa.2018.08.002
- 8[8] F. Linares, G. Ponce, Introduction to Nonlinear Dispersive Equations, Publicações Matemáticas, IMPA, Rio de Janeiro, Brazil, 2004.
