Fourier Transform of $e^{-}$, $A$ is a symmetric, positive definite matrix












1












$begingroup$


I would like to understand how to fourier transform the function $f:mathbb R^ntomathbb R$,



$f(x):=e^{-lt x,Axgt}$



with $A$ being a positive definite, symmetric matrix.



I understand that $lt x,Axgt$ will end up being something like $sum_{i=1}^nsum_{j=1}^n a_{ij}x_ix_j$ with a couple of summarizable summands due to the symmetry of $A$:



$frac 1{{(2pi)}^{frac 1 n}}int_{mathbb R^n} e^{-(a_{11}x_1^2+a_{22}x_2^2+...+a_{nn}x_n^2+2a_{12}x_1x_2+...+2a_{23}x_2x_3+...+2a_{n,n-1}x_nx_{n-1})}e^{-i lt t,xgt}d^nx $



(Is that even correct?..)



But I am having trouble actually calculating the integral, as I can't see anything I already know I could substitute in this, not even for $n=1$.



I'd appreciate any help with this.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
    $endgroup$
    – reuns
    Jan 19 at 1:43












  • $begingroup$
    (I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 2:09
















1












$begingroup$


I would like to understand how to fourier transform the function $f:mathbb R^ntomathbb R$,



$f(x):=e^{-lt x,Axgt}$



with $A$ being a positive definite, symmetric matrix.



I understand that $lt x,Axgt$ will end up being something like $sum_{i=1}^nsum_{j=1}^n a_{ij}x_ix_j$ with a couple of summarizable summands due to the symmetry of $A$:



$frac 1{{(2pi)}^{frac 1 n}}int_{mathbb R^n} e^{-(a_{11}x_1^2+a_{22}x_2^2+...+a_{nn}x_n^2+2a_{12}x_1x_2+...+2a_{23}x_2x_3+...+2a_{n,n-1}x_nx_{n-1})}e^{-i lt t,xgt}d^nx $



(Is that even correct?..)



But I am having trouble actually calculating the integral, as I can't see anything I already know I could substitute in this, not even for $n=1$.



I'd appreciate any help with this.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
    $endgroup$
    – reuns
    Jan 19 at 1:43












  • $begingroup$
    (I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 2:09














1












1








1





$begingroup$


I would like to understand how to fourier transform the function $f:mathbb R^ntomathbb R$,



$f(x):=e^{-lt x,Axgt}$



with $A$ being a positive definite, symmetric matrix.



I understand that $lt x,Axgt$ will end up being something like $sum_{i=1}^nsum_{j=1}^n a_{ij}x_ix_j$ with a couple of summarizable summands due to the symmetry of $A$:



$frac 1{{(2pi)}^{frac 1 n}}int_{mathbb R^n} e^{-(a_{11}x_1^2+a_{22}x_2^2+...+a_{nn}x_n^2+2a_{12}x_1x_2+...+2a_{23}x_2x_3+...+2a_{n,n-1}x_nx_{n-1})}e^{-i lt t,xgt}d^nx $



(Is that even correct?..)



But I am having trouble actually calculating the integral, as I can't see anything I already know I could substitute in this, not even for $n=1$.



I'd appreciate any help with this.










share|cite|improve this question











$endgroup$




I would like to understand how to fourier transform the function $f:mathbb R^ntomathbb R$,



$f(x):=e^{-lt x,Axgt}$



with $A$ being a positive definite, symmetric matrix.



I understand that $lt x,Axgt$ will end up being something like $sum_{i=1}^nsum_{j=1}^n a_{ij}x_ix_j$ with a couple of summarizable summands due to the symmetry of $A$:



$frac 1{{(2pi)}^{frac 1 n}}int_{mathbb R^n} e^{-(a_{11}x_1^2+a_{22}x_2^2+...+a_{nn}x_n^2+2a_{12}x_1x_2+...+2a_{23}x_2x_3+...+2a_{n,n-1}x_nx_{n-1})}e^{-i lt t,xgt}d^nx $



(Is that even correct?..)



But I am having trouble actually calculating the integral, as I can't see anything I already know I could substitute in this, not even for $n=1$.



I'd appreciate any help with this.







integration matrices complex-analysis fourier-transform positive-definite






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 19 at 6:36









Andrews

4081317




4081317










asked Jan 19 at 1:40









DepressedUnicornDepressedUnicorn

83




83












  • $begingroup$
    Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
    $endgroup$
    – reuns
    Jan 19 at 1:43












  • $begingroup$
    (I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 2:09


















  • $begingroup$
    Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
    $endgroup$
    – reuns
    Jan 19 at 1:43












  • $begingroup$
    (I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 2:09
















$begingroup$
Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
$endgroup$
– reuns
Jan 19 at 1:43






$begingroup$
Let $h(x) = e^{-pi |x|^2}$. (With the $xi$ normalization) it is its own Fourier transform. Iff $A$ is positive definite then $A =pi B^top B$ with $B in GL_n(mathbb{R})$ then $e^{-langle x,Axrangle } = h(B x)$ whose Fourier transform is $|det(B)|^{-1} h(B^{-top} xi)$ (change of variable $y = Bx, dy= d(Bx)=det(B) dx$ in the Fourier integral)
$endgroup$
– reuns
Jan 19 at 1:43














$begingroup$
(I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
$endgroup$
– DepressedUnicorn
Jan 19 at 2:09




$begingroup$
(I will look into this further in the morning, too late in the night for me right now, think this will help though, thanks already)
$endgroup$
– DepressedUnicorn
Jan 19 at 2:09










1 Answer
1






active

oldest

votes


















0












$begingroup$

You can simplify the Fourier transform expression if you express everything in the basis of eigenvectors of $A$.



Remember that, by the spectral theorem, $A$ can be diagonalized in an orthonormal basis. That means there is a unitary transform $U$ and a diagonal matrix $Lambda$ such that
$$A=U^TLambda U$$
And because $A$ is positive definite, $Lambda$'s diagonal elements are all strictly positive. Also, because $U$ is unitary, for any $t$ and $x$ in $mathbb R^n$, $langle t, xrangle = langle Ut, Ux rangle$.



With that, the Fourier transform of $f$ now becomes
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt Ux, Lambda Ux gt}e^{-i lt Ut,Uxgt}d^nx\
end{split}$$

By changing the variable $y=Ux$, we get
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt Ut,ygt}|det U|d^nx\
end{split}$$

Noting that $|det U|=1$ and $U^TU=I$
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt t,ygt}d^ny$$
If $lambda_1,...,lambda_n$ denote the diagonal elements of $Lambda $ (all strictly positive),
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} prod_{k=1}^ne^{-lambda_ky_k^2}e^{-i t_ky_k}d^ny=prod_{k=1}^n frac 1 {2pi}int_{mathbb R}e^{-lambda_ky_k^2}e^{-i t_ky_k}dy_k$$
In other words, if you rotate the axes to align with the eigenvectors of $A$, the $n$-dimensional Fourier transform is the product of $1$-dimensional Fourier transforms of the univariate Gaussian function. And you know the expression for the Fourier transform of a $1$-dimensional Gaussian function.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks, this makes a lot of sense now.
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 13:39











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3078932%2ffourier-transform-of-e-x-ax-a-is-a-symmetric-positive-definite-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

You can simplify the Fourier transform expression if you express everything in the basis of eigenvectors of $A$.



Remember that, by the spectral theorem, $A$ can be diagonalized in an orthonormal basis. That means there is a unitary transform $U$ and a diagonal matrix $Lambda$ such that
$$A=U^TLambda U$$
And because $A$ is positive definite, $Lambda$'s diagonal elements are all strictly positive. Also, because $U$ is unitary, for any $t$ and $x$ in $mathbb R^n$, $langle t, xrangle = langle Ut, Ux rangle$.



With that, the Fourier transform of $f$ now becomes
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt Ux, Lambda Ux gt}e^{-i lt Ut,Uxgt}d^nx\
end{split}$$

