Alphabeta Math
AlgorithmAlgorithm: 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.

Complete-data filtered backprojection

Definition

Assume Countable Choice and let μ be the polar surface measure on S1, with μ(E)=2λ2({rθ:θ∈E, 0<r≤1}) for Borel E⊆S1. The complete-data filtered-backprojection procedure takes as input the exact full sinogram g=Rf of some f∈Cc∞(R2;C); all oriented normals θ∈S1 and all offsets s∈R are supplied. It returns the function fFBP:R2→C defined by fFBP(x)=14π∫S1q(θ,x⋅θ) dμ(θ), where the filter output is q(θ,s)=∫R2π∣σ∣ g(θ,⋅)^(σ)e2πisσ dσ. The exact instructions are: (1) for each θ, take the one-dimensional Fourier transform of g(θ,⋅) with the negative-sign 2π convention; (2) multiply that transform by the declared ramp filter 2π∣σ∣ and take its inverse Fourier integral to form q(θ,⋅); (3) evaluate q(θ,⋅) at s=x⋅θ and integrate over the full polar surface measure in θ; (4) divide by 4π. For this input class the slice identity and Schwartz decay make the filter integral absolutely convergent and the backprojection integral well defined. This definition specifies the continuous full-data procedure; it gives no guarantee for finitely sampled, truncated, or noisy measurements. Exact recovery on the stated class is proved by the normal-operator theorem.

Depends on

Used by

Dependency tree · two levels

20 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