Integral transforms, operational calculus Radon transform and tomography Theorem
Helgason support theorem
Builds on Radon transform
Statement
Let and let be continuous and rapidly decreasing, that is, is bounded on for every integer . Let be a compact convex set. Assume that the Radon transform of vanishes on every hyperplane that does not meet . That is, whenever the hyperplane is disjoint from . Then for every .
Remarks
The decay hypothesis cannot be dropped. In , let be an integer and let be continuous with for . Take a line , , that misses the closed unit disk. The function has its only pole off the real axis, and it decays like . Closing the contour in the half-plane without the pole gives integral . So vanishes on all lines missing the unit disk, while outside it; here is bounded but is not.
The convexity of is also needed. The hyperplanes that miss a compact set are those that miss its convex hull, so the data can only locate the support up to the convex hull.
Going deeper
For a student
The theorem gives the exterior problem of tomography its uniqueness: a body is determined outside a convex obstacle by the lines that avoid the obstacle. It is a sharper form of injectivity of the Radon transform, local in the set of hyperplanes. The example with shows that rapid decrease is the right hypothesis. The theorem is due to Helgason and has analogues for Radon transforms on symmetric spaces.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Radon transform concept
- Helgason support theorem statement
Further reading
About this page
| Tag | C1WVKRGQ1T |
|---|---|
| URI | m2://C1WVKRGQ1T |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 44A12, 53C65 |
| Status | This copy of the site has no build data. Run m2 status C1WVKRGQ1T. |
| About | Radon transform |
| Uses | Radon transform |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.