Alphabeta Math
Session-authored (Fable 5 assisted)
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.

19 results · all verified · 16 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Topology of Euclidean Space

1 · Prerequisites

2 · Summary

The product topology, the Euclidean metric topology, and the topologies from finite-dimensional norms agree on Rn\mathbb R^n. The declared compactness prerequisite supplies open-cover compactness, Heine-Borel, compact images and extrema, metric compactness equivalences, and connectedness. The normed-space prerequisite supplies Euclidean metrics, norm comparison, standard coordinates, and continuity of norms; finite counting supplies finite-product countability and finite selections used for rational boxes.

For nonempty Euclidean subsets, the development proves the ZF equivalence of compactness, closedness and boundedness, pseudocompactness, and the extreme-value property, then records the extension under ACω\mathrm{AC}_\omega and DC\mathrm{DC}. It develops polygonal paths, open-set connectedness, components, local compactness, and rational points and boxes directly. Punctured spaces and radial normalisation then give sphere connectedness and the point-removal argument that separates the line from higher-dimensional Euclidean spaces.

3 · Logical flowchart

4 · Definitions, theorems and proofs

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The product, Euclidean-metric and norm topologies on Rn\mathbb{R}^n agree, and for n=1n=1 they agree with the real-line topology

For n1n \ge 1, the product topology on Rn\mathbb{R}^n is the metric topology of each of d1d_1, d2d_2, and dd_\infty (For n1n \ge 1 the product topology on nn copies of the usual topology of R\mathbb{R} is the metric topology of dd_\infty on Rn\mathbb{R}^n, and hence also of d1d_1 and d2d_2, so Rn\mathbb{R}^n as a product and Rn\mathbb{R}^n as a metric space are one space). Every norm on Rn\mathbb{R}^n is equivalent to the Euclidean norm, hence induces that same topology (For n1n \ge 1 all norms on Rn\mathbb{R}^n are equivalent). Thus open, closed, compact, connected, and continuous below have one unambiguous Euclidean meaning.

When n=1n=1, the Euclidean metric is the usual metric dR(s,t)=std_{\mathbb{R}}(s,t)=|s-t|, and the metric and real-line formulations of continuity and compactness agree (Dictionary: for ARA \subseteq \mathbb{R} with the metric d(x,y)=xyd(x,y) = |x-y|, continuity and uniform continuity of f:ARf : A \to \mathbb{R} agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R\mathbb{R} is compact in the open-cover sense of R\mathbb{R} exactly when it is a compact metric subspace). This page works throughout with n1n \ge 1.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Euclidean spheres and closed balls as subspaces of Rn\mathbb{R}^n

Definition

Let nNn \in \mathbb{N} with n1n \ge 1. Give Rn\mathbb{R}^n its Euclidean norm 2\lVert\cdot\rVert_2 and its induced Euclidean metric d2d_2 (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). For cRnc \in \mathbb{R}^n and r>0r>0, put

B2(c,r):={xRn:xc2r},S2(c,r):={xRn:xc2=r}.\overline B_2(c,r):=\{x\in\mathbb{R}^n:\lVert x-c\rVert_2\le r\},\qquad S_2(c,r):=\{x\in\mathbb{R}^n:\lVert x-c\rVert_2=r\}.

These are respectively the Euclidean closed ball and Euclidean sphere with centre cc and radius rr. They carry the subspace topology inherited from Rn\mathbb{R}^n (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). Since d2(c,x)=xc2d_2(c,x)=\lVert x-c\rVert_2, they are precisely the closed ball and sphere Bˉ(c,r)\bar B(c,r) and S(c,r)S(c,r) of the metric-space definition (Open ball, closed ball and sphere in a metric space).

For the unit sphere centred at the origin write

Sn1:=S2(0,1).S^{n-1}:=S_2(0,1).

The exponent is notation for this particular sphere, not a claim that a dimension theory has been developed here.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Pseudocompact space: every continuous real-valued function has bounded image

Definition

A topological space XX is pseudocompact when every continuous map f:XRf:X\to\mathbb{R} (Continuity of a map of topological spaces at a point and globally) has bounded image: there are reals ,u\ell,u with f(x)u\ell\le f(x)\le u for every xXx\in X (Lower bound, bounded below, bounded set).

A subset AA of a topological space is pseudocompact when AA, equipped with its subspace topology, is pseudocompact (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Remarks

No separation axiom is part of this definition. Some texts reserve the word for completely regular spaces; here it names exactly the bounded-image condition just stated.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A pseudocompact subset of Rn\mathbb{R}^n is bounded

Statement

Let n1n\ge1. Every pseudocompact subset ARnA\subseteq\mathbb{R}^n is bounded for the Euclidean metric.

Facts & Assumptions

Given: A pseudocompact subset ARnA\subseteq\mathbb{R}^n, where Rn\mathbb{R}^n has the Euclidean metric d2d_2.

[L2]

A pseudocompact space has bounded image under every continuous real-valued map (Pseudocompact space: every continuous real-valued function has bounded image).

[L3]

A subset of a metric space is bounded when it is empty or lies in some open ball (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); a bounded set of reals has an upper bound (Lower bound, bounded below, bounded set).

Proof

technique · direct
1.1

The restriction N:ARN:A\to\mathbb{R}, N(x)=x2N(x)=\lVert x\rVert_2, is continuous, because the ambient norm is continuous by [L1] and AA has the subspace topology.

L1
1.2

Pseudocompactness gives that N[A]N[A] is bounded. If AA\ne\varnothing, choose an upper bound MM of N[A]N[A]; then M0M\ge0 because every norm is nonnegative.

L2L3choose
2.1

If A=A=\varnothing it is bounded. Otherwise every xAx\in A satisfies d2(x,0)=x2M<M+1d_2(x,0)=\lVert x\rVert_2\le M<M+1, so ABd2(0,M+1)A\subseteq B_{d_2}(0,M+1).

step 1.2L3
3.1

Thus AA is bounded in both cases.

step 2.1
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A pseudocompact subset of Rn\mathbb{R}^n is closed

Statement

Let n1n\ge1. Every pseudocompact subset ARnA\subseteq\mathbb{R}^n is closed in the Euclidean topology.

Facts & Assumptions

Given: A pseudocompact subset ARnA\subseteq\mathbb{R}^n, with Euclidean metric d2d_2 and norm 2\lVert\cdot\rVert_2.

[L1]

A set is closed if and only if it equals its closure; and pAp\in\overline A means every open neighbourhood of pp meets AA (A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set).

[L3]

The reverse triangle inequality gives u2v2uv2|\lVert u\rVert_2-\lVert v\rVert_2|\le\lVert u-v\rVert_2, and the Euclidean norm is continuous (The finite and reverse triangle inequalities for a norm; and for n1n \ge 1 every norm NN on Rn\mathbb{R}^n satisfies N(x)Cx1N(x) \le C\lVert x\rVert_1 and is Lipschitz, hence continuous, for d2d_2).

[L4]

Pseudocompactness requires every continuous real-valued function on AA to have bounded image (Pseudocompact space: every continuous real-valued function has bounded image).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that AA is not closed. By [L1], fix pAAp\in\overline A\setminus A.

assume-contraL1choose
2.1

Define f:ARf:A\to\mathbb{R} by f(x):=1/xp2f(x):=1/\lVert x-p\rVert_2. This is defined because pAp\notin A, so every denominator is positive.

step 1.1construct
2.2

For every real M>0M>0, [L1] and [L2] give xAx\in A with xp2<1/M\lVert x-p\rVert_2<1/M; then f(x)>Mf(x)>M. Hence f[A]f[A] is unbounded.

step 1.1L1L2
3.1

The function ff is continuous on AA: at aAa\in A put d:=ap2>0d:=\lVert a-p\rVert_2>0. If xa2<d/2\lVert x-a\rVert_2<d/2, then [L3] gives xp2>d/2\lVert x-p\rVert_2>d/2, and f(x)f(a)2d2xa2.|f(x)-f(a)| \le \frac{2}{d^2}\lVert x-a\rVert_2. Thus a sufficiently small Euclidean ball about aa maps into any prescribed real neighbourhood of f(a)f(a).

step 2.1L2L3
4.1

Steps 3.1 and 2.2 contradict pseudocompactness through [L4]. Therefore AA is closed.

step 3.1step 2.2L4discharge-contradiction
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

For a nonempty subset of Rn\mathbb{R}^n with n1n\ge1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent

Statement

Let n1n\ge1 and let ARnA\subseteq\mathbb{R}^n be nonempty. The following are equivalent.

  1. AA is compact.
  2. AA is closed and bounded.
  3. AA is pseudocompact.
  4. Every continuous f:ARf:A\to\mathbb{R} attains a maximum and a minimum on AA.

This theorem is a ZF statement. The nonemptiness hypothesis is necessary for condition 4, because the empty image has neither a maximum nor a minimum.

Facts & Assumptions

Given: A nonempty subset ARnA\subseteq\mathbb{R}^n with n1n\ge1, carrying the Euclidean subspace topology.

[L4]

Pseudocompactness means that every continuous real-valued function has bounded image (Pseudocompact space: every continuous real-valued function has bounded image).

Proof

technique · direct
1.1

Conditions 1 and 2 are equivalent by [L1] and [L5].

L1L5
1.2

Condition 3 implies condition 2 by [L2].

L2
1.3

Suppose condition 1 holds. Every continuous f:ARf:A\to\mathbb{R} then attains a maximum and a minimum by [L3], so condition 4 holds.

L3
1.4

Suppose condition 4 holds. For every continuous f:ARf:A\to\mathbb{R}, its maximum and minimum bound f[A]f[A], so AA is pseudocompact and condition 3 holds.

L4
2.1

The implications 121\Leftrightarrow2, 3213\Rightarrow2\Rightarrow1, and 1431\Rightarrow4\Rightarrow3 prove all four conditions equivalent.

step 1.1step 1.2step 1.3step 1.4
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Assuming ACω\mathrm{AC}_\omega and DC\mathrm{DC}, compactness, sequential compactness, countable compactness, limit point compactness, completeness and total boundedness, pseudocompactness, closedness and boundedness, and the extreme-value property are equivalent for nonempty subsets of Rn\mathbb{R}^n with n1n\ge1

Statement

Assume ACω\mathrm{AC}_\omega and DC\mathrm{DC}. If n1n\ge1 and ARnA\subseteq\mathbb{R}^n is nonempty, then the following conditions are equivalent: compactness; closedness and boundedness; pseudocompactness; attainment of a maximum and minimum by every continuous ARA\to\mathbb{R}; countable compactness; sequential compactness; limit point compactness; and completeness together with total boundedness.

Facts & Assumptions

Given: ACω\mathrm{AC}_\omega (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), DC\mathrm{DC} (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain), an integer n1n\ge1, and a nonempty Euclidean subset AA.

[L1]

The four Euclidean conditions compactness, closedness and boundedness, pseudocompactness, and the extreme-value property are equivalent in ZF (For a nonempty subset of Rn\mathbb{R}^n with n1n\ge1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[L2]

Under ACω\mathrm{AC}_\omega and DC\mathrm{DC}, a metric space is compact if and only if it is countably compact, limit point compact, sequentially compact, or complete and totally bounded (For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).

Proof

technique · direct
1.1

The ZF part of the chart is exactly [L1].

L1
1.2

In the Euclidean metric, compactness is equivalent to each of countable compactness, limit point compactness, sequential compactness, and completeness together with total boundedness by [L2].

L2
2.1

By [L3], this metric compactness is the compactness already occurring in step 1.1. Joining the two equivalence classes proves the asserted chart.

L3step 1.1step 1.2
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

For n1n\ge1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact

Statement

For n1n\ge1, cRnc\in\mathbb{R}^n, and r>0r>0, the Euclidean closed ball B2(c,r)\overline B_2(c,r) and Euclidean sphere S2(c,r)S_2(c,r) are compact.

Facts & Assumptions

Given: n1n\ge1, cRnc\in\mathbb{R}^n, and r>0r>0.

[L1]

The sets B2(c,r)\overline B_2(c,r) and S2(c,r)S_2(c,r) are respectively the points satisfying xc2r\lVert x-c\rVert_2\le r and xc2=r\lVert x-c\rVert_2=r (Euclidean spheres and closed balls as subspaces of Rn\mathbb{R}^n).

[L2]

The Euclidean norm is continuous and satisfies u2v2uv2|\lVert u\rVert_2-\lVert v\rVert_2|\le\lVert u-v\rVert_2 (The finite and reverse triangle inequalities for a norm; and for n1n \ge 1 every norm NN on Rn\mathbb{R}^n satisfies N(x)Cx1N(x) \le C\lVert x\rVert_1 and is Lipschitz, hence continuous, for d2d_2).

Proof

technique · direct
1.1

Both sets are bounded: B2(c,r)\overline B_2(c,r) lies in the ball of radius r+1r+1 about cc, and S2(c,r)B2(c,r)S_2(c,r)\subseteq\overline B_2(c,r).

L1L4
1.2

The complement of B2(c,r)\overline B_2(c,r) is open: if xc2>r\lVert x-c\rVert_2>r, then the ball about xx of radius (xc2r)/2(\lVert x-c\rVert_2-r)/2 stays in the complement by [L2].

L1L2L4
1.3

The complement of S2(c,r)S_2(c,r) is open: if xc2r\lVert x-c\rVert_2\ne r, then a ball about xx of radius xc2r/2|\lVert x-c\rVert_2-r|/2 avoids the sphere by [L2].

L1L2L4
2.1

Thus both sets are closed and bounded, hence compact by [L3].

step 1.1step 1.2step 1.3L3
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n

Definition

Let ARnA\subseteq\mathbb{R}^n. A polygonal path in AA from xx to yy is a path γ:[0,1]A\gamma:[0,1]\to A (Paths, path-connected spaces and path components, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) for which there are a finite list of vertices v0,,vmAv_0,\ldots,v_m\in A and a partition 0=t0<t1<<tm=10=t_0<t_1<\cdots<t_m=1 such that v0=xv_0=x, vm=yv_m=y, and

γ(t)=tittiti1vi1+tti1titi1viwhen ti1tti.\gamma(t)=\frac{t_i-t}{t_i-t_{i-1}}v_{i-1}+\frac{t-t_{i-1}}{t_i-t_{i-1}}v_i\quad\text{when }t_{i-1}\le t\le t_i.

The formula uses only scalar multiplication and vector addition in Rn\mathbb{R}^n (Vector space over a field). The finite list is indexed by a natural number (The cardinality A\lvert A\rvert of a finite set).

The subset AA is polygonally connected when every pair of its points is joined by a polygonal path in AA.

Remarks

A polygonal path is required to be a path, so its continuity is part of the definition. The next lemma verifies continuity for the displayed finite concatenations when their image lies in the stated subset.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A finite concatenation of straight segments in Rn\mathbb{R}^n is a continuous path

Statement

Let v0,,vmRnv_0,\ldots,v_m\in\mathbb{R}^n and 0=t0<<tm=10=t_0<\cdots<t_m=1. The affine pieces joining vi1v_{i-1} to viv_i define a continuous map [0,1]Rn[0,1]\to\mathbb{R}^n. If every piece lies in a subset AA, the map is a polygonal path (Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n) in AA from v0v_0 to vmv_m.

Facts & Assumptions

Given: Vertices v0,,vmRnv_0,\ldots,v_m\in\mathbb{R}^n and a partition 0=t0<<tm=10=t_0<\cdots<t_m=1.

[L1]

A finite family of closed sets covering a space pastes continuous restrictions to a continuous map (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, claim 3).

[L2]

A map whose values lie in a subspace is continuous into that subspace exactly when its composite with the inclusion into the ambient space is continuous (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[L3]

A map into Rn\mathbb{R}^n is continuous if and only if all of its coordinate functions 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, clause 1).

Proof

technique · constructive
1.1

On [ti1,ti][t_{i-1},t_i] define γi(t):=((tit)/(titi1))vi1+((tti1)/(titi1))vi\gamma_i(t):=((t_i-t)/(t_i-t_{i-1}))v_{i-1}+((t-t_{i-1})/(t_i-t_{i-1}))v_i. Each coordinate is an affine real function of tt, hence continuous.

L3construct
2.1

At every shared endpoint tit_i, the adjacent formulas both give viv_i, so the pieces define one function γ:[0,1]Rn\gamma:[0,1]\to\mathbb{R}^n.

step 1.1construct
3.1

Each interval [ti1,ti][t_{i-1},t_i] is closed in [0,1][0,1], the finitely many intervals cover it, and each restriction of γ\gamma is continuous by step 1.1. Thus γ\gamma is continuous by [L1].

L1step 1.1step 2.1
4.1

If the pieces lie in AA, then γ\gamma takes values in AA. Its composite with the inclusion ARnA\hookrightarrow\mathbb R^n is the continuous map of step 3.1, so [L2] makes it continuous into the subspace AA. Its endpoints are v0,vmv_0,v_m, hence it is a path in AA.

step 3.1L2discharge-construct
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The points polygonally reachable from a fixed point form a clopen subset of every open subset of Rn\mathbb{R}^n

Statement

Let URnU\subseteq\mathbb{R}^n be open and let aUa\in U. The set RaR_a of points of UU joined to aa by a polygonal path (Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n) in UU is both open and closed in the subspace UU.

Facts & Assumptions

Given: An open subset URnU\subseteq\mathbb{R}^n, a point aUa\in U, and the polygonally reachable set RaUR_a\subseteq U.

[L2]

A straight segment between two points of an Euclidean ball stays in that ball, by the triangle inequality for the Euclidean norm (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it).

[L3]

A finite concatenation of such segments is a continuous polygonal path (A finite concatenation of straight segments in Rn\mathbb{R}^n is a continuous path).

Proof

technique · direct
1.1

Let yRay\in R_a. Choose r>0r>0 with B(y,r)UB(y,r)\subseteq U. For every zB(y,r)z\in B(y,r), the segment from yy to zz lies in B(y,r)B(y,r) by [L2].

L1L2choose
1.2

Let yURay\in U\setminus R_a and choose r>0r>0 with B(y,r)UB(y,r)\subseteq U. If some zB(y,r)z\in B(y,r) lay in RaR_a, a path from aa to zz followed by the segment from zz to yy would put yy in RaR_a, a contradiction.

L1L2L3choose
2.1

Concatenating a polygonal path from aa to yy with that segment gives a polygonal path from aa to zz in UU. Thus B(y,r)RaB(y,r)\subseteq R_a, so RaR_a is open in UU.

L3step 1.1
3.1

Hence B(y,r)URaB(y,r)\subseteq U\setminus R_a, so the complement is open in UU. Therefore RaR_a is clopen in UU.

step 2.1step 1.2
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

For an open subset of Rn\mathbb{R}^n, connectedness, path-connectedness and polygonal connectedness are equivalent

Statement

Let URnU\subseteq\mathbb{R}^n be open. Then UU is connected if and only if it is path-connected, if and only if it is polygonally connected.

Facts & Assumptions

Given: An open subset URnU\subseteq\mathbb{R}^n.

Proof

technique · direct
1.1

Suppose UU is connected. If U=U=\varnothing, then polygonal connectedness, path-connectedness, and connectedness all hold vacuously. Otherwise choose aUa\in U. The reachable set RaR_a is nonempty and clopen by [L1], so [L3] gives Ra=UR_a=U.

L1L3caseschoose
1.2

Polygonal connectedness implies path-connectedness, and path-connectedness implies connectedness, by [L2].

L2
2.1

In the nonempty case, every point of U=RaU=R_a is joined to aa by a polygonal path; reversing one such path and concatenating it with another joins any two points of UU. Together with the empty case, connectedness implies polygonal connectedness.

step 1.1
3.1

Steps 2.1 and 1.2 give all three equivalences.

step 2.1step 1.2
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (claude-sonnet-5)Open item page →

Every connected component of an open subset of Rn\mathbb{R}^n is open and polygonally connected

Statement

Every connected component of an open subset URnU\subseteq\mathbb{R}^n is open in Rn\mathbb{R}^n and polygonally connected.

Facts & Assumptions

Given: An open subset URnU\subseteq\mathbb{R}^n and a connected component CC of UU.

[L2]

A component is the largest connected subset containing each of its points (Connected components, quasicomponents, and totally disconnected spaces).

Proof

technique · direct
1.1

Let xCx\in C. Since UU is open, choose r>0r>0 with B(x,r)UB(x,r)\subseteq U. The ball is connected by [L1], meets CC at xx, and so lies in CC by maximality of the component.

L1L2choose
2.1

Therefore every point of CC has a Euclidean ball contained in CC, so CC is open in Rn\mathbb{R}^n.

step 1.1
3.1

The component CC is connected and now open, so [L3] makes it polygonally connected.

L3step 2.1
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Rn\mathbb{R}^n is polygonally connected, connected, locally path-connected and locally connected

Statement

For n1n\ge1, Rn\mathbb{R}^n is polygonally connected and connected, and it is locally path-connected and locally connected.

Facts & Assumptions

Given: Rn\mathbb{R}^n with n1n\ge1 and its Euclidean topology.

[L1]

A segment t(1t)x+tyt\mapsto(1-t)x+ty is a continuous polygonal path in Rn\mathbb{R}^n (A finite concatenation of straight segments in Rn\mathbb{R}^n is a continuous path, Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n).

[L4]

The norm triangle inequality keeps a segment joining two points of an open ball inside that ball (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Proof

technique · direct
1.1

For x,yRnx,y\in\mathbb{R}^n, the one-segment path t(1t)x+tyt\mapsto(1-t)x+ty joins them. Hence Rn\mathbb{R}^n is polygonally connected.

L1
1.2

Let xRnx\in\mathbb{R}^n and let UU be open with xUx\in U. Choose r>0r>0 with B(x,r)UB(x,r)\subseteq U. Each pair of points in this ball is joined by its segment, which stays in the ball by [L4].

L1L2L4choose
2.1

It is path-connected and therefore connected by [L3].

L3step 1.1
3.1

Thus every open neighbourhood contains an open path-connected ball, so Rn\mathbb{R}^n is locally path-connected, and it is locally connected by [L3].

L2L3step 1.2
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Rn\mathbb{R}^n is locally compact and σ\sigma-compact

Statement

For n1n\ge1, Euclidean space Rn\mathbb{R}^n is locally compact and σ\sigma-compact.

Facts & Assumptions

Given: Rn\mathbb{R}^n with n1n\ge1, its origin 00, and its Euclidean norm.

[L3]

For every real MM there is a natural k1k\ge1 with M<k1RM<k\cdot1_{\mathbb R} (Every complete ordered field is Archimedean).

Proof

technique · constructive
1.1

For xRnx\in\mathbb{R}^n, the closed ball B2(x,1)\overline B_2(x,1) is compact by [L1] and contains the open ball B2(x,1)B_2(x,1) about xx. Thus xx has a compact neighbourhood.

L1L2
1.2

For each kNk\in\mathbb N put Kk:=B2(0,k+1)K_k:=\overline B_2(0,k+1). Every KkK_k is compact by [L1].

L1construct
2.1

If xRnx\in\mathbb R^n, [L3] gives k1k\ge1 with x2<k\lVert x\rVert_2<k, so xKkx\in K_k. Hence Rn=kNKk\mathbb R^n=\bigcup_{k\in\mathbb N}K_k.

L3step 1.2choose
3.1

Step 1.1 gives local compactness and step 2.1 gives σ\sigma-compactness.

L2step 1.1step 2.1discharge-construct
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every finite power of an at most countable set is at most countable

Statement

If CC is at most countable and mNm\in\mathbb N, then the finite product Cm=i<mCC^m=\prod_{i<m}C is at most countable.

Facts & Assumptions

Proof

technique · induction
1.1

For m=0m=0, C0C^0 is a one-point set by [L2], hence at most countable by [L3].

baseL2L3
1.2

Assume CmC^m is at most countable.

ih
2.1

The product Cm+1C^{m+1} is canonically Cm×CC^m\times C, so it is at most countable by [L1].

step 1.2L1
3.1

By induction, CmC^m is at most countable for every mNm\in\mathbb N.

basestep 1.2step 2.1L3discharge-induction
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Qn\mathbb{Q}^n is a countable dense subset of Rn\mathbb{R}^n, and rational open boxes form a countable basis

Statement

Let n1n\ge1. The set Qn\mathbb Q^n is countable and dense in Rn\mathbb R^n. Moreover the rational open boxes

i<n(ai,bi),ai,biQ,ai<bi,\prod_{i<n}(a_i,b_i),\qquad a_i,b_i\in\mathbb Q,\quad a_i<b_i,

form a countable basis for the product topology on Rn\mathbb R^n.

Facts & Assumptions

Given: n1n\ge1, the product Rn=i<nR\mathbb R^n=\prod_{i<n}\mathbb R, and the rationals embedded in R\mathbb R.

[L1]

Q\mathbb Q is countably infinite, and every finite power of an at most countable set is at most countable (Q\mathbb{Q} is countably infinite, Every finite power of an at most countable set is at most countable).

[L4]

A family is a basis when each point of each open set lies in one of its members contained in that open set (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L5]

Finite choices may be assembled into a tuple, and a subset of an at most countable set is at most countable (Every natural-number-indexed list of nonempty sets has a choice function on its family of values, Every subset of an at most countable set is at most countable).

Proof

technique · constructive
1.1

By [L1], Qn\mathbb Q^n is at most countable. It is infinite because the injection q(q,0,,0)q\mapsto(q,0,\ldots,0) embeds Q\mathbb Q in it, hence it is countable.

L1
1.2

Let U=i<nUiU=\prod_{i<n}U_i be a nonempty basic product-open set. Every UiU_i is nonempty and open, so [L2] gives a rational qiUiq_i\in U_i; finite choice supplies the tuple q=(qi)i<nQnUq=(q_i)_{i<n}\in\mathbb Q^n\cap U.

L2L5choose
1.3

Let xU=i<nUix\in U=\prod_{i<n}U_i be a basic product-open neighbourhood. For each i<ni<n, use [L6] to choose ri>0r_i>0 with (xiri,xi+ri)Ui(x_i-r_i,x_i+r_i)\subseteq U_i, then use [L2] to choose rationals xiri<ai<xi<bi<xi+ri.x_i-r_i<a_i<x_i<b_i<x_i+r_i. Finite choice assembles these choices, and then xi<n(ai,bi)Ux\in\prod_{i<n}(a_i,b_i)\subseteq U.

L2L5L6choose
2.1

Every nonempty open subset contains a nonempty basic product-open set about each of its points by [L3], so step 1.2 shows that every nonempty open subset meets Qn\mathbb Q^n. Thus Qn\mathbb Q^n is dense.

L3step 1.2
3.1

Step 1.3 and [L4] show that rational open boxes form a basis. They are indexed by a subset of Q2n\mathbb Q^{2n}, which is at most countable by [L1], so the basis is at most countable by [L5].

L1L4L5step 1.3
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

For n2n\ge2, the punctured space Rn{0}\mathbb{R}^n\setminus\{0\} is polygonally connected

Statement

For n2n\ge2, Rn{0}\mathbb R^n\setminus\{0\} is polygonally connected.

Facts & Assumptions

Given: n2n\ge2 and nonzero vectors x,yRnx,y\in\mathbb R^n.

[L2]

A vector outside span{x}\operatorname{span}\{x\} cannot lie on a segment from xx to 00, except at no point; the corresponding statement holds for yy, by the vector-space axioms (Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

[L3]

A finite concatenation of segments contained in a subset is a polygonal path in that subset (A finite concatenation of straight segments in Rn\mathbb{R}^n is a continuous path).

Proof

technique · constructive
1.1

Choose zRn(span{x}span{y})z\in\mathbb R^n\setminus(\operatorname{span}\{x\}\cup\operatorname{span}\{y\}). Such a vector exists: if the two spans differ, x+yx+y lies in neither; if they agree, [L1] gives a vector outside their common proper subspace.

L1choose
2.1

The segment from xx to zz avoids 00: an equality (1t)x+tz=0(1-t)x+tz=0 with 0<t10<t\le1 would give z=((1t)/t)xspan{x}z=-((1-t)/t)x\in\operatorname{span}\{x\}, contrary to step 1.1. The segment from zz to yy similarly avoids 00.

L2step 1.1
3.1

The two segments therefore form a polygonal path in Rn{0}\mathbb R^n\setminus\{0\} from xx to yy by [L3].

L3step 2.1
4.1

Since x,yx,y were arbitrary nonzero vectors, the punctured space is polygonally connected.

step 3.1discharge-construct
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-06 (claude-sonnet-5)Open item page →

Radial normalisation xx/x2x\mapsto x/\lVert x\rVert_2 is continuous on Rn{0}\mathbb{R}^n\setminus\{0\}

Statement

For n1n\ge1, the map ρ:Rn{0}Sn1\rho:\mathbb R^n\setminus\{0\}\to S^{n-1} defined by ρ(x)=x/x2\rho(x)=x/\lVert x\rVert_2 is continuous.

Facts & Assumptions

Given: n1n\ge1, the Euclidean norm, and a nonzero point aRna\in\mathbb R^n.

[L1]

The Euclidean norm is continuous and satisfies u2v2uv2|\lVert u\rVert_2-\lVert v\rVert_2|\le\lVert u-v\rVert_2 (The finite and reverse triangle inequalities for a norm; and for n1n \ge 1 every norm NN on Rn\mathbb{R}^n satisfies N(x)Cx1N(x) \le C\lVert x\rVert_1 and is Lipschitz, hence continuous, for d2d_2).

[L3]

The unit sphere is the set of vectors with Euclidean norm 11 (Euclidean spheres and closed balls as subspaces of Rn\mathbb{R}^n).

Proof

technique · direct
1.1

Put d:=a2>0d:=\lVert a\rVert_2>0. If xa2<d/2\lVert x-a\rVert_2<d/2, then [L1] gives x2>d/2\lVert x\rVert_2>d/2.

L1
1.2

For such xx, ρ(x)ρ(a)2xa2/x2+a21/x21/a24xa2/d\lVert\rho(x)-\rho(a)\rVert_2\le\lVert x-a\rVert_2/\lVert x\rVert_2+\lVert a\rVert_2|1/\lVert x\rVert_2-1/\lVert a\rVert_2|\le4\lVert x-a\rVert_2/d.

L1
2.1

Step 1.2 gives the epsilon-delta condition at aa, so ρ\rho is continuous on the punctured space. Also ρ(x)2=1\lVert\rho(x)\rVert_2=1, so its image lies in Sn1S^{n-1} and [L2] gives continuity with that codomain.

L2L3step 1.2
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-06 (claude-sonnet-5)Open item page →

For n1n\ge1, the map H(x,t)=((1t)+t/x2)xH(x,t)=((1-t)+t/\lVert x\rVert_2)x is continuous on (Rn{0})×[0,1](\mathbb{R}^n\setminus\{0\})\times[0,1], starts at xx, ends at radial normalisation, fixes the unit sphere, and never reaches 00

Statement

For n1n\ge1, put P=Rn{0}P=\mathbb R^n\setminus\{0\} and define

H:P×[0,1]P,H(x,t)=((1t)+t/x2)x.H:P\times[0,1]\to P,\qquad H(x,t)=\bigl((1-t)+t/\lVert x\rVert_2\bigr)x.

Then HH is continuous, H(x,0)=xH(x,0)=x, H(x,1)=x/x2H(x,1)=x/\lVert x\rVert_2, H(s,t)=sH(s,t)=s for sSn1s\in S^{n-1}, and H(x,t)0H(x,t)\ne0.

Facts & Assumptions

Given: xPx\in P and t[0,1]t\in[0,1].

[L4]

For maps on a subset of a metric space, sums, scalar multiples and pointwise products of continuous real-valued functions are continuous, and a vector-valued map is continuous exactly when its coordinate functions 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, clauses 1 and 3, the product being the case m=1m = 1 of the inner product); composites of continuous maps are continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous); and u1/uu \mapsto 1/u is continuous on R{0}\mathbb{R} \setminus \{0\}, this being clause 4 of (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function) with A=RA = \mathbb{R}, numerator 11 and denominator the identity.

Proof

technique · direct
1.1

The scalar c(x,t):=(1t)+t/x2c(x,t):=(1-t)+t/\lVert x\rVert_2 is positive, since 1t01-t\ge0, t0t\ge0, and x2>0\lVert x\rVert_2>0.

L3
1.2

The coordinate projections on P×[0,1]P\times[0,1] are continuous by [L2]. By [L3] the map xx2x\mapsto\lVert x\rVert_2 is continuous on PP and never 00 there, so composing it with u1/uu\mapsto 1/u gives a continuous x1/x2x\mapsto 1/\lVert x\rVert_2 by [L4]; hence c(x,t)=(1t)+t/x2c(x,t)=(1-t)+t/\lVert x\rVert_2 is continuous, being built from continuous functions by sums, scalar multiples and products as in [L4], and each coordinate Hi(x,t)=c(x,t)xiH_i(x,t)=c(x,t)x_i is continuous. Componentwise continuity in [L4] makes HH continuous as a map into Rn\mathbb R^n.

L1L2L3L4
1.3

Substituting t=0t=0 and t=1t=1 gives H(x,0)=xH(x,0)=x and H(x,1)=x/x2H(x,1)=x/\lVert x\rVert_2. If sSn1s\in S^{n-1}, then s2=1\lVert s\rVert_2=1 and H(s,t)=sH(s,t)=s.

L3
2.1

Since c(x,t)>0c(x,t)>0 and x0x\ne0, H(x,t)0H(x,t)\ne0. Hence HH takes values in PP, and [L5] makes it continuous as a map P×[0,1]PP\times[0,1]\to P.

step 1.1step 1.2L5
3.1

These identities and step 2.1 prove the statement.

step 2.1step 1.3
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

For n2n\ge2, the sphere Sn1S^{n-1} is path-connected and connected

Statement

For n2n\ge2, the unit sphere Sn1RnS^{n-1}\subseteq\mathbb R^n is path-connected and connected.

Facts & Assumptions

Proof

technique · constructive
1.1

Choose a path γ:[0,1]Rn{0}\gamma:[0,1]\to\mathbb R^n\setminus\{0\} from xx to yy as in [L1], and define η:=ργ\eta:=\rho\circ\gamma, where ρ(z)=z/z2\rho(z)=z/\lVert z\rVert_2.

L1L2construct
2.1

The map η\eta is continuous and takes values in Sn1S^{n-1} by [L2]. Since ρ(x)=x\rho(x)=x and ρ(y)=y\rho(y)=y, it joins xx to yy in the sphere.

L2step 1.1
3.1

Thus the sphere is path-connected, and it is connected by [L3].

L3step 2.1discharge-construct
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

R\mathbb{R} is not homeomorphic to Rn\mathbb{R}^n for any n2n\ge2

Statement

For every n2n\ge2, there is no homeomorphism RRn\mathbb R\to\mathbb R^n.

Facts & Assumptions

Proof

technique · contradiction
1.1

Suppose h:RRnh:\mathbb R\to\mathbb R^n is a homeomorphism, and put a:=h1(0)a:=h^{-1}(0).

assume-contraL4choose
1.2

Restricting h1h^{-1} to Rn{0}\mathbb R^n\setminus\{0\} gives a continuous surjection onto R{a}\mathbb R\setminus\{a\}. The source is connected by [L1], so the target is connected by [L2].

L1L2L4
1.3

Choose a1<a<a+1a-1<a<a+1. Both endpoints lie in R{a}\mathbb R\setminus\{a\}, but aa does not, so this subset is not order-convex and therefore not connected by [L3].

L3
2.1

Steps 1.2 and 1.3 contradict one another. Thus no such homeomorphism exists.

step 1.2step 1.3discharge-contradiction

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

FALSE: every connected subset of Rn\mathbb{R}^n is polygonally connected

Statement

False claim: every connected subset of Rn\mathbb R^n is polygonally connected.

The unit circle S1R2S^1\subseteq\mathbb R^2 is connected but is not polygonally connected.

Facts & Assumptions

Given: The unit circle S1={uR2:u2=1}S^1=\{u\in\mathbb R^2:\lVert u\rVert_2=1\} and the points e0,e0S1e_0,-e_0\in S^1.

[A1]

Every connected subset of Euclidean space is polygonally connected.

[L2]

A polygonal path is a finite concatenation of straight segments (Polygonal paths and polygonally connected subsets of Rn\mathbb{R}^n).

[L3]

If distinct unit vectors u,vu,v are joined by a segment, its midpoint has squared Euclidean norm (u+v)/222=1uv22/4<1\lVert(u+v)/2\rVert_2^2=1-\lVert u-v\rVert_2^2/4<1 (The Euclidean inner product x,y=k<nxkyk\langle x,y\rangle = \sum_{k<n} x_k y_k on Rn\mathbb{R}^n, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds. Since S1S^1 is connected by [L1], there is a polygonal path in S1S^1 from e0e_0 to e0-e_0.

A1L1assume-contra
2.1

In its finite vertex list some adjacent vertices u,vu,v are distinct, since its endpoints are distinct. The straight segment from uu to vv lies in S1S^1 by [L2].

L2step 1.1
3.1

But the midpoint of this segment has norm strictly less than 11 by [L3], so it does not lie in S1S^1. This contradicts step 2.1.

L3step 2.1discharge-contradiction

Sources