Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous

Statement

Let (X,dX)(X,d_X) be a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space), let (Y,dY)(Y,d_Y) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let f:XYf : X \to Y be a continuous bijection (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, Injection, surjection, bijection). Then:

  1. f[U]f[U] is open in YY for every UU open in XX (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);
  2. the inverse function f1:YXf^{-1} : Y \to X is continuous.

The words used are deliberately those of open sets and of the inverse map: a single name for a continuous bijection with continuous inverse is not available at this point in the reading order. No choice principle is used.

Facts & Assumptions

Given: A compact metric space (X,dX)(X,d_X), a metric space (Y,dY)(Y,d_Y) and a continuous bijection f:XYf : X \to Y.

[L2]

The image of a compact subset under a continuous map is a compact subset of the codomain (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).

[L3]

A compact subset of a metric space is closed (A compact subset of a metric space is closed and bounded).

[L6]

For a bijection f:XYf : X \to Y and UXU \subseteq X: f[XU]=Yf[U]f[X \setminus U] = Y \setminus f[U], and for the inverse function g=f1g = f^{-1} one has g1[U]=f[U]g^{-1}[U] = f[U] (Injection, surjection, bijection).

Proof

technique · direct
1.1

Let UXU \subseteq X be open; then XUX \setminus U is closed in XX.

L4
2.1

Being a closed subset of the compact space XX, the set XUX \setminus U is a compact subset of XX.

L1step 1.1
3.1

Hence f[XU]f[X \setminus U] is a compact subset of YY, and therefore closed in YY.

L2L3step 2.1
4.1

Since ff is a bijection, f[XU]=Yf[U]f[X\setminus U] = Y \setminus f[U], so f[U]=Yf[XU]f[U] = Y \setminus f[X \setminus U] is open in YY: claim 1.

L4L6step 3.1
5.1

Write g:=f1:YXg := f^{-1} : Y \to X, a function because ff is a bijection; for every open UXU \subseteq X the preimage g1[U]g^{-1}[U] equals f[U]f[U], which is open by claim 1, so gg is continuous: claim 2.

L5L6step 4.1

Remarks

Compactness of the domain is essential. Without it a continuous bijection can have a discontinuous inverse, and no part of the argument survives, compactness being consumed at steps 2.1 and 3.1 alike. What the theorem says is that on a compact domain no such failure occurs, and the reason is entirely the open map property established at step 4.1.

Hausdorffness of the codomain is used silently and is automatic here. What step 3.1 needs is that a compact subset of YY be closed, which is A compact subset of a metric space is closed and bounded and rests on the separation of distinct points by disjoint balls. Every metric space has that property, so no hypothesis on (Y,dY)(Y,d_Y) beyond being a metric space is required.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 84 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources