Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedPipeline-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.

A nonzero Schwartz function invisible to a limited-angle Radon transform

Example

Assume the Axiom of Countable Choice. Let Θ⊂S1 be a nonempty proper open antipodally symmetric set such that S1∖Θ‾ contains a nonempty open arc. Choose an open arc J with J‾⊂S1∖Θ‾, put V={rω:1<r<2, ω∈J}, choose a nonzero smooth function q∈Cc∞(V;C), and define f(x)=∫R2q(ξ)e2πix⋅ξ dξ. For θ=(θ1,θ2) write θ⊥=(−θ2,θ1) and, for a Schwartz function g, define RSg(θ,s)=∫Rg(sθ+tθ⊥) dt using Lebesgue measure dt. Let Y=L2(Θ×R,dθ ds), where dθ is arc-length measure and ds is Lebesgue measure. Then f is a nonzero Schwartz function in L2(R2) with Lebesgue measure, its Fourier transform is q, and RSf(θ,s)=0 for every θ∈Θ and s∈R, so both 0 and f give datum 0 in Y without either truth being required to have compact support. For the two-truth class {0,f} with target loss ∥g−h∥L2(R2), every deterministic estimator Φ:Y→L2(R2) satisfies max⁡{∥Φ(0)∥2,∥Φ(0)−f∥2}≥∥f∥2/2>0.

Facts & Assumptions

Given: The Axiom of Countable Choice, the normal set Θ, the blind arc J, the annular sector V, and the nonzero smooth function q supported in V from the Example.

[F1]

Visible covectors for limited-angle data: WΘ={σθ:θ∈Θ, σ≠0}, while the directions in S1∖Θ‾ are unmeasured.

[F2]

A smooth bump between concentric Euclidean balls: every nonempty open ball contains a nonzero smooth compactly supported function, by translating and rescaling a concentric bump.

[F3]

Fourier transform acts continuously on Schwartz space: under Countable Choice the negative-sign, 2π-normalized Fourier transform maps Schwartz functions to Schwartz functions.

[F4]

Fourier inversion on Schwartz space: under Countable Choice, g(x)=∫g^(ξ)e2πix⋅ξ dξ for every Schwartz function g.

[F5]

Fourier transform on complex L1 classes: g^(η)=∫g(x)e−2πix⋅η dx for integrable g.

[F6]

A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions: under Countable Choice, the reflection x↦−x preserves Lebesgue integrals because its absolute determinant is one.

[F7]

Schwartz derivatives are integrable: under Countable Choice every Schwartz function belongs to Lp for each 1≤p≤∞.

[F8]

Fourier-slice identity for Schwartz inputs: under Countable Choice, RSg^(θ,σ)=g^(σθ) for Schwartz g.

[F9]

The Radon transform maps Schwartz functions to Schwartz offset data: for fixed θ, RSg(θ,⋅) is a Schwartz function.

[F10]

The Lp norm descends to the quotient and makes Lp a normed space for 1≤p≤∞: the L2 quotient norm is a norm and gives the triangle inequality and separation.

[F11]

Kernel directions preclude unrestricted recovery: if two truths share one exact datum, every deterministic data-only estimator has maximum target loss at least half their target distance.

[F12]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: a metric satisfies separation (M1), symmetry (M2), and the triangle inequality (M3); the metric induced by an L2 norm here is d(g,h)=∥g−h∥2.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed by the Fourier transform, inversion, Lp integrability, Fourier-slice, and Lebesgue substitution suppliers [F3], [F4], [F6]–[F9].

Verification

technique · direct
1.1F2givenconstruct

The sector V is a nonempty open subset of R2 because (r,ω)↦rω maps the open parameter set (1,2)×J to an open polar-coordinate sector. It therefore contains a ball; [F2] supplies a nonzero q∈Cc∞(V). This establishes the required bump choice.

1.2F3F4F5F6F7A1givenalgebra

By the Fourier definition [F5], the function in the Example is f(x)=q^(−x). Since q is smooth with compact support, every Schwartz seminorm of q is bounded, so q∈S. By [F3] its transform is Schwartz, and reflection preserves each Schwartz seminorm up to sign, hence f is Schwartz; [F7] gives f∈L2∩L1. The reflection substitution [F6] and inversion [F4] give f^(η)=∫q^(−x)e−2πix⋅η dx=∫q^(y)e2πiy⋅η dy=q(η). Since q≠0, this identity implies f is nonzero as an L1 and L2 class.

1.3A1F1F4F8F9given

For θ∈Θ and σ≠0, the point σθ is outside the support of q because every frequency in V has direction in J and J‾ is disjoint from Θ‾; also q(0)=0 since V avoids the origin. Thus [F8] gives RSf^(θ,σ)=q(σθ)=0 for all real σ. By [F9], the offset function is Schwartz, so Fourier inversion [F4] in one dimension gives RSf(θ,s)=0 for every s.

2.1F10F11F12step 1.2step 1.3∎

Let the parameter and target metric spaces both be L2(R2) with distance d(g,h)=∥g−h∥2, let the admissible truth class be U={0,f}, and let the target map q:U→L2(R2) be inclusion. Give the data space Y=L2(Θ×R) its norm metric and define F:U→Y by the restricted line integrals. The normed-space result [F10] and the metric axioms [F12] give the parameter, target, and data metrics used here. Theorem [F11] applies directly to this truth class and target map. Step 1.3 gives F(0)=F(f)=0, while step 1.2 gives d(q(0),q(f))=∥f∥2>0. Apply [F11] with shared datum 0 and radius 0 to any deterministic estimator Φ:Y→L2(R2); its maximum target loss is at least ∥f∥2/2. This proves the asserted lower bound on the stated two-truth class.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 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