Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

The Euclidean Radon transform on R²

Definition

Write Cc∞(R2;C) for the complex-valued smooth functions of compact support on the Euclidean plane. For u∈Cc∞(Rn;C), n=1 or 2, use the compact-support Riemann Fourier transform u^(ξ)=∫Rnu(x)e−2πix⋅ξ dx. For θ=(θ1,θ2)∈S1:={x∈R2:∣x∣=1} put θ⊥=(−θ2,θ1). The line with normal θ and signed offset s is {x∈R2:x⋅θ=s}. Its Euclidean Radon transform is Rf(θ,s):=∫Rf(sθ+tθ⊥) dt,f∈Cc∞(R2;C), (θ,s)∈S1×R. The line integral is a compact-support Riemann integral. The full data set uses every oriented normal θ∈S1 and every s∈R; the same unoriented line is represented by (θ,s) and (−θ,−s). For a one-dimensional function h∈Cc∞(R;C), define ∣Ds∣h(s):=∫R2π∣σ∣ h^(σ)e2πisσ dσ. For f∈Cc∞(R2;C) define the Riesz potential notation used here by ∣D∣−1f(x):=∫R2e2πix⋅ξf^(ξ)2π∣ξ∣ dξ. The quotient in the last integral is assigned value 0 at ξ=0. These integrals are absolutely convergent on the stated classes: compact-support integration by parts gives rapid decay of f^ and h^, while f^ is bounded near 0 and ∣ξ∣−1 is locally integrable in two dimensions. Here the multiplier for ∣Ds∣ is 2π∣σ∣, corresponding to the e−2πisσ Fourier convention.

Depends on

Used by

Dependency tree · two levels

9 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