Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Compatibility of smooth atlases is an equivalence relation, and smooth Euclidean maps compose

Statement

Let M be a topological manifold.

  1. Compatibility of smooth atlases on M is an equivalence relation.
  2. Let W⊆Ra, W′⊆Rb, W′′⊆Rc be open. If u:W→W′ is smooth and g:W′→W′′ is of class Cr (r∈N∪{∞}), then g∘u is Cr; and if h:W→W′ is of class Cr and v:W′→W′′ is smooth, then v∘h is Cr.

Facts & Assumptions

Given: A topological manifold M; open Euclidean subsets W,W′,W′′; smooth maps u,v and Cr maps g,h as in the Statement, where for finite r a map is Cr when every component has every iterated coordinate derivative through order r existing and continuous.

[F1]

Compatibility of atlases is defined cross-pairwise, and the union of two compatible atlases is a smooth atlas (Smooth atlases, The union of two compatible smooth atlases is a smooth atlas).

[L1]

If f and g are totally differentiable at the matching points, then D(g∘f)(a)=Dg(f(a))∘Df(a) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[L2]

A total derivative computes partial derivatives: ∂jf(a)=Df(a)ej (A total derivative computes every directional derivative, and its matrix is the Jacobian).

[L6]

Total differentiability at a is the linear-approximation condition ∥f(a+h)−f(a)−Lh∥2/∥h∥2→0 (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder).

[A1]

Iterated partial derivatives are additive and homogeneous; and a scalar function is Ck when every iterated coordinate derivative through order k exists and is continuous (Ck maps and multi-index derivative notation in Euclidean space).

Proof

technique · direct
1.1F1given

Reflexivity and symmetry: A∪A=A is an atlas, [F1, given] so A is compatible with itself; and compatibility is cross-pairwise over the two atlases, so interchanging A and B leaves the same cross-pair conditions.

1.2givenA1L3L4L5

Claim 2 for r=0: by [A1] a C0 map is continuous, and u, being smooth, [given, A1, L3, L4, L5] has continuous first partials by [A1], is totally differentiable by [L3], and is continuous by [L4]; the composite is continuous by [L5]. The post-composition half is the same with h and v.

1.3givenL6L4

Multiplication μ(a,b)=ab is totally differentiable at every point with [given, L6, L4] Dμ(a,b)(s,t)=sb+at: the difference μ(a+s,b+t)−μ(a,b)−(sb+at) equals st, whose absolute value is at most the squared Euclidean norm of (s,t), so the normalized remainder of [L6] tends to zero; hence μ is continuous by [L4].

2.1step 1.3L1L2L3L5A1

Let p,q:W→R be scalar Ck maps. [step 1.3, L1, L2, L3, L5, A1] The case k=0 follows from step 1.3 and [L5], since pq=μ∘(p,q) with both factors continuous. For k≥1, [L3] makes (p,q) totally differentiable, [L1] applies to μ∘(p,q), and [L2] gives ∂i(pq)=(∂ip)q+p(∂iq). Induction on k shows the right-hand side is Ck−1, so pq is Ck by [A1].

3.1step 2.1A1

Finite sums of scalar Ck functions are Ck: [step 2.1, A1] sums are handled by the additivity and homogeneity in [A1], and products by step 2.1.

4.1step 1.2step 3.1L1L2L3A1given

Claim 2, for finite r, follows by induction on r. [step 1.2, step 3.1, L1, L2, L3, A1, given] The base case r=0 is step 1.2. For r≥1, the partials of each component gl are Cr−1 by [A1], so [L3] makes g and u totally differentiable and [L1], [L2] give ∂i(g∘u)l=∑j((∂jgl)∘u)⋅∂iuj. The induction hypothesis makes each (∂jgl)∘u of class Cr−1, smoothness of u makes each ∂iuj of class Cr−1, and step 3.1 makes the sum Cr−1. With step 1.2 this proves g∘u is Cr by [A1]. The post-composition half with v∘h is the same argument, and the case r=∞ follows by applying the finite case to every finite r.

5.1F1step 4.1choose

For transitivity, let A∼B and [F1, step 4.1, choose] B∼C. Fix charts (U,φ)∈A and (W,χ)∈C, and let p∈U∩W. Choose (V,ψ)∈B with p∈V, which exists because B covers M by [F1]. On the open set φ(U∩V∩W) one has χ∘φ−1=(χ∘ψ−1)∘(ψ∘φ−1), so step 4.1 with r=∞ makes this transition smooth on a neighbourhood of φ(p).

6.1step 5.1A1

Every point of φ(U∩W) has such a neighbourhood, so [step 5.1, A1] χ∘φ−1 is smooth on all of φ(U∩W) because the iterated partial derivatives exist and are continuous locally at every point. The same argument with the charts interchanged makes φ∘χ−1 smooth.

7.1F1step 1.1step 4.1step 6.1∎

Thus every chart of A is compatible with every chart of [F1, step 1.1, step 4.1, step 6.1] C, so A∪C is a smooth atlas by [F1]. This is exactly the transitivity of atlas compatibility. Together with step 1.1, compatibility of smooth atlases is an equivalence relation, and claim 2 was proved in step 4.1.

Depends on

Used by

Dependency tree · two levels

31 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