Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29
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.

Smooth maps paste over an open cover

Statement

Let M and N be smooth manifolds, let (Ui)iI be an open cover of M, and let Fi:UiN be smooth maps such that FiUiUj=FjUiUj for all i,jI. Then there is a unique map F:MN with FUi=Fi for every iI, and F is smooth.

Facts & Assumptions

Given: An open cover (Ui)iI of M and smooth maps Fi:UiN agreeing on all overlaps.

[L1]

A family of continuous maps on an open cover that agree on overlaps determines a unique continuous map on the whole space (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L2]

A continuous map into N is smooth exactly when its restriction to every member of an open cover is smooth (Smoothness is local on the source).

Proof

technique · direct
1.1

Define F:MN by F(x):=Fi(x) whenever xUi. The overlap [given, L1] hypothesis makes this single-valued, and each Fi is continuous because smooth maps are continuous, so [L1] pastes the pieces into a unique continuous map F with FUi=Fi for every i.

givenL1
2.1

Every restriction FUi=Fi is smooth by the hypothesis, and F is [given, L2, step 1.1] continuous by step 1.1, so [L2] makes F smooth.

givenL2step 1.1
3.1

The uniqueness and the defining restriction property come from step 1.1, [step 1.1, step 2.1] and smoothness comes from step 2.1. This proves the claim.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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