Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30
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 pointwise-defined sum of smooth functions need not be smooth

Statement

False claim: whenever nfn(x) is pointwise defined and each fn is smooth, the sum is automatically smooth.

Facts & Assumptions

Given: A smooth bump η:R[0,1] supported in [1,1] with η(0)=1, and fn(x):=η(n2(x1/n)) for n1.

[L1]

Local finiteness, not mere pointwise definability, is the hypothesis that forces a smooth sum (A locally finite sum of smooth functions is smooth).

Refutation

technique · direct
1.1

For each fixed x, only finitely many of the values fn(x) are nonzero, so F(x):=n1fn(x) is pointwise defined; moreover F(0)=0 and F(1/n)1 for every n1.

given
2.1

The sequence 1/n0 but F(1/n)↛F(0), so F is not continuous at 0 and therefore not smooth.

step 1.1
3.1

This refutes the claim and shows why [L1] needs local finiteness.

L1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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