Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Not suppliedSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-31
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 locally finite hat-function partition of unity on R\mathbb{R} subordinate to overlapping intervals

Example

For nZn\in\mathbb Z, let ψ(t)=max{1t,0}\psi(t)=\max\{1-|t|,0\} and φn(x)=ψ(xn)\varphi_n(x)=\psi(x-n). The functions are continuous, take values in [0,1][0,1], and have support [n1,n+1][n-1,n+1]. They are subordinate to the open cover Un=(n32,n+32)U_n=(n-\tfrac32,n+\tfrac32) of R\mathbb R.

If x[n,n+1]x\in[n,n+1], the only possibly nonzero functions are φn\varphi_n and φn+1\varphi_{n+1}, and φn(x)+φn+1(x)=(1(xn))+(1(n+1x))=1.\varphi_n(x)+\varphi_{n+1}(x)=(1-(x-n))+(1-(n+1-x))=1. Thus {φn}nZ\{\varphi_n\}_{n\in\mathbb Z} is a locally finite partition of unity subordinate to {Un}\{U_n\}. The support intervals show local finiteness directly: every bounded set meets only finitely many support intervals.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 50 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources