Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Invariance of domain

Statement

Assume AC. For n0, if URn is open and f:URn is continuous and injective, then f(U) is open and f:Uf(U) is a homeomorphism. In fact f sends every open subset of U to an open subset of Rn. AC is inherited from the duality used in the proof.

Facts & Assumptions

[F1]

Jordan–Brouwer separation says that an embedded Sn1 in Sn has exactly two complementary path components for n1. We use its spherical clause, including n=1.

[F3]

Alexander duality for compact locally contractible subsets of a sphere identifies reduced homology of a complement with the shifted reduced cohomology of the compact set. Its proof gives the explicit chart RnSn{}.

[F4]

Zero-th singular homology is free on path components makes vanishing reduced integral H0 equivalent to path connectedness for a nonempty space: the augmentation kernel is freely generated by differences from one component basis vector.

[F6]

Homotopic maps induce equal maps in singular cohomology and Singular cohomology is contravariantly functorial give cohomology invariance under a supplied contraction or homeomorphism.

[F7]

The Axiom of Choice is assumed for the exact uses inherited through [F1] and [F3].

Proof

Given: U,n,f as stated. If U is empty the conclusion is immediate. If n=0, R0 is a singleton and its only open subspaces are empty or itself; the only possible map in the nonempty case is the identity. Assume n1 and U.

1.1

Fix xU. Openness gives ρ>0 with B(x,ρ)U; take the closed ball D=B(x,ρ/2). It is compact by [F5]. The restriction fD is a homeomorphism onto its image: it is a continuous bijection there by injectivity, and it sends every closed FD to a closed subset of f(D). Indeed F is closed and bounded in Euclidean space, hence compact by [F5]; a cover of f(F) pulls back to a cover of F, proving compactness of the image; and [F2] makes that image closed. Thus the inverse has closed preimages of closed sets and is continuous. The same reasoning applies to the boundary DSn1. View both images in Sn using the chart of [F3].

F2F3F5given
2.1

The compact subset f(D) is proper in Sn since it avoids , is nonempty, and is weakly locally contractible by the homeomorphism in step 1.1. In the ball D, intersection with any sufficiently small ball about one of its points is convex, so contracts within any prescribed relative neighborhood after making the radius small; this includes boundary points. Also D contracts to its center by the straight-line homotopy. Its reduced integral cohomology is zero in every degree by [F6]: for a point, the unnormalized cochain groups are Z in every nonnegative degree and their coboundaries alternate zero and identity, giving only the constant class in degree zero. Consequently [F3] gives H~0(Snf(D);Z)=0. The complement contains , so [F4] proves that it is path connected. This supplies the connectedness of the disk complement without an implicit separation theorem.

F3F4F6step 1.1
2.2

The spherical statement [F1] applied to f(D) gives exactly two path components of Snf(D). This complement is open by compactness and [F2]. Its path components are open: about each point choose a path-connected coordinate ball lying in this open complement; it is contained in that point's path component, so the component is a union of such open balls.

F1F2F3step 1.1
3.1

There is a disjoint union of sets Snf(D)=f(intD)  (Snf(D)). Injectivity gives the equality f(D)f(D)=f(intD). Both displayed sets are nonempty and path connected: the first is the continuous image of the convex open ball and contains f(x); the second has this property by step 2.1. Each therefore lies in a single path component of the boundary complement. Since together they exhaust a space having exactly two path components by step 2.2, they must lie in distinct components and equal those components; otherwise the other component would have no point in their union. Hence f(intD) is open in Sn by step 2.2, and therefore open in its chart Rn. It is an open neighborhood of f(x) contained in f(U).

step 1.1step 2.1step 2.2
4.1

Each point of f(U) has such an open neighborhood by step 3.1, so their union f(U) is open; this statement requires no simultaneous selection of balls. If V is any open subset of U, it is open in Rn since U is open, and fV has the same continuity and injectivity hypotheses. Applying steps 1.1–3.1 to each point of V gives that f(V) is open in Rn. Thus the bijection f:Uf(U) is open. Its inverse is continuous because the inverse image under f1 of any open VU is exactly f(V), open in f(U). This proves the homeomorphism conclusion.

step 1.1step 3.1
5.1

The dimension-zero and empty cases were treated in the Given paragraph. In dimension one the proof uses the valid two-component statement in S1 for the two-point boundary, not the false two-component assertion for that boundary in R. Both the source ball and its image are allowed to have boundaries, but no assumption that the original map is already open or has continuous inverse was made. All coefficient calculations use integral groups solely to detect components, and do not rely on a nondegenerate singular-chain model. The AC use is exactly [F7]'s inherited duality assumption; compact image arguments, the choice of one ball at a fixed point, and taking the union of all resulting image neighborhoods add no AC.

F1F3F7step 1.1step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

64 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