Alphabeta Math
LemmaStatement: 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.

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

Statement

Let nNn \in \mathbb{N} with n1n \ge 1, and give R\mathbb{R} its usual topology, the metric topology of dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Let

Rn  =  k<nR\mathbb{R}^n \;=\; \prod_{k < n} \mathbb{R}

be the product of nn copies of R\mathbb{R} (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). As a set this is literally the Rn\mathbb{R}^n of Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, both being the set of functions nRn \to \mathbb{R}; and d1d_1, d2d_2, dd_\infty are the three metrics defined there. Then:

  1. The product topology on Rn\mathbb{R}^n is the metric topology of dd_\infty (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). The key computation is that a dd_\infty-ball is a box: Bd(x,r)  =  k<n(xkr, xk+r)(r>0),B_{d_\infty}(x, r) \;=\; \prod_{k<n} (x_k - r,\ x_k + r) \qquad (r > 0), a product of bounded open intervals (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).
  2. dd1ndd_\infty \le d_1 \le n\, d_\infty and dd2ndd_\infty \le d_2 \le n\, d_\infty pointwise, so d1d_1 and d2d_2 are each Lipschitz equivalent to dd_\infty (Topologically, uniformly and Lipschitz equivalent metrics on a set); here nn denotes the canonical natural n1Rn \cdot 1_{\mathbb{R}}.
  3. Consequently all three metrics induce the product topology (Lipschitz equivalence implies uniform equivalence implies topological equivalence). So Rn\mathbb{R}^n carrying the product topology and Rn\mathbb{R}^n carrying the topology of any one of d1d_1, d2d_2, dd_\infty are one topological space, and it is metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

Why n1n \ge 1. The metric dd_\infty is a maximum over nn terms, which does not exist for n=0n = 0; Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it carries the same hypothesis, and it is carried here for the same reason. For n=0n = 0 the product is a one-point space and there is nothing to compare.

Facts & Assumptions

Given: A natural n1n \ge 1; the set Rn\mathbb{R}^n of functions nRn \to \mathbb{R}; the three metrics d1(x,y)=k<nxkykd_1(x,y) = \sum_{k<n}|x_k - y_k|, d2(x,y)=k<n(xkyk)2d_2(x,y) = \sqrt{\sum_{k<n}(x_k-y_k)^2} and d(x,y)=max{xkyk:k<n}d_\infty(x,y) = \max\{|x_k-y_k| : k < n\}; points x,yRnx, y \in \mathbb{R}^n and a real r>0r > 0. Throughout, nn inside a real inequality denotes the canonical natural n1Rn \cdot 1_{\mathbb{R}}.

[A1]

d1d_1, d2d_2 and dd_\infty are metrics on Rn\mathbb{R}^n for n1n \ge 1, and Rn\mathbb{R}^n is the set of functions nRn \to \mathbb{R} (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it).

[A2]

For I=nI = n a natural number, a basis for the product topology on k<nR\prod_{k<n}\mathbb{R} is the family of all boxes k<nUk\prod_{k<n} U_k with every UkU_k open in R\mathbb{R} (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L2]

UU is open in a metric space (X,d)(X,d) exactly when every uUu \in U has some ρ>0\rho > 0 with Bd(u,ρ)UB_d(u,\rho) \subseteq U (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, Open ball, closed ball and sphere in a metric space); metric values are nonnegative (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).

[L3]

maxS\max S belongs to SS and is an upper bound for SS, and likewise minS\min S (Maximum and minimum of a set); a nonempty finite set of reals has a maximum, and by reflection a minimum (Every nonempty finite set of reals has a maximum and a minimum).

[L4]

For finite sums: if akbka_k \le b_k for all k<nk<n then k<nakk<nbk\sum_{k<n} a_k \le \sum_{k<n} b_k; if every ak0a_k \ge 0 then every single term satisfies ajk<naka_j \le \sum_{k<n} a_k; and k<nλ=nλ\sum_{k<n}\lambda = n\lambda (Laws of finite sums and finite products, claims 2 and 4).

[L5]

a\sqrt{a} is the unique nonnegative real with (a)2=a(\sqrt a)^2 = a, for a0a \ge 0 (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}); t20t^2 \ge 0 (Squares of nonzero elements are positive); t2=t2|t|^2 = t^2 and t0|t| \ge 0 (Basic properties of the absolute value); and for a,b0a, b \ge 0 one has aba \le b if and only if a2b2a^2 \le b^2 (Squaring is monotone on the nonnegatives).

[L6]

A function on a natural number nn whose values are nonempty sets has a choice function for its family of values (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[L7]

The canonical natural n1Rn \cdot 1_{\mathbb{R}} is positive and nn1Rn \mapsto n \cdot 1_{\mathbb{R}} is strictly increasing for n1n \ge 1 (Canonical naturals are positive and strictly increasing); multiplying an inequality by a positive element preserves it (Sign rules for products and monotonicity of multiplication, claim 4).

[L8]

Lipschitz equivalent metrics are topologically equivalent, that is they have the same metric topology (Lipschitz equivalence implies uniform equivalence implies topological equivalence, claims 1 and 2; Topologically, uniformly and Lipschitz equivalent metrics on a set).

Proof

technique · direct
1.1

For yRny \in \mathbb{R}^n: d(x,y)<rd_\infty(x,y) < r if and only if xkyk<r|x_k - y_k| < r for every k<nk < n, since by [L3] the maximum is one of the values xkyk|x_k-y_k| and is an upper bound for all of them.

A1L3
1.2

For tRt \in \mathbb{R} and r>0r > 0: tyk<r|t - y_k| < r if and only if yk(tr,t+r)y_k \in (t-r, t+r), by [L1].

L1
1.3

Write tk:=xkykt_k := |x_k - y_k| and M:=d(x,y)=max{tk:k<n}M := d_\infty(x,y) = \max\{t_k : k<n\}. Then tjMt_j \le M for every j<nj < n and M=tj0M = t_{j_0} for some j0<nj_0 < n, by [L3].

A1L3
1.4

d2(x,y)2=k<n(xkyk)2d_2(x,y)^2 = \sum_{k<n}(x_k-y_k)^2 by [L5], and (xkyk)2=tk20(x_k-y_k)^2 = t_k^2 \ge 0 by [L5].

L5
1.5

nn2n \le n^2 as reals: for n1n \ge 1 the canonical natural satisfies ι(1)=1ι(n)\iota(1) = 1 \le \iota(n) by [L7], so either ι(n)=1\iota(n) = 1, in which case ι(n)=ι(n)2=1\iota(n) = \iota(n)^2 = 1, or 1<ι(n)1 < \iota(n), in which case multiplying that strict inequality by ι(n)>0\iota(n) > 0 gives ι(n)<ι(n)2\iota(n) < \iota(n)^2 by [L7].

L7
1.6

Conversely let B=k<nUkB = \prod_{k<n} U_k be a box with every UkU_k open in R\mathbb{R} and let xBx \in B. For each k<nk<n the set {ρR:ρ>0, (xkρ, xk+ρ)Uk}\{\, \rho \in \mathbb{R} : \rho > 0,\ (x_k-\rho,\ x_k+\rho) \subseteq U_k \,\} is nonempty by [L1], so [L6] supplies ρk\rho_k in it for every k<nk<n; put r:=min{ρk:k<n}r := \min\{\rho_k : k<n\}, which exists and is positive by [L3].

A2L1L3L6choose
2.1

d1(x,y)=k<ntkk<nM=nMd_1(x,y) = \sum_{k<n} t_k \le \sum_{k<n} M = n M, using tkMt_k \le M from step 1.3 and [L4].

step 1.3L4
2.2

M=tj0k<ntk=d1(x,y)M = t_{j_0} \le \sum_{k<n} t_k = d_1(x,y), since every tk0t_k \ge 0 by [L5] and a single nonnegative term is at most the sum, by [L4].

step 1.3L4L5
2.3

Bd(x,r)=k<n(xkr, xk+r)B_{d_\infty}(x,r) = \prod_{k<n}(x_k - r,\ x_k + r): by step 1.1 a point yy lies in the ball exactly when xkyk<r|x_k-y_k| < r for every k<nk<n, and by step 1.2 that says exactly yk(xkr,xk+r)y_k \in (x_k-r, x_k+r) for every k<nk < n.

step 1.1step 1.2
2.4

M2=tj02k<ntk2=d2(x,y)2M^2 = t_{j_0}^2 \le \sum_{k<n} t_k^2 = d_2(x,y)^2 by steps 1.3 and 1.4 with [L4], and both MM and d2(x,y)d_2(x,y) are nonnegative by [L2] and [L5], so Md2(x,y)M \le d_2(x,y) by [L5].

step 1.3step 1.4L2L4L5
2.5

d2(x,y)2=k<ntk2k<nM2=nM2n2M2=(nM)2d_2(x,y)^2 = \sum_{k<n} t_k^2 \le \sum_{k<n} M^2 = n M^2 \le n^2 M^2 = (nM)^2, using tkMt_k \le M with [L5] and [L4], then step 1.5 with M20M^2 \ge 0; since d2(x,y)0d_2(x,y) \ge 0 and nM0nM \ge 0, [L5] gives d2(x,y)nMd_2(x,y) \le n M.

step 1.3step 1.4step 1.5L4L5
3.1

Every dd_\infty-ball is a box with open factors, by step 2.3 and [L1], hence a basic open set of the product topology by [A2]; so every dd_\infty-open set is product-open, by [L2] and [A2].

step 2.3A2L1L2
3.2

With rr as in step 1.6: Bd(x,r)=k<n(xkr,xk+r)k<n(xkρk,xk+ρk)BB_{d_\infty}(x,r) = \prod_{k<n}(x_k-r, x_k+r) \subseteq \prod_{k<n}(x_k-\rho_k, x_k+\rho_k) \subseteq B, since rρkr \le \rho_k for every kk by [L3].

step 2.3step 1.6L3
3.3

Steps 2.1, 2.2, 2.4 and 2.5 give dd1ndd_\infty \le d_1 \le n\,d_\infty and dd2ndd_\infty \le d_2 \le n\,d_\infty at every pair of points, which is claim 2, the constants 11 and nn being positive by [L7].

step 2.1step 2.2step 2.4step 2.5L7
4.1

By steps 1.6 and 3.2 every basic open set of the product topology is dd_\infty-open by [L2], hence every product-open set is dd_\infty-open; with step 3.1 this gives claim 1.

step 3.1step 1.6step 3.2A2L2
5.1

By step 3.3 and [L8] the metrics d1d_1, d2d_2 and dd_\infty have the same metric topology, which by step 4.1 is the product topology; so all three induce it and Rn\mathbb{R}^n with the product topology is metrizable. This is claim 3, and with steps 4.1 and 3.3 all three claims are proved.

step 3.3step 4.1L8

Remarks

  • This item exists to stop one symbol meaning two things. Before it, "R2\mathbb{R}^2" could denote the product of two copies of the real line or the metric space of Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, and "open in R2\mathbb{R}^2" would have had two readings. Claim 3 says they are one space, so every statement about open sets, closures, convergence and continuity in Rn\mathbb{R}^n proved on either side transfers verbatim to the other.

  • The dd_\infty-ball is the natural object here and the d2d_2-ball is not. The proof works with dd_\infty because its balls are the basic boxes; for d2d_2 the corresponding computation would need a round ball inscribed in a box and a box inscribed in a round ball, which is the content of the inequalities of claim 2 read geometrically.

  • Choice is spent only on finitely many radii. Step 1.6 selects one radius per coordinate, and there are nn of them, so Every natural-number-indexed list of nonempty sets has a choice function on its family of values suffices and no form of the Axiom of Choice is used anywhere in this item; step 3.2 only uses the radius already built there.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 120 results over 22 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