Alphabeta Math
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. 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ω and 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 agree, and for n=1 they agree with the real-line topology

For n≥1, the product topology on Rn is the metric topology of each of d1, d2, and d∞ (For n≥1 the product topology on n copies of the usual topology of R is the metric topology of d∞ on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space). Every norm on Rn is equivalent to the Euclidean norm, hence induces that same topology (For n≥1 all norms on Rn are equivalent). Thus open, closed, compact, connected, and continuous below have one unambiguous Euclidean meaning.

When n=1, the Euclidean metric is the usual metric dR(s,t)=∣s−t∣, and the metric and real-line formulations of continuity and compactness agree (Dictionary: for A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of R exactly when it is a compact metric subspace). This page works throughout with n≥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

Definition

Let n∈N with n≥1. Give Rn its Euclidean norm ∥⋅∥2 and its induced Euclidean metric d2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms). For c∈Rn and r>0, put

B‾2(c,r):={x∈Rn:∥x−c∥2≤r},S2(c,r):={x∈Rn:∥x−c∥2=r}.

These are respectively the Euclidean closed ball and Euclidean sphere with centre c and radius r. They carry the subspace topology inherited from Rn (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)=∥x−c∥2, they are precisely the closed ball and sphere Bˉ(c,r) and 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

Sn−1:=S2(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 X is pseudocompact when every continuous map f:X→R (Continuity of a map of topological spaces at a point and globally) has bounded image: there are reals ℓ,u with ℓ≤f(x)≤u for every x∈X (Lower bound, bounded below, bounded set).

A subset A of a topological space is pseudocompact when A, 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 is bounded

Statement

Let n≥1. Every pseudocompact subset A⊆Rn is bounded for the Euclidean metric.

Facts & Assumptions

Given: A pseudocompact subset A⊆Rn, where Rn has the Euclidean metric d2.

[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:A→R, N(x)=∥x∥2, is continuous, because the ambient norm is continuous by [L1] and A has the subspace topology.

L1
1.2

Pseudocompactness gives that N[A] is bounded. If A≠∅, choose an upper bound M of N[A]; then M≥0 because every norm is nonnegative.

L2L3choose
2.1

If A=∅ it is bounded. Otherwise every x∈A satisfies d2(x,0)=∥x∥2≤M<M+1, so A⊆Bd2(0,M+1).

step 1.2L3
3.1

Thus A 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 is closed

Statement

Let n≥1. Every pseudocompact subset A⊆Rn is closed in the Euclidean topology.

Facts & Assumptions

Given: A pseudocompact subset A⊆Rn, with Euclidean metric d2 and norm ∥⋅∥2.

[L1]

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

[L3]

The reverse triangle inequality gives ∣∥u∥2−∥v∥2∣≤∥u−v∥2, and the Euclidean norm is continuous (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2).

[L4]

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

Proof

technique · contradiction
1.1

Suppose, for contradiction, that A is not closed. By [L1], fix p∈A‾∖A.

assume-contraL1choose
2.1

Define f:A→R by f(x):=1/∥x−p∥2. This is defined because p∉A, so every denominator is positive.

step 1.1construct
2.2

For every real M>0, [L1] and [L2] give x∈A with ∥x−p∥2<1/M; then f(x)>M. Hence f[A] is unbounded.

step 1.1L1L2
3.1

The function f is continuous on A: at a∈A put d:=∥a−p∥2>0. If ∥x−a∥2<d/2, then [L3] gives ∥x−p∥2>d/2, and ∣f(x)−f(a)∣≤2d2∥x−a∥2. Thus a sufficiently small Euclidean ball about a maps into any prescribed real neighbourhood of f(a).

step 2.1L2L3
4.1

Steps 3.1 and 2.2 contradict pseudocompactness through [L4]. Therefore A 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 with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent

Statement

Let n≥1 and let A⊆Rn be nonempty. The following are equivalent.

  1. A is compact.
  2. A is closed and bounded.
  3. A is pseudocompact.
  4. Every continuous f:A→R attains a maximum and a minimum on A.

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 A⊆Rn with n≥1, carrying the Euclidean subspace topology.

[L2]

A pseudocompact Euclidean subset is bounded and is closed (A pseudocompact subset of Rn is bounded, A pseudocompact subset of Rn is closed).

[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:A→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:A→R, its maximum and minimum bound f[A], so A is pseudocompact and condition 3 holds.

L4
2.1

The implications 1⇔2, 3⇒2⇒1, and 1⇒4⇒3 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ω and 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 with n≥1

Statement

Assume ACω and DC. If n≥1 and A⊆Rn is nonempty, then the following conditions are equivalent: compactness; closedness and boundedness; pseudocompactness; attainment of a maximum and minimum by every continuous A→R; countable compactness; sequential compactness; limit point compactness; and completeness together with total boundedness.

Facts & Assumptions

[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 with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

[L2]

Under ACω and 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 n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact

Statement

For n≥1, c∈Rn, and r>0, the Euclidean closed ball B‾2(c,r) and Euclidean sphere S2(c,r) are compact.

Facts & Assumptions

Given: n≥1, c∈Rn, and r>0.

[L1]

The sets B‾2(c,r) and S2(c,r) are respectively the points satisfying ∥x−c∥2≤r and ∥x−c∥2=r (Euclidean spheres and closed balls as subspaces of Rn).

[L2]

The Euclidean norm is continuous and satisfies ∣∥u∥2−∥v∥2∣≤∥u−v∥2 (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2).

Proof

technique · direct
1.1

Both sets are bounded: B‾2(c,r) lies in the ball of radius r+1 about c, and S2(c,r)⊆B‾2(c,r).

L1L4
1.2

The complement of B‾2(c,r) is open: if ∥x−c∥2>r, then the ball about x of radius (∥x−c∥2−r)/2 stays in the complement by [L2].

L1L2L4
1.3

The complement of S2(c,r) is open: if ∥x−c∥2≠r, then a ball about x of radius ∣∥x−c∥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

Definition

Let A⊆Rn. A polygonal path in A from x to y is a path γ:[0,1]→A (Paths, path-connected spaces and path components, Intervals of R: the nine order-convex forms, nondegeneracy, and length) for which there are a finite list of vertices v0,…,vm∈A and a partition 0=t0<t1<⋯<tm=1 such that v0=x, vm=y, and

γ(t)=ti−tti−ti−1vi−1+t−ti−1ti−ti−1viwhen ti−1≤t≤ti.

The formula uses only scalar multiplication and vector addition in Rn (Vector space over a field). The finite list is indexed by a natural number (The cardinality ∣A∣ of a finite set).

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

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 is a continuous path

Statement

Let v0,…,vm∈Rn and 0=t0<⋯<tm=1. The affine pieces joining vi−1 to vi define a continuous map [0,1]→Rn. If every piece lies in a subset A, the map is a polygonal path (Polygonal paths and polygonally connected subsets of Rn) in A from v0 to vm.

Facts & Assumptions

Given: Vertices v0,…,vm∈Rn and a partition 0=t0<⋯<tm=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 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 [ti−1,ti] define γi(t):=((ti−t)/(ti−ti−1))vi−1+((t−ti−1)/(ti−ti−1))vi. Each coordinate is an affine real function of t, hence continuous.

L3construct
2.1

At every shared endpoint ti, the adjacent formulas both give vi, so the pieces define one function γ:[0,1]→Rn.

step 1.1construct
3.1

Each interval [ti−1,ti] is closed in [0,1], the finitely many intervals cover it, and each restriction of γ is continuous by step 1.1. Thus γ is continuous by [L1].

L1step 1.1step 2.1
4.1

If the pieces lie in A, then γ takes values in A. Its composite with the inclusion A↪Rn is the continuous map of step 3.1, so [L2] makes it continuous into the subspace A. Its endpoints are v0,vm, hence it is a path in A.

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

Statement

Let U⊆Rn be open and let a∈U. The set Ra of points of U joined to a by a polygonal path (Polygonal paths and polygonally connected subsets of Rn) in U is both open and closed in the subspace U.

Facts & Assumptions

Given: An open subset U⊆Rn, a point a∈U, and the polygonally reachable set Ra⊆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 as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[L3]

A finite concatenation of such segments is a continuous polygonal path (A finite concatenation of straight segments in Rn is a continuous path).

Proof

technique · direct
1.1

Let y∈Ra. Choose r>0 with B(y,r)⊆U. For every z∈B(y,r), the segment from y to z lies in B(y,r) by [L2].

L1L2choose
1.2

Let y∈U∖Ra and choose r>0 with B(y,r)⊆U. If some z∈B(y,r) lay in Ra, a path from a to z followed by the segment from z to y would put y in Ra, a contradiction.

L1L2L3choose
2.1

Concatenating a polygonal path from a to y with that segment gives a polygonal path from a to z in U. Thus B(y,r)⊆Ra, so Ra is open in U.

L3step 1.1
3.1

Hence B(y,r)⊆U∖Ra, so the complement is open in U. Therefore Ra is clopen in U.

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, connectedness, path-connectedness and polygonal connectedness are equivalent

Statement

Let U⊆Rn be open. Then U is connected if and only if it is path-connected, if and only if it is polygonally connected.

Facts & Assumptions

Given: An open subset U⊆Rn.

[L1]

The polygonally reachable set from a point of U is clopen in U (The points polygonally reachable from a fixed point form a clopen subset of every open subset of Rn).

Proof

technique · direct
1.1

Suppose U is connected. If U=∅, then polygonal connectedness, path-connectedness, and connectedness all hold vacuously. Otherwise choose a∈U. The reachable set Ra is nonempty and clopen by [L1], so [L3] gives Ra=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=Ra is joined to a by a polygonal path; reversing one such path and concatenating it with another joins any two points of U. 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 is open and polygonally connected

Statement

Every connected component of an open subset U⊆Rn is open in Rn and polygonally connected.

Facts & Assumptions

Given: An open subset U⊆Rn and a connected component C of U.

[L1]

A Euclidean ball is path-connected, hence connected: the norm triangle inequality keeps every straight segment in the ball, the segment is continuous, and every path-connected space is connected (Open ball, closed ball and sphere in a metric space, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, A finite concatenation of straight segments in Rn is a continuous path, Every path-connected space is connected, and every path component lies inside a component).

[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 x∈C. Since U is open, choose r>0 with B(x,r)⊆U. The ball is connected by [L1], meets C at x, and so lies in C by maximality of the component.

L1L2choose
2.1

Therefore every point of C has a Euclidean ball contained in C, so C is open in Rn.

step 1.1
3.1

The component C 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 is polygonally connected, connected, locally path-connected and locally connected

Statement

For n≥1, Rn is polygonally connected and connected, and it is locally path-connected and locally connected.

Facts & Assumptions

Given: Rn with n≥1 and its Euclidean topology.

[L1]
[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,y∈Rn, the one-segment path t↦(1−t)x+ty joins them. Hence Rn is polygonally connected.

L1
1.2

Let x∈Rn and let U be open with x∈U. Choose r>0 with B(x,r)⊆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 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 is locally compact and σ-compact

Statement

For n≥1, Euclidean space Rn is locally compact and σ-compact.

Facts & Assumptions

Given: Rn with n≥1, its origin 0, and its Euclidean norm.

[L3]

For every real M there is a natural k≥1 with M<k⋅1R (Every complete ordered field is Archimedean).

Proof

technique · constructive
1.1

For x∈Rn, the closed ball B‾2(x,1) is compact by [L1] and contains the open ball B2(x,1) about x. Thus x has a compact neighbourhood.

L1L2
1.2

For each k∈N put Kk:=B‾2(0,k+1). Every Kk is compact by [L1].

L1construct
2.1

If x∈Rn, [L3] gives k≥1 with ∥x∥2<k, so x∈Kk. Hence Rn=⋃k∈NKk.

L3step 1.2choose
3.1

Step 1.1 gives local compactness and step 2.1 gives σ-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 C is at most countable and m∈N, then the finite product Cm=∏i<mC is at most countable.

Facts & Assumptions

Proof

technique · induction
1.1

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

baseL2L3
1.2

Assume Cm is at most countable.

ih
2.1

The product Cm+1 is canonically Cm×C, so it is at most countable by [L1].

step 1.2L1
3.1

By induction, Cm is at most countable for every m∈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 is a countable dense subset of Rn, and rational open boxes form a countable basis

Statement

Let n≥1. The set Qn is countable and dense in Rn. Moreover the rational open boxes

∏i<n(ai,bi),ai,bi∈Q,ai<bi,

form a countable basis for the product topology on Rn.

Facts & Assumptions

Given: n≥1, the product Rn=∏i<nR, and the rationals embedded in R.

[L1]

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

[L2]

Every nonempty open subset of R contains a rational point (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[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 is at most countable. It is infinite because the injection q↦(q,0,…,0) embeds Q in it, hence it is countable.

L1
1.2

Let U=∏i<nUi be a nonempty basic product-open set. Every Ui is nonempty and open, so [L2] gives a rational qi∈Ui; finite choice supplies the tuple q=(qi)i<n∈Qn∩U.

L2L5choose
1.3

Let x∈U=∏i<nUi be a basic product-open neighbourhood. For each i<n, use [L6] to choose ri>0 with (xi−ri,xi+ri)⊆Ui, then use [L2] to choose rationals xi−ri<ai<xi<bi<xi+ri. Finite choice assembles these choices, and then x∈∏i<n(ai,bi)⊆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. Thus Qn 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, 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 n≥2, the punctured space Rn∖{0} is polygonally connected

Statement

For n≥2, Rn∖{0} is polygonally connected.

Facts & Assumptions

Given: n≥2 and nonzero vectors x,y∈Rn.

[L2]

A vector outside span⁡{x} cannot lie on a segment from x to 0, except at no point; the corresponding statement holds for y, by the vector-space axioms (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, 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 is a continuous path).

Proof

technique · constructive
1.1

Choose z∈Rn∖(span⁡{x}∪span⁡{y}). Such a vector exists: if the two spans differ, x+y lies in neither; if they agree, [L1] gives a vector outside their common proper subspace.

L1choose
2.1

The segment from x to z avoids 0: an equality (1−t)x+tz=0 with 0<t≤1 would give z=−((1−t)/t)x∈span⁡{x}, contrary to step 1.1. The segment from z to y similarly avoids 0.

L2step 1.1
3.1

The two segments therefore form a polygonal path in Rn∖{0} from x to y by [L3].

L3step 2.1
4.1

Since x,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 x↦x/∥x∥2 is continuous on Rn∖{0}

Statement

For n≥1, the map ρ:Rn∖{0}→Sn−1 defined by ρ(x)=x/∥x∥2 is continuous.

Facts & Assumptions

Given: n≥1, the Euclidean norm, and a nonzero point a∈Rn.

[L1]

The Euclidean norm is continuous and satisfies ∣∥u∥2−∥v∥2∣≤∥u−v∥2 (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2).

[L3]

The unit sphere is the set of vectors with Euclidean norm 1 (Euclidean spheres and closed balls as subspaces of Rn).

Proof

technique · direct
1.1

Put d:=∥a∥2>0. If ∥x−a∥2<d/2, then [L1] gives ∥x∥2>d/2.

L1
1.2

For such x, ∥ρ(x)−ρ(a)∥2≤∥x−a∥2/∥x∥2+∥a∥2∣1/∥x∥2−1/∥a∥2∣≤4∥x−a∥2/d.

L1
2.1

Step 1.2 gives the epsilon-delta condition at a, so ρ is continuous on the punctured space. Also ∥ρ(x)∥2=1, so its image lies in Sn−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 n≥1, the map H(x,t)=((1−t)+t/∥x∥2)x is continuous on (Rn∖{0})×[0,1], starts at x, ends at radial normalisation, fixes the unit sphere, and never reaches 0

Statement

For n≥1, put P=Rn∖{0} and define

H:P×[0,1]→P,H(x,t)=((1−t)+t/∥x∥2)x.

Then H is continuous, H(x,0)=x, H(x,1)=x/∥x∥2, H(s,t)=s for s∈Sn−1, and H(x,t)≠0.

Facts & Assumptions

Given: x∈P and t∈[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=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 u↦1/u is continuous on R∖{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=R, numerator 1 and denominator the identity.

Proof

technique · direct
1.1

The scalar c(x,t):=(1−t)+t/∥x∥2 is positive, since 1−t≥0, t≥0, and ∥x∥2>0.

L3
1.2

The coordinate projections on P×[0,1] are continuous by [L2]. By [L3] the map x↦∥x∥2 is continuous on P and never 0 there, so composing it with u↦1/u gives a continuous x↦1/∥x∥2 by [L4]; hence c(x,t)=(1−t)+t/∥x∥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)xi is continuous. Componentwise continuity in [L4] makes H continuous as a map into Rn.

L1L2L3L4
1.3

Substituting t=0 and t=1 gives H(x,0)=x and H(x,1)=x/∥x∥2. If s∈Sn−1, then ∥s∥2=1 and H(s,t)=s.

L3
2.1

Since c(x,t)>0 and x≠0, H(x,t)≠0. Hence H takes values in P, and [L5] makes it continuous as a map P×[0,1]→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 n≥2, the sphere Sn−1 is path-connected and connected

Statement

For n≥2, the unit sphere Sn−1⊆Rn is path-connected and connected.

Facts & Assumptions

Given: n≥2 and points x,y∈Sn−1.

[L1]

The punctured space is polygonally connected, hence there is a continuous path in it from x to y (For n≥2, the punctured space Rn∖{0} is polygonally connected, A finite concatenation of straight segments in Rn is a continuous path).

[L2]

Proof

technique · constructive
1.1

Choose a path γ:[0,1]→Rn∖{0} from x to y as in [L1], and define η:=ρ∘γ, where ρ(z)=z/∥z∥2.

L1L2construct
2.1

The map η is continuous and takes values in Sn−1 by [L2]. Since ρ(x)=x and ρ(y)=y, it joins x to y 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 is not homeomorphic to Rn for any n≥2

Statement

For every n≥2, there is no homeomorphism R→Rn.

Facts & Assumptions

Proof

technique · contradiction
1.1

Suppose h:R→Rn is a homeomorphism, and put a:=h−1(0).

assume-contraL4choose
1.2

Restricting h−1 to Rn∖{0} gives a continuous surjection onto R∖{a}. The source is connected by [L1], so the target is connected by [L2].

L1L2L4
1.3

Choose a−1<a<a+1. Both endpoints lie in R∖{a}, but a 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 is polygonally connected

Statement

False claim: every connected subset of Rn is polygonally connected.

The unit circle S1⊆R2 is connected but is not polygonally connected.

Facts & Assumptions

Given: The unit circle S1={u∈R2:∥u∥2=1} and the points e0,−e0∈S1.

[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).

[L3]

If distinct unit vectors u,v are joined by a segment, its midpoint has squared Euclidean norm ∥(u+v)/2∥22=1−∥u−v∥22/4<1 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, 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 S1 is connected by [L1], there is a polygonal path in S1 from e0 to −e0.

A1L1assume-contra
2.1

In its finite vertex list some adjacent vertices u,v are distinct, since its endpoints are distinct. The straight segment from u to v lies in S1 by [L2].

L2step 1.1
3.1

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

L3step 2.1discharge-contradiction∎

Sources