Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 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.

Smoothly compatible charts and the smoothness of Euclidean transition maps

Definition

Let m≥1, let q∈N0, let W⊆Rm be open and let f:W→Rq. The map f is smooth (of class C∞) when every component fl:W→R, l<q, is of class Ck for every k∈N, where scalar Ck means that every iterated coordinate derivative through order k exists and is continuous on W (Ck maps and multi-index derivative notation in Euclidean space). For m=0 the domain is the one-point space or the empty set and every map from it is declared smooth; for q=0 there are no components and every map into the one-point space is smooth.

Let M be a topological n-manifold and let (U,φ) and (V,ψ) be charts on M (Manifold charts, coordinate domains, and coordinate functions). The charts are smoothly compatible when U∩V=∅, or when n≥1 and both transition maps

ψ∘φ−1:φ(U∩V)⟶ψ(U∩V),φ∘ψ−1:ψ(U∩V)⟶φ(U∩V)

are smooth in the sense above. Both directions of the transition are part of the definition; in dimension zero overlapping charts have the same one-point image, the only transition is the identity, and overlapping charts are declared compatible.

Remarks

  • Smoothness is a property of pairs of charts, not of a chart alone. One chart has no smoothness condition: any homeomorphism onto an open set is a chart. Smoothness enters only when two charts must agree on their overlap.

  • Both transition directions are required by definition. A bijective map whose one direction is smooth need not have a smooth inverse (for example, the two charts (R,id⁡) and (R,x↦x3) have reverse transition x↦x1/3, which is not differentiable at 0); requiring both directions outright makes compatibility genuinely symmetric, as Smooth chart compatibility is symmetric and reflexive records.

Depends on

Used by

Dependency tree · two levels

9 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