By changing the variable $y=Ux$, we get
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt Ut,ygt}|det U|d^nx\
end{split}$$

Noting that $|det U|=1$ and $U^TU=I$
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt t,ygt}d^ny$$
If $lambda_1,...,lambda_n$ denote the diagonal elements of $Lambda $ (all strictly positive),
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} prod_{k=1}^ne^{-lambda_ky_k^2}e^{-i t_ky_k}d^ny=prod_{k=1}^n frac 1 {2pi}int_{mathbb R}e^{-lambda_ky_k^2}e^{-i t_ky_k}dy_k$$
In other words, if you rotate the axes to align with the eigenvectors of $A$, the $n$-dimensional Fourier transform is the product of $1$-dimensional Fourier transforms of the univariate Gaussian function. And you know the expression for the Fourier transform of a $1$-dimensional Gaussian function.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks, this makes a lot of sense now.
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 13:39
















0












$begingroup$

You can simplify the Fourier transform expression if you express everything in the basis of eigenvectors of $A$.



Remember that, by the spectral theorem, $A$ can be diagonalized in an orthonormal basis. That means there is a unitary transform $U$ and a diagonal matrix $Lambda$ such that
$$A=U^TLambda U$$
And because $A$ is positive definite, $Lambda$'s diagonal elements are all strictly positive. Also, because $U$ is unitary, for any $t$ and $x$ in $mathbb R^n$, $langle t, xrangle = langle Ut, Ux rangle$.



With that, the Fourier transform of $f$ now becomes
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt Ux, Lambda Ux gt}e^{-i lt Ut,Uxgt}d^nx\
end{split}$$

By changing the variable $y=Ux$, we get
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt Ut,ygt}|det U|d^nx\
end{split}$$

