Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

An isometric embedding is injective and carries the metric topology of the source onto the subspace topology of its image

Statement

Let (X,dX) and (Y,dY) be metric spaces and let f:X→Y be an isometric embedding (Isometry, isometric embedding, and the subspace metric on a subset). Write Z:=f[X]⊆Y with its subspace metric dZ. Then:

  1. f is injective (Injection, surjection, bijection).
  2. f, viewed as a map X→Z, is an isometry.
  3. f[BX(x,r)]=BZ(f(x),r) for every x∈X and r>0 (Open ball, closed ball and sphere in a metric space).
  4. A subset U⊆X is open in (X,dX) if and only if f[U] is open in (Z,dZ) (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). So U↦f[U] is a bijection from the metric topology of X onto the subspace topology of f[X], and f is a homeomorphism onto its image.

Facts & Assumptions

Given: Metric spaces (X,dX), (Y,dY), an isometric embedding f:X→Y, the image Z:=f[X] with the subspace metric dZ=dY↾(Z×Z), and the map g:Z→X inverse to f:X→Z once claim 2 is available.

[A1]

Isometric embedding: dY(f(x),f(x′))=dX(x,x′) for all x,x′∈X; the subspace metric on Z is the restriction of dY (Isometry, isometric embedding, and the subspace metric on a subset).

[A2]

Separation (M1): dX(x,x′)=0 if and only if x=x′ (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L1]

Balls: BX(x,r)={x′:dX(x,x′)<r}, and likewise in Z with dZ (Open ball, closed ball and sphere in a metric space).

[L3]

A bijection h and its inverse satisfy h[S]=(h−1)−1[S] and h−1[h[S]]=S for every subset S of the domain (Injection, surjection, bijection).

Proof

technique · direct
1.1

Injectivity: if f(x)=f(x′) then dX(x,x′)=dY(f(x),f(x′))=0, hence x=x′ by (M1); this is claim 1.

A1A2
2.1

As a map X→Z the function f is surjective, Z being its image by definition, and it is injective by step 1.1, so it is a bijection X→Z; and dZ(f(x),f(x′))=dY(f(x),f(x′))=dX(x,x′), since dZ is the restriction of dY, so it is an isometry, which is claim 2.

step 1.1A1
3.1

Both f:X→Z and its inverse g:Z→X are continuous, with δ:=ε serving at every point in both directions, because dZ(f(x),f(x′))=dX(x,x′) and, writing z=f(x), z′=f(x′), also dX(g(z),g(z′))=dZ(z,z′).

step 2.1A1L2
3.2

Claim 3: f[BX(x,r)]={f(x′):dX(x,x′)<r}={f(x′):dZ(f(x),f(x′))<r}, and as f is onto Z the latter set is {z∈Z:dZ(f(x),z)<r}=BZ(f(x),r).

step 2.1A1L1
4.1

By [L2] applied to the continuous maps of step 3.1, the preimage under f:X→Z of every open subset of Z is open in X, and the preimage under g of every open subset of X is open in Z.

step 3.1L2
5.1

Claim 4: for U⊆X we have f[U]=g−1[U], so if U is open in X then f[U] is open in Z by step 4.1; conversely U=f−1[f[U]], so if f[U] is open in Z then U is open in X by step 4.1. Hence U↦f[U] maps the topology of X into that of Z, is injective because f is, and is onto because any open W⊆Z equals f[f−1[W]] with f−1[W] open.

step 2.1step 4.1L3
6.1

Claims 1, 2, 3 and 4 are established by steps 1.1, 2.1, 3.2 and 5.1, so an isometric embedding identifies X with the metric subspace f[X] of Y, as a metric space and hence as a topological one.

step 1.1step 3.2step 5.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

25 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