Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 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.

Diffeomorphisms and local diffeomorphisms of manifolds

Definition

Let M and N be smooth manifolds. A diffeomorphism from M to N is a bijective smooth map F:MN whose inverse F1:NM is smooth. Since a bijective smooth map and its smooth inverse are both continuous (Smooth maps are continuous), every diffeomorphism is a homeomorphism, but the converse fails. The manifolds M and N are diffeomorphic, written MN, when a diffeomorphism MN exists.

Let F:MN be a smooth map. Then F is a local diffeomorphism when every pM has an open neighbourhood UM such that F(U) is open in N and the corestriction FUF(U):UF(U) is a diffeomorphism onto the open submanifold F(U) (An open subset of a smooth manifold has a canonical restricted smooth structure).

Remarks

  • Smoothness of the inverse is not automatic. A bijective smooth map need not be a diffeomorphism, and this is exactly why the definition demands smoothness of F1 outright: the map F(x)=x3 on R is smooth and bijective, but F1(y)=y1/3 is not differentiable at 0.

  • A diffeomorphism is a local diffeomorphism. Taking U=M at every point exhibits a diffeomorphism as a local diffeomorphism; no local inverse other than the global inverse is needed.

Depends on

Used by

Dependency tree · two levels

17 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