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.

All charts compatible with a smooth atlas form a smooth atlas

Statement

Let A be a smooth atlas on a topological manifold M. Then the set A of all charts on M that are smoothly compatible with every chart of A is again a smooth atlas on M. It contains A, and every member of A is by construction compatible with every chart of A.

Facts & Assumptions

Given: A smooth atlas A on a topological manifold M.

[F1]

Two charts are smoothly compatible exactly when their domains are disjoint or both transition maps are smooth; in dimension zero overlapping charts are declared compatible (Smoothly compatible charts and the smoothness of Euclidean transition maps).

[F2]

A smooth atlas is a family of charts on M whose domains cover M and whose members are pairwise smoothly compatible (Smooth atlases).

[F3]

Every chart is smoothly compatible with itself, and smooth compatibility of charts is symmetric (Smooth chart compatibility is symmetric and reflexive).

[L1]

The composite of two smooth maps between open subsets of Euclidean spaces is smooth (Compatibility of smooth atlases is an equivalence relation, and smooth Euclidean maps compose).

Proof

technique · direct
1.1

Every chart of A is compatible with itself by [F3] and with [given, F2, F3] every other chart of A by the pairwise condition in [F2], so every chart of A is compatible with every chart of A; hence AA. Since the domains of A cover M by [F2], the domains of A cover M.

givenF2F3
1.2

Let (U,φ) and (V,ψ) be charts compatible with every chart of [given, F1, F2, L1, choose] A, and let pUV. Because A covers M by [F2], choose (W,χ)A with pW. On φ(UVW) the transition factors as ψφ1=(ψχ1)(χφ1); the two factors are smooth because (U,φ) and (V,ψ) are each compatible with (W,χ), whose overlaps with both are nonempty, so the nonempty-overlap clause of [F1] supplies all four transitions, and [L1] makes the composite smooth on φ(UVW).

givenF1F2L1choose
2.1

Every point of φ(UV) lies in such a set [given, F1, step 1.2] φ(UVW), and a map between Euclidean open sets that is smooth on an open neighbourhood of every point is smooth: the iterated coordinate partial derivatives exist and are continuous near every point, hence on all of the open set φ(UV). Therefore ψφ1 is smooth on φ(UV). Interchanging the roles of (U,φ) and (V,ψ) runs the same argument for φψ1, again through the two-sided clause of [F1].

givenF1step 1.2
3.1

By step 2.1 any two members of A are smoothly compatible, and step 1.1 gives the covering condition. Hence A is a smooth atlas by [F2]; each member of A is compatible with every chart of A by the way A was defined.

F2step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

13 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