Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01
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.

A proper injective immersion is a smooth embedding

Statement

Let F:MN be a proper injective immersion of smooth manifolds. Then F is a smooth embedding.

Facts & Assumptions

Given: A proper injective immersion F:MN.

[F1]

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

[L1]

Every immersion is locally an embedding (Every immersion is locally an embedding).

Proof

technique · direct
1.1

By [L1], each point pM has a neighbourhood Up such that FUp is an embedding onto an embedded submanifold of N. In particular, the image of a closed subset of Up is closed in F(Up).

L1given
1.2

By [L2], F is continuous and M is locally compact while N is Hausdorff. A proper continuous map from a locally compact Hausdorff space to a Hausdorff space is closed, so F sends closed sets in M to closed sets in N. Therefore the corestriction F:MF(M) is a closed continuous bijection.

L2given
2.1

A closed continuous bijection onto a subspace is a homeomorphism. Thus the corestriction F:MF(M) is a homeomorphism, while step 1.1 already gives the local embedded-submanifold model coming from the immersion. By [F1], F is a smooth embedding.

F1step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

26 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