Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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.

Whitney approximation for Euclidean-valued maps

Statement

Let F:MRk be continuous, where M is a smooth manifold, and let ε:M(0,) be a positive continuous error function. Then there exists a smooth map F~:MRk such that

F~(p)F(p)<ε(p)for all pM.

Facts & Assumptions

Given: A continuous map F:MRk and a positive continuous error function ε on M.

[F1]

A positive continuous error function is a continuous map ε:M(0,) (Positive continuous error functions for strong approximation).

[L1]

Smooth partitions of unity subordinate to countable coordinate covers exist (Smooth partitions of unity exist on manifolds, Smooth partitions subordinate to a countable coordinate cover).

Proof

technique · direct
1.1

By continuity of F and ε, each point pM has a coordinate neighbourhood Up on which F(q)F(q)<13ε(p)andε(q)>23ε(p) for all q,qUp. Choose a countable cover (Ui) of this type and points piUi.

F1givenchoose
2.1

Let (ϕi) be a smooth partition of unity subordinate to (Ui), provided by [L1], and set F~(q):=iϕi(q)F(pi). This is smooth because the family is locally finite.

L1step 1.1construct
3.1

Fix qM. Only indices with qUi contribute, so F~(q)F(q)=iϕi(q)(F(pi)F(q)). Hence F~(q)F(q)iϕi(q)F(pi)F(q)<iϕi(q)ε(q)2=ε(q)2<ε(q). Therefore F~ has the required pointwise error bound.

F1step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

9 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