Is the inverse Fourier transform of a radial function radial?
Let $f: Bbb{R}^d to Bbb{R}$ be a rapidly decreasing function in $Bbb{R}^d$. Concerning Fourier transforms in $Bbb{R}^d$, we define $hat{f}(xi) = int_{Bbb{R}^d} f(x) e^{-2 pi i xi cdot x}dx $, for $xi in Bbb{R}^d$. And the inverse of $g(xi)$ is $int_{Bbb{R}^d}g(xi)e^{2 pi i xi cdot x}dxi$. A function $f: Bbb{R}^d to Bbb{R}$ is said to be radial iff there is $F: Bbb{R} to Bbb{R}$ such that $f(x) = F(|x|)$ for $x in Bbb{R}^d$. It is easy to prove that the transform of a radial function is radial. Does the same hold for inverse transforms?
fourier-transform
add a comment |
Let $f: Bbb{R}^d to Bbb{R}$ be a rapidly decreasing function in $Bbb{R}^d$. Concerning Fourier transforms in $Bbb{R}^d$, we define $hat{f}(xi) = int_{Bbb{R}^d} f(x) e^{-2 pi i xi cdot x}dx $, for $xi in Bbb{R}^d$. And the inverse of $g(xi)$ is $int_{Bbb{R}^d}g(xi)e^{2 pi i xi cdot x}dxi$. A function $f: Bbb{R}^d to Bbb{R}$ is said to be radial iff there is $F: Bbb{R} to Bbb{R}$ such that $f(x) = F(|x|)$ for $x in Bbb{R}^d$. It is easy to prove that the transform of a radial function is radial. Does the same hold for inverse transforms?
fourier-transform
2
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36
add a comment |
Let $f: Bbb{R}^d to Bbb{R}$ be a rapidly decreasing function in $Bbb{R}^d$. Concerning Fourier transforms in $Bbb{R}^d$, we define $hat{f}(xi) = int_{Bbb{R}^d} f(x) e^{-2 pi i xi cdot x}dx $, for $xi in Bbb{R}^d$. And the inverse of $g(xi)$ is $int_{Bbb{R}^d}g(xi)e^{2 pi i xi cdot x}dxi$. A function $f: Bbb{R}^d to Bbb{R}$ is said to be radial iff there is $F: Bbb{R} to Bbb{R}$ such that $f(x) = F(|x|)$ for $x in Bbb{R}^d$. It is easy to prove that the transform of a radial function is radial. Does the same hold for inverse transforms?
fourier-transform
Let $f: Bbb{R}^d to Bbb{R}$ be a rapidly decreasing function in $Bbb{R}^d$. Concerning Fourier transforms in $Bbb{R}^d$, we define $hat{f}(xi) = int_{Bbb{R}^d} f(x) e^{-2 pi i xi cdot x}dx $, for $xi in Bbb{R}^d$. And the inverse of $g(xi)$ is $int_{Bbb{R}^d}g(xi)e^{2 pi i xi cdot x}dxi$. A function $f: Bbb{R}^d to Bbb{R}$ is said to be radial iff there is $F: Bbb{R} to Bbb{R}$ such that $f(x) = F(|x|)$ for $x in Bbb{R}^d$. It is easy to prove that the transform of a radial function is radial. Does the same hold for inverse transforms?
fourier-transform
fourier-transform
asked Nov 28 '18 at 11:24
Nuntractatuses Amável
61812
61812
2
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36
add a comment |
2
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36
2
2
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36
add a comment |
0
active
oldest
votes
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3017033%2fis-the-inverse-fourier-transform-of-a-radial-function-radial%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3017033%2fis-the-inverse-fourier-transform-of-a-radial-function-radial%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
2
the inverse transform of a function $f$ is the fourier trnasform of $xmapsto f(-x)$
– Surb
Nov 28 '18 at 11:28
Yes, convert the cartesian n-dimensional Fourier Transform to n-spherical (?) coordinates and integrate over the angular variables. You will be left with a transform that is a single integral in terms of the radial variable. You can do the same for the inverse transform. For n = 1, you will get the Fourier cosine transform. For n = 2, you will get the zero order Hankel Transform. For higher n, see math.stackexchange.com/a/3007081/441161
– Andy Walls
Nov 28 '18 at 19:36