Noting that $|det U|=1$ and $U^TU=I$
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt t,ygt}d^ny$$
If $lambda_1,...,lambda_n$ denote the diagonal elements of $Lambda $ (all strictly positive),
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} prod_{k=1}^ne^{-lambda_ky_k^2}e^{-i t_ky_k}d^ny=prod_{k=1}^n frac 1 {2pi}int_{mathbb R}e^{-lambda_ky_k^2}e^{-i t_ky_k}dy_k$$
In other words, if you rotate the axes to align with the eigenvectors of $A$, the $n$-dimensional Fourier transform is the product of $1$-dimensional Fourier transforms of the univariate Gaussian function. And you know the expression for the Fourier transform of a $1$-dimensional Gaussian function.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thanks, this makes a lot of sense now.
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 13:39














0












0








0





$begingroup$

You can simplify the Fourier transform expression if you express everything in the basis of eigenvectors of $A$.



Remember that, by the spectral theorem, $A$ can be diagonalized in an orthonormal basis. That means there is a unitary transform $U$ and a diagonal matrix $Lambda$ such that
$$A=U^TLambda U$$
And because $A$ is positive definite, $Lambda$'s diagonal elements are all strictly positive. Also, because $U$ is unitary, for any $t$ and $x$ in $mathbb R^n$, $langle t, xrangle = langle Ut, Ux rangle$.



With that, the Fourier transform of $f$ now becomes
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt Ux, Lambda Ux gt}e^{-i lt Ut,Uxgt}d^nx\
end{split}$$

By changing the variable $y=Ux$, we get
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt Ut,ygt}|det U|d^nx\
end{split}$$

Noting that $|det U|=1$ and $U^TU=I$
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt t,ygt}d^ny$$
If $lambda_1,...,lambda_n$ denote the diagonal elements of $Lambda $ (all strictly positive),
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} prod_{k=1}^ne^{-lambda_ky_k^2}e^{-i t_ky_k}d^ny=prod_{k=1}^n frac 1 {2pi}int_{mathbb R}e^{-lambda_ky_k^2}e^{-i t_ky_k}dy_k$$
In other words, if you rotate the axes to align with the eigenvectors of $A$, the $n$-dimensional Fourier transform is the product of $1$-dimensional Fourier transforms of the univariate Gaussian function. And you know the expression for the Fourier transform of a $1$-dimensional Gaussian function.






share|cite|improve this answer











$endgroup$



You can simplify the Fourier transform expression if you express everything in the basis of eigenvectors of $A$.



Remember that, by the spectral theorem, $A$ can be diagonalized in an orthonormal basis. That means there is a unitary transform $U$ and a diagonal matrix $Lambda$ such that
$$A=U^TLambda U$$
And because $A$ is positive definite, $Lambda$'s diagonal elements are all strictly positive. Also, because $U$ is unitary, for any $t$ and $x$ in $mathbb R^n$, $langle t, xrangle = langle Ut, Ux rangle$.



With that, the Fourier transform of $f$ now becomes
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt Ux, Lambda Ux gt}e^{-i lt Ut,Uxgt}d^nx\
end{split}$$

By changing the variable $y=Ux$, we get
$$begin{split}
hat{f}(t) &=
frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt Ut,ygt}|det U|d^nx\
end{split}$$

Noting that $|det U|=1$ and $U^TU=I$
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} e^{-lt y, Lambda y gt}e^{-i lt t,ygt}d^ny$$
If $lambda_1,...,lambda_n$ denote the diagonal elements of $Lambda $ (all strictly positive),
$$hat{f}(U^Tt)=frac 1{(2pi)^n}int_{mathbb R^n} prod_{k=1}^ne^{-lambda_ky_k^2}e^{-i t_ky_k}d^ny=prod_{k=1}^n frac 1 {2pi}int_{mathbb R}e^{-lambda_ky_k^2}e^{-i t_ky_k}dy_k$$
In other words, if you rotate the axes to align with the eigenvectors of $A$, the $n$-dimensional Fourier transform is the product of $1$-dimensional Fourier transforms of the univariate Gaussian function. And you know the expression for the Fourier transform of a $1$-dimensional Gaussian function.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 19 at 6:27









reuns

20.2k21148




20.2k21148










answered Jan 19 at 4:15









Stefan LafonStefan Lafon

1,86618




1,86618












  • $begingroup$
    Thanks, this makes a lot of sense now.
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 13:39


















  • $begingroup$
    Thanks, this makes a lot of sense now.
    $endgroup$
    – DepressedUnicorn
    Jan 19 at 13:39
















$begingroup$
Thanks, this makes a lot of sense now.
$endgroup$
– DepressedUnicorn
Jan 19 at 13:39




$begingroup$
Thanks, this makes a lot of sense now.
$endgroup$
– DepressedUnicorn
Jan 19 at 13:39


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3078932%2ffourier-transform-of-e-x-ax-a-is-a-symmetric-positive-definite-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Mario Kart Wii

What does “Dominus providebit” mean?

Antonio Litta Visconti Arese