Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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 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

Statement

Let n∈N with n≥1, and give R its usual topology, the metric topology of dR(s,t)=∣s−t∣ (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (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

be the product of n copies of R (The product set ∏i∈IXi 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 of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, both being the set of functions n→R; and d1, d2, d∞ are the three metrics defined there. Then:

  1. The product topology on Rn is the metric topology of d∞ (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 d∞-ball is a box: Bd∞(x,r)  =  ∏k<n(xk−r, xk+r)(r>0), a product of bounded open intervals (Intervals of R: the nine order-convex forms, nondegeneracy, and length).
  2. d∞≤d1≤n d∞ and d∞≤d2≤n d∞ pointwise, so d1 and d2 are each Lipschitz equivalent to d∞ (Topologically, uniformly and Lipschitz equivalent metrics on a set); here n denotes the canonical natural n⋅1R.
  3. Consequently all three metrics induce the product topology (Lipschitz equivalence implies uniform equivalence implies topological equivalence). So Rn carrying the product topology and Rn carrying the topology of any one of d1, d2, d∞ 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 n≥1. The metric d∞ is a maximum over n terms, which does not exist for n=0; Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it carries the same hypothesis, and it is carried here for the same reason. For n=0 the product is a one-point space and there is nothing to compare.

Facts & Assumptions

Given: A natural n≥1; the set Rn of functions n→R; the three metrics d1(x,y)=∑k<n∣xk−yk∣, d2(x,y)=∑k<n(xk−yk)2 and d∞(x,y)=max⁡{∣xk−yk∣:k<n}; points x,y∈Rn and a real r>0. Throughout, n inside a real inequality denotes the canonical natural n⋅1R.

[A1]

d1, d2 and d∞ are metrics on Rn for n≥1, and Rn is the set of functions n→R (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[L3]

max⁡S belongs to S and is an upper bound for S, and likewise 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 ak≤bk for all k<n then ∑k<nak≤∑k<nbk; if every ak≥0 then every single term satisfies aj≤∑k<nak; and ∑k<nλ=nλ (Laws of finite sums and finite products, claims 2 and 4).

[L5]

a is the unique nonnegative real with (a)2=a, for a≥0 (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}); t2≥0 (Squares of nonzero elements are positive); ∣t∣2=t2 and ∣t∣≥0 (Basic properties of the absolute value); and for a,b≥0 one has a≤b if and only if a2≤b2 (Squaring is monotone on the nonnegatives).

[L6]

A function on a natural number n 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 n⋅1R is positive and n↦n⋅1R is strictly increasing for n≥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 y∈Rn: d∞(x,y)<r if and only if ∣xk−yk∣<r for every k<n, since by [L3] the maximum is one of the values ∣xk−yk∣ and is an upper bound for all of them.

A1L3
1.2

For t∈R and r>0: ∣t−yk∣<r if and only if yk∈(t−r,t+r), by [L1].

L1
1.3

Write tk:=∣xk−yk∣ and M:=d∞(x,y)=max⁡{tk:k<n}. Then tj≤M for every j<n and M=tj0 for some j0<n, by [L3].

A1L3
1.4

d2(x,y)2=∑k<n(xk−yk)2 by [L5], and (xk−yk)2=tk2≥0 by [L5].

L5
1.5

n≤n2 as reals: for n≥1 the canonical natural satisfies ι(1)=1≤ι(n) by [L7], so either ι(n)=1, in which case ι(n)=ι(n)2=1, or 1<ι(n), in which case multiplying that strict inequality by ι(n)>0 gives ι(n)<ι(n)2 by [L7].

L7
1.6

Conversely let B=∏k<nUk be a box with every Uk open in R and let x∈B. For each k<n the set { ρ∈R:ρ>0, (xk−ρ, xk+ρ)⊆Uk } is nonempty by [L1], so [L6] supplies ρk in it for every k<n; put r:=min⁡{ρk:k<n}, which exists and is positive by [L3].

A2L1L3L6choose
2.1

d1(x,y)=∑k<ntk≤∑k<nM=nM, using tk≤M from step 1.3 and [L4].

step 1.3L4
2.2

M=tj0≤∑k<ntk=d1(x,y), since every tk≥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(xk−r, xk+r): by step 1.1 a point y lies in the ball exactly when ∣xk−yk∣<r for every k<n, and by step 1.2 that says exactly yk∈(xk−r,xk+r) for every k<n.

step 1.1step 1.2
2.4

M2=tj02≤∑k<ntk2=d2(x,y)2 by steps 1.3 and 1.4 with [L4], and both M and d2(x,y) are nonnegative by [L2] and [L5], so M≤d2(x,y) by [L5].

step 1.3step 1.4L2L4L5
2.5

d2(x,y)2=∑k<ntk2≤∑k<nM2=nM2≤n2M2=(nM)2, using tk≤M with [L5] and [L4], then step 1.5 with M2≥0; since d2(x,y)≥0 and nM≥0, [L5] gives d2(x,y)≤nM.

step 1.3step 1.4step 1.5L4L5
3.1

Every d∞-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 d∞-open set is product-open, by [L2] and [A2].

step 2.3A2L1L2
3.2

With r as in step 1.6: Bd∞(x,r)=∏k<n(xk−r,xk+r)⊆∏k<n(xk−ρk,xk+ρk)⊆B, since r≤ρk for every k by [L3].

step 2.3step 1.6L3
3.3

Steps 2.1, 2.2, 2.4 and 2.5 give d∞≤d1≤n d∞ and d∞≤d2≤n d∞ at every pair of points, which is claim 2, the constants 1 and n 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 d∞-open by [L2], hence every product-open set is d∞-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 d1, d2 and d∞ have the same metric topology, which by step 4.1 is the product topology; so all three induce it and Rn 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" could denote the product of two copies of the real line or the metric space of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, and "open in R2" would have had two readings. Claim 3 says they are one space, so every statement about open sets, closures, convergence and continuity in Rn proved on either side transfers verbatim to the other.

  • The d∞-ball is the natural object here and the d2-ball is not. The proof works with d∞ because its balls are the basic boxes; for d2 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 n 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 · two levels

68 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