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

R2 is not homeomorphic to Rn for n≠2

Statement

For every natural number n≠2, there is no homeomorphism R2→Rn.

Facts & Assumptions

Given: A natural number n≠2.

[L1]

At the standard basepoint, the punctured plane has fundamental group isomorphic to Z; if the given n≥3, the punctured space Rn∖{0} is simply connected (The punctured plane has fundamental group Z, while punctured Rn is simply connected for n≥3).

[L2]

For every n≥2, there is no homeomorphism R→Rn (R is not homeomorphic to Rn for any n≥2).

[L3]

Pointed continuous maps induce homomorphisms on fundamental groups, functorially; in particular a pointed homeomorphism induces an isomorphism (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

[L5]

A map into Rm is continuous exactly when its component functions are continuous; sums and scalar multiples of continuous Euclidean-valued maps are continuous (A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions).

Proof

technique · cases
1.1L4F1assume-case zero

If n=0, then R0 is a singleton by [L4], while 0 and e0 are distinct points of R2; hence no bijection, and therefore no homeomorphism, exists.

1.2L2F1assume-case one

If n=1, a homeomorphism R2→R would have an inverse homeomorphism R→R2, contrary to [L2].

1.3givenF1L4L5assume-case high

It remains to treat n≥3. Suppose h:R2→Rn is a homeomorphism. Translating the target gives a homeomorphism h0(x)=h(x)−h(0) with h0(0)=0; its value y=h0(e0) is nonzero because h0 is injective. Choose j<n with yj≠0.

2.1step 1.3L5algebraconstruct

Let P permute coordinate j into coordinate 0, put u=P(y), and define A:Rn→Rn by A(z)0=z0/u0 and A(z)k=zk−(uk/u0)z0 for 1≤k<n. Its inverse is A−1(w)0=u0w0 and A−1(w)k=wk+ukw0, so [L5] makes A a homeomorphism fixing 0 and carrying u to e0. Thus g=A∘P∘h0 is a homeomorphism with g(0)=0 and g(e0)=e0.

3.1step 2.1L1L3

Restriction gives a pointed homeomorphism (R2∖{0},e0)→(Rn∖{0},e0), so [L3] gives an isomorphism of their fundamental groups. This contradicts [L1], because the source is isomorphic to the nontrivial group Z and the target is trivial. Hence no homeomorphism exists when n≥3.

4.1step 1.1step 1.2step 3.1cases-exhaustive∎

Since n≠2, exactly one of n=0, n=1, or n≥3 holds, and steps 1.1, 1.2, and 3.1 exclude a homeomorphism in every case.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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