How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Rapid oscillations make limited-angle data smaller than every power
Example
Assume the Axiom of Countable Choice. Take , , , and . Write and define for , . Give the data space the norm , with arc-length measure and Lebesgue measure , and define using Lebesgue measure on . Then is open and antipodally symmetric, its complement contains open horizontal arcs, and . For every , the class of smooth functions supported in with norm at most has no uniform Hölder stability estimate from the restricted Radon data. More explicitly, choose a real bump with , set , and let for integers . These functions have the same compact support, satisfy and , while for every integer there is with .
Example references
Facts & Assumptions
Given: The Axiom of Countable Choice and the stated domain , fixed support , measured normals , direction , and bump .
Visible covectors for limited-angle data: is the unit line tangent, so for one has .
A smooth bump between concentric Euclidean balls: a smooth bump supported in and equal to one on a smaller ball exists.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: a nondegenerate box has strictly positive Lebesgue measure, so a bump equal to one on a ball has positive norm and can be normalized.
Limited-angle inversion has no Hölder modulus on a fixed-support H1 ball: if a fixed-support bump is normalized in and is uniformly bounded below on , its modulations have norm bounded by and restricted data bounded by for every ; this is the proposition's proved integration-by-parts estimate.
The Axiom of Countable Choice (): Countable Choice is used in the box-measure supplier [F3] and in [F4]'s Lebesgue change-of-variables and integration-by-parts estimates.
Verification
The set is the inverse image of the open interval under the continuous coordinate map , so it is open; changing to preserves , so it is antipodally symmetric. Its complement contains arcs around and . For every , , hence the infimum is at least ; approaching either boundary shows the infimum is exactly . By [F1] this is .
A translated or rescaled bump from [F2] has compact support in and equals one on a smaller ball. That inner ball contains a nondegenerate box, which has positive measure by [F3]; compact support makes its norm finite, and the plateau makes the norm positive. Divide by this norm to obtain the required real with . Since lies inside , its support is contained in the fixed set .
The formula in the Example is the modulation family in [F4]. The chosen satisfies , and the geometric verification in step 1.1 supplies the positive lower bound required there. Thus the family has the stated fixed support, and bounds, and rapid restricted-data decay.
If a uniform Hölder estimate with exponent and constant held on the fixed-support class, choose an integer with . Step 2.1 would imply , so , contradicting . Therefore no such estimate holds.
Depends on
- Visible covectors for limited-angle data
- A smooth bump between concentric Euclidean balls
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Limited-angle inversion has no Hölder modulus on a fixed-support H1 ball
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Venkataswaran P. Krishnan and Eric Todd Quinto, Microlocal Analysis in Tomography (standard reference, not scraped)
- Mikko Salo, On geometric inverse problems and microlocal analysis, §2.1 (standard reference, not scraped)