Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-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.

Locally finite linear combinations of sections are smooth

Statement

Let (σi)iI be smooth sections of a vector bundle EM and let (fi)iI be smooth real-valued functions on M. If the family of supports (supp(fiσi))iI is locally finite, then the pointwise sum

iIfiσi

defines a smooth section of E.

Facts & Assumptions

Given: Smooth sections σi, smooth functions fi, and a locally finite family of supports supp(fiσi).

[L1]

A section is smooth exactly when its local frame components are smooth (Smoothness of a section is equivalent to smooth local components).

[L2]

A locally finite sum of smooth scalar functions is smooth (A locally finite sum of smooth functions is smooth).

Proof

technique · direct
1.1

Fix a local frame (s1,,sr) on an open set U. Write σiU=jaijsj with smooth coefficient functions aij. Then on U the formal sum has components ifiaij. Because the supports of fiσi are locally finite, only finitely many terms are nonzero near each point.

L1given
2.1

Each component ifiaij is therefore a locally finite sum of smooth scalar functions, so it is smooth by [L2]. Applying [L1] again shows that ifiσi is a smooth section on U, and hence on all of M.

L1L2step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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