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

The image of a smooth embedding is an embedded submanifold

Statement

Let F:MmNn be a smooth embedding. Then F(M)N is an embedded m-submanifold, and the corestriction F:MF(M) is a diffeomorphism.

Facts & Assumptions

Given: A smooth embedding F:MmNn.

[F1]

A smooth embedding is an injective immersion and a homeomorphism onto its image with the subspace topology (Smooth embeddings).

[F2]

Embedded submanifolds are described by slice charts (Embedded submanifolds and slice charts).

[L1]

Near any point, an immersion has coordinates of the form u(u,0) (Local normal form for immersions).

Proof

technique · direct
1.1

Fix pM. By [F1] the map F is an immersion, so [L1] gives charts near p and F(p) in which F becomes u(u,0).

F1L1given
2.1

In those target coordinates, the image of a small neighbourhood of p is exactly the coordinate slice Rm×{0}. Because [F1] also says that F is a homeomorphism onto its image, we may shrink the neighbourhood in the target so that no other points of M map into that same slice patch. Hence the image is locally a slice chart in the sense of [F2].

F1F2step 1.1
3.1

Since every point of F(M) has such a slice neighbourhood, F(M) is an embedded m-submanifold. The corestriction F:MF(M) is already a homeomorphism by [F1], and in the local coordinates of step 1.1 it is the identity on the Rm factor, so it is a diffeomorphism.

F1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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