Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-09 (Codex)
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.

Naive extension by zero from an open set need not be smooth

Statement

False claim: if a smooth function is defined on an open set containing a closed set, then declaring it to be zero outside that open set always gives a smooth global extension.

Facts & Assumptions

Given: The closed set C={1}⊆R, the open set U=(0,∞) containing it, and the smooth function f(x)=1 on U.

[L1]

Smooth maps are continuous (Smooth maps are continuous).

Refutation

technique · direct
1.1givenL2

The set C is closed: its complement is the union of the open intervals (−∞,1) and (1,∞). Thus C⊆U and the constant smooth function f satisfy the claim's hypotheses. Its prescribed zero extension is F(x):=1 for x>0 and F(x):=0 for x≤0.

2.1L1L2step 1.1

Take ε=1/2. For every δ>0, the point x=δ/2 satisfies ∣x∣<δ and ∣F(x)−F(0)∣=1. Hence F is not continuous at zero by [L2], so it is not smooth by [L1].

3.1step 1.1step 2.1∎

Therefore extension by zero is not always smooth, even when the original open set contains the specified closed set. This does not deny the existence of another smooth extension: the constant function one on all of R already extends this f. No assertion that cutoffs are necessary for every extension, and no choice principle, is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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