Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Smooth and integrable does not imply Schwartz

Statement

Assume countable choice. The function f(x)=(1+x2)1 belongs to C(R)L1(R) but not to S(R).

Facts & Assumptions

[F1]

Nonnegative continuous improper Riemann integrals on half-lines agree with their Lebesgue integrals under countable choice (A nonnegative improper Riemann integral on a half-line agrees with the Lebesgue integral).

Counterexample

1.1

The denominator 1+x2 is strictly positive. Inductively f(k)(x)=Qk(x)/(1+x2)k+1, where Q0=1 and Qk+1=(1+x2)Qk2(k+1)xQk; these derivatives are continuous, proving smoothness. On [0,1], f1, and for x1, f(x)x2. Thus for R1, 0Rf1+1Rx2dx=21/R2. The nonnegative improper integral exists and is finite; evenness gives the identical bound on the negative half-line. [F1] identifies the two improper integrals with the Lebesgue integrals, so f14.

F1givenalgebra
2.1

For x1, x4f(x)=x4/(1+x2)x2/2 as x. Therefore p4,0(f)=, violating the defining Schwartz condition despite step 1.1. Countable choice is used only through the improper-to-Lebesgue interface, not for the explicit smoothness or failed seminorm.

step 1.1given

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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