ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 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 smooth partition on real space subordinate to two half-spaces

Example

Let $n \geq 1$ . On $R^{n}$ , let $U_{-} : = {x : x_{1} < 2}$ and $U_{+} : = {x : x_{1} > - 2}$ , and define $ϕ_{+} (x) : = σ ((x_{1} + 1) / 2)$ and $ϕ_{-} (x) : = 1 - ϕ_{+} (x)$ . Then $(ϕ_{-}, ϕ_{+})$ is a smooth partition of unity subordinate to $(U_{-}, U_{+})$ .

Facts & Assumptions

Given: An integer $n \geq 1$ and the standard smooth step function $σ$ .

[F1]

The function $σ$ is smooth, equals $0$ on $(- \infty, 0]$ , and equals $1$ on $[1, \infty)$ (The standard smooth step function).

Verification

technique · direct

1.1

Because $x \mapsto (x_{1} + 1) / 2$ is smooth, so are $ϕ_{+}$ and $ϕ_{-} = 1 - ϕ_{+}$ .

F1given

2.1

The functions are nonnegative and sum to $1$ ; moreover $ϕ_{+} = 0$ when $x_{1} \leq - 1$ , so $supp (ϕ_{+}) \subseteq {x : x_{1} \geq - 1} \subseteq U_{+}$ , and $ϕ_{-} = 0$ when $x_{1} \geq 1$ , so $supp (ϕ_{-}) \subseteq {x : x_{1} \leq 1} \subseteq U_{-}$ .

F1step 1.1

3.1

Hence $(ϕ_{-}, ϕ_{+})$ is the required smooth partition.

step 2.1∎

Depends on

The standard smooth step function

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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

John M. Lee, Introduction to Smooth Manifolds (standard reference, not scraped)
Will J. Merry, Differential Geometry (standard reference, not scraped)
Nigel Hitchin, Differentiable Manifolds (standard reference, not scraped)