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.

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

Subspaces, Products, and Quotients

1 · Prerequisites

2 · Summary

Subspaces, products, disjoint unions and quotients are organised through initial and final topologies. Their characteristic properties turn continuity into componentwise tests for maps into products and restriction tests for maps out of coproducts and quotients. The page also records how closure and interior behave in subspaces, distinguishes hereditary from open- and closed-hereditary properties, and identifies the product topology on finite powers of R with the usual metric topology.

The product--box comparison separates the finite ZF case from the infinite choice-dependent strictness result, and the product-closure title exposes the choice used for infinite nonempty families. Quotient maps are developed through their universal property, practical sufficient criteria, canonical factorisation and standard gluing constructions. The Hausdorff condition is introduced to track a separation property that quotients can destroy, and counterexamples show that projections need not be closed and quotient maps need not be open, closed or Hausdorff-preserving.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

For A⊆S⊆X the closure of A in S is A‾X∩S, while the interior only contains int⁡X(A)∩S, with equality when S is open; and a dense subset of X traces to a dense subset of every open S

Statement

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let S⊆X carry the subspace topology TS (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) and let A⊆S. Write A‾ and int⁡(A) for the closure and the interior of A in X, and cl⁡S(A) and int⁡S(A) for those taken in the space (S,TS) (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). Then:

  1. Closure traces exactly. cl⁡S(A)  =  A‾∩S.
  2. Interior traces only one way. int⁡(A)⊆S, so int⁡(A)∩S=int⁡(A), and int⁡(A)  ⊆  int⁡S(A), an inclusion that may be strict.
  3. Equality for an open subspace. If S∈T then int⁡S(A)=int⁡(A).
  4. Density traces to open subspaces only. If D⊆X is dense in X (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and S∈T, then D∩S is dense in (S,TS). Without the hypothesis S∈T this fails.

Both failures are witnessed inside the proof, in Sierpinski space (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies): the unqualified forms of claims 2 and 3 and of claim 4 are false, and the counterexamples are two lines each rather than deferred.

Facts & Assumptions

Given: A topological space (X,T), a subset S⊆X with its subspace topology TS={ U∩S:U∈T }, and a subset A⊆S. Also Sierpinski space E={a,b} with a≠b and TE={∅,{b},E}.

[A1]

TS is a topology on S, and C⊆S is closed in S if and only if C=F∩S for some closed F⊆X (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).

[L1]

int⁡(A) is the largest open subset of A and A‾ is the smallest closed superset of A; both are taken in whichever space is named (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L2]

D is dense in a space exactly when D meets every nonempty open subset of that space (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Proof

technique · direct
1.1

A‾∩S is closed in S by [A1], since A‾ is closed in X, and it contains A, since A⊆A‾ and A⊆S.

A1L1
1.2

cl⁡S(A)=F∩S for some closed F⊆X, by [A1] applied to the set cl⁡S(A), which is closed in S; and A⊆cl⁡S(A)=F∩S⊆F.

A1L1
1.3

int⁡(A) is open in X and satisfies int⁡(A)⊆A⊆S, so int⁡(A)=int⁡(A)∩S is a trace of an open set of X and hence lies in TS.

givenL1
1.4

In E, put S0:={a}, A0:={a} and D0:={b}. Then int⁡S0(A0)=S0={a}, since S0 is open in S0 and S0⊆A0; and the interior of A0 in E is ∅, since by [L3] the only open subset of {a} in E is ∅. So the inclusion of claim 2 is strict for this pair.

L1L3
1.5

Assume S∈T. Then int⁡S(A), being open in S, is open in X by [A2], and it is contained in A; so int⁡S(A)⊆int⁡(A) by [L1].

A2L1
1.6

Assume S∈T and that D is dense in X, and let W be a nonempty open subset of S. By [A2] the set W is open in X, so W∩D≠∅ by [L2]; and W⊆S gives W∩D=W∩(D∩S).

A2L2
2.1

In E with the sets of step 1.4: the closure of D0 in E is E, since by [L3] the only closed superset of {b} is E, so D0 is dense in E; and D0∩S0=∅, which is not dense in the nonempty space S0, because S0 is a nonempty open subset of S0 that ∅ does not meet.

L1L2L3
2.2

cl⁡S(A)⊆A‾∩S: by step 1.1 the set A‾∩S is a closed subset of S containing A, and cl⁡S(A) is the smallest such.

step 1.1L1
2.3

A‾∩S⊆cl⁡S(A): with F as in step 1.2 one has A⊆F with F closed in X, so A‾⊆F by [L1], whence A‾∩S⊆F∩S=cl⁡S(A).

step 1.2L1
2.4

int⁡(A)⊆int⁡S(A): by step 1.3 the set int⁡(A) is open in S and contained in A, and int⁡S(A) is the largest such.

step 1.3L1
3.1

Steps 2.2 and 2.3 give cl⁡S(A)=A‾∩S, which is claim 1.

step 2.2step 2.3
3.2

Step 1.3 gives int⁡(A)∩S=int⁡(A), step 2.4 gives the inclusion, and step 1.4 exhibits a case where the inclusion is strict; this is claim 2.

step 1.3step 2.4step 1.4
3.3

Steps 2.4 and 1.5 give int⁡S(A)=int⁡(A) when S∈T, which is claim 3.

step 2.4step 1.5
4.1

By step 1.6 the set D∩S meets every nonempty open subset of S, hence is dense in (S,TS) by [L2]; and step 2.1 shows that the conclusion fails for a subspace that is not open. This is claim 4, and with steps 3.1, 3.2 and 3.3 all four claims are proved.

step 1.6step 2.1step 3.1step 3.2step 3.3L2∎

Remarks

  • The same two failures occur in R, and there they are the familiar ones. With the usual topology, S=[0,1] and A=[0,1] give int⁡S(A)=[0,1] while int⁡(A)=(0,1); and Q is dense in R while its trace on the subspace of irrationals is empty, so a dense set need not trace to a dense set of a subspace that is not open. Sierpinski space is used in the proof only because it needs no real-number machinery.

  • Why closure behaves better than interior. Claim 1 holds for every S, with no hypothesis, because the closed sets of a subspace are exactly the traces of the closed sets and tracing preserves the "smallest superset" that defines a closure. The interior is a largest subset, and tracing does not preserve that: a set can be open in S without being the trace of any open set of X that is contained in A, which is exactly what step 1.4 exhibits.

  • Claim 4 is what makes "has a countable dense subset" behave the way it does. The property passes to open subspaces by claim 4, and it does not pass to arbitrary subspaces; the witness for the failure is worked on the companion page, where an uncountable discrete subspace is exhibited inside a space with a countable dense subset.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

Hereditary, open-hereditary and closed-hereditary properties of topological spaces

Definition

A property of topological spaces is a condition P that is either true or false of each space, as in Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological; a topological property is one whose truth value is the same for homeomorphic spaces. Every subset of a space is regarded as a space by giving it the subspace topology (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).

Let P be a property of topological spaces. Then P is

  • hereditary if, whenever a space X has P, every subspace of X has P;
  • open-hereditary if, whenever X has P, every subspace S⊆X with S open in X has P;
  • closed-hereditary if, whenever X has P, every subspace S⊆X with S closed in X has P.

A hereditary property is both open-hereditary and closed-hereditary, since the condition on S is only a restriction of the range of subspaces quantified over. Neither of the two weaker notions implies the other, and neither implies heredity.

The definition is stable under the route by which a subspace is reached. If S⊆T⊆X then the topology S inherits from the subspace T is the topology S inherits from X, transitivity being discharged in 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. So "every subspace of X" is unambiguous, and a hereditary property automatically passes from X to a subspace of a subspace, with no separate induction.

Heredity is a statement about a property, not about a space. It quantifies over all spaces having P and all their subspaces, so a single space whose subspaces all inherit P says nothing; and a single space that has P and has one subspace lacking P refutes heredity outright. A space that lacks P refutes nothing, however its subspaces behave. That asymmetry is why the failures are recorded here as counterexamples and the successes as theorems.

Only topological properties are worth asking about. Taking S=X shows that a hereditary property holds of X itself, and the subspace topology on X is T (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, with U∩X=U), so the definition is not vacuous at the top. But a condition that is not invariant under homeomorphism can be hereditary for uninteresting reasons, since a subspace is only determined up to the identification of its topology (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison); every property named hereditary in this library is a topological property, and it is said so where it is proved.

Remarks

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

Every subspace of a metrizable space is metrizable and every subspace of a first countable space is first countable, the metric case being the subspace metric already identified with the subspace topology

Statement

Both of the following properties of topological spaces are hereditary (Hereditary, open-hereditary and closed-hereditary properties of topological spaces).

  1. Metrizability (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). If T is induced by a metric d on X and S⊆X, then the subspace topology TS (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) is induced by the subspace metric dS=d↾(S×S) (Isometry, isometric embedding, and the subspace metric on a subset). So a subspace of a metrizable space is metrizable, and a metric inducing its topology is available explicitly and not merely asserted to exist.
  2. First countability (First countable space: a countable neighbourhood base at every point). If every point of X has an at most countable neighbourhood base and S⊆X, then every point of S has an at most countable neighbourhood base in (S,TS), namely the family of traces on S of the members of a base at that point in X.

Claim 1 is a corollary in the strict sense: the identification of the subspace topology with the metric topology of the subspace metric is discharged inside Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, and nothing is reproved here.

Facts & Assumptions

Given: A topological space (X,T), a subset S⊆X with the subspace topology TS={ U∩S:U∈T }, and a point x∈S.

[A2]

N is a neighbourhood of x in a space when some open set U of that space satisfies x∈U⊆N; a family Bx of neighbourhoods of x is a neighbourhood base at x when every neighbourhood of x contains a member of it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[A3]

A space is first countable when every one of its points has an at most countable neighbourhood base (First countable space: a countable neighbourhood base at every point, Finite, countably infinite, countable, uncountable).

[L1]

For A⊆X and a metric d on X, the subspace topology { U∩A:U∈Td } is exactly the metric topology of the subspace metric dA (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, subspaces bullet; Isometry, isometric embedding, and the subspace metric on a subset).

[L3]

A nonempty set is at most countable if and only if it admits a surjection from N (A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable).

[L4]

A property P is hereditary when every subspace of every space satisfying P satisfies P (Hereditary, open-hereditary and closed-hereditary properties of topological spaces).

Proof

technique · direct
1.1

Let X be metrizable and let d be a metric on X with Td=T; such a d exists by [A1].

A1choose
1.2

Let X be first countable and let Bx be an at most countable neighbourhood base at x in X; such a family exists by [A3].

A3choose
2.1

Bx is nonempty, since X itself is a neighbourhood of x and so contains a member of Bx.

A2step 1.2
2.2

By [L1] applied with A:=S, the family { U∩S:U∈Td } is the metric topology of dS; and Td=T by step 1.1, so that family is TS by [L2].

step 1.1L1L2
2.3

Put BxS:={ N∩S:N∈Bx }. Each of its members is a neighbourhood of x in S: given N∈Bx there is U∈T with x∈U⊆N, and then U∩S∈TS with x∈U∩S⊆N∩S.

step 1.2A2L2
2.4

Every neighbourhood M of x in S contains a member of BxS: fix W∈TS with x∈W⊆M and write W=U∩S with U∈T by [L2]; then U is a neighbourhood of x in X, so some N∈Bx satisfies N⊆U, and N∩S⊆U∩S=W⊆M.

step 1.2A2L2
3.1

BxS is nonempty and at most countable: by step 2.1 and [L3] there is a surjection s:N→Bx, and k↦s(k)∩S is then a surjection N→BxS, so [L3] applies again.

step 2.1L3
3.2

By step 2.2 the topology TS is the metric topology of the metric dS on S, so (S,TS) is metrizable by [A1]; as X and S were arbitrary, metrizability is hereditary by [L4]. This is claim 1.

step 2.2A1L4
4.1

By steps 2.3, 2.4 and 3.1 the family BxS is an at most countable neighbourhood base at x in (S,TS), and x∈S was arbitrary, so (S,TS) is first countable by [A3]; as X and S were arbitrary, first countability is hereditary by [L4]. This is claim 2.

step 2.3step 2.4step 3.1A2A3L4∎

Remarks

  • No choice principle is spent. The metric dS is a restriction, and the neighbourhood base BxS is the image of a given family under an explicit map, so the enumeration of step 3.1 is produced from a given enumeration rather than selected. The only selections in the proof are the single metric of step 1.1 and the single family of step 1.2, each of which exists by hypothesis for the one space under consideration.

  • Neither converse holds, and neither is claimed. A subspace of a non-metrizable space may perfectly well be metrizable, every one-point subspace being so; heredity is a statement in one direction only.

  • The metric is not canonical, and the topology is. Claim 1 produces a metric on S, the restriction of the one chosen on X; a different metric on X inducing the same topology restricts to a different metric on S inducing the same subspace topology (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). What is hereditary is the existence of a metric, which is a property of the topology alone.

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

The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology

Definition

Two constructions are defined here, one for maps into spaces and one for maps out of spaces. Every further construction on this page is an instance of one of them.

Initial topology. Let X be a set, let I be an index set, let (Yi,Ti) be a topological space for each i∈I (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let fi:X→Yi be a function for each i. The initial topology on X induced by the family (fi)i∈I is

Tin  :=  ⟨ { fi−1[V]:i∈I, V∈Ti } ⟩,

the topology generated by the preimages of the open sets of the Yi (Basis and subbasis for a topology, and the topology generated by a family of sets).

This is well posed, and the obligation is discharged by the item cited. For an arbitrary family S of subsets of X, the family ⟨S⟩ is a topology on X, contains S, and is contained in every topology on X containing S (Basis and subbasis for a topology, and the topology generated by a family of sets); no further verification is needed here. By A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis a basis for Tin is the family of intersections of finitely many sets fi−1[V], the intersection of none being X.

Final topology. Let X be a set, let (Zi,Si) be a topological space for each i∈I, and let gi:Zi→X be a function for each i. The final topology on X induced by the family (gi)i∈I is

Tfin  :=  { U⊆X:gi−1[U]∈Si for every i∈I }.

This is a topology, and the verification is carried out here rather than assumed. Preimage commutes with the three set operations named in the axioms: gi−1[∅]=∅ and gi−1[X]=Zi, which gives (T1); gi−1[⋃U]=⋃{ gi−1[U]:U∈U } for every family U⊆Tfin, which with (T2) in Zi gives (T2); and gi−1[U∩V]=gi−1[U]∩gi−1[V], which with (T3) in Zi gives (T3) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Two degenerate cases, stated because they are used. For I=∅ the initial topology is ⟨∅⟩={∅,X}, the indiscrete topology, and the final topology is P(X), the discrete topology, the defining condition being vacuous (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Basis and subbasis for a topology, and the topology generated by a family of sets). For a family consisting of a single map the definitions read the same way with the index dropped.

The subspace topology is the model initial topology. Let (X,T) be a space, let S⊆X and let ι:S→X be the inclusion. Then ι−1[U]=U∩S for every U⊆X, so the generating family for the initial topology of the one-element family (ι) is exactly TS={ U∩S:U∈T } (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). That family is already a topology, so generating adds nothing and the initial topology of ι is the subspace topology. Everything 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 proves about it is therefore quoted here and not reproved: its closed sets are the traces of the closed sets, a basis of X traces to a basis of S, the inclusion is continuous (Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾), TS is the coarsest topology making ι continuous, and a map g:Z→S is continuous if and only if ι∘g is.

Terminology. A family (fi) as above is the defining family of the initial topology, and likewise for the final one; both topologies depend on the whole family and not on any one member. The characteristic properties that make these two constructions worth naming are the subject of the next item.

Remarks

  • The direction of the arrows is what distinguishes the two. An initial topology is put on the source of its defining maps and is the coarsest making them continuous; a final topology is put on the target and is the finest making them continuous. Both facts are proved in the next item rather than built into the definitions above.

  • Why the initial topology is generated and the final one is not. The preimages fi−1[V] need not be closed under unions or finite intersections, so a topology has to be generated from them; the final family is closed under both operations already, because preimage commutes with both, so it is a topology as it stands. The asymmetry is a fact about preimages and not a choice of presentation.

  • Both constructions are determined by a universal property, so they are unique once that property is stated. That is the content of the next item, and it is what lets the product, the coproduct and the quotient be treated as three instances of two constructions rather than as three separate theories.

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

Characteristic properties: a map into a space with the initial topology is continuous iff every composite with the defining family is, a map out of a space with the final topology is continuous iff every composite with the defining family is, and the two topologies are respectively the coarsest and the finest making that family continuous

Statement

Let X be a set and let I be an index set.

Initial. Let (Yi,Ti) be spaces and fi:X→Yi functions, and give X the initial topology Tin of the family (fi)i∈I (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology). Then:

  1. Every fi is continuous for Tin, and Tin is the coarsest topology on X with that property: every topology on X making all the fi continuous contains Tin.
  2. Characteristic property. For every space Z and every function h:Z→X, h is continuous   ⟺  fi∘h is continuous for every i∈I.

Final. Let (Zi,Si) be spaces and gi:Zi→X functions, and give X the final topology Tfin of the family (gi)i∈I. Then:

  1. Every gi is continuous for Tfin, and Tfin is the finest topology on X with that property: every topology on X making all the gi continuous is contained in Tfin.
  2. Characteristic property. For every space W and every function k:X→W, k is continuous   ⟺  k∘gi is continuous for every i∈I.

Claims 2 and 4 determine their topologies: a topology on X satisfying claim 2 for every Z and h must equal Tin, and likewise for claim 4, by the argument recorded in the remarks.

Facts & Assumptions

Given: A set X; spaces (Yi,Ti) with functions fi:X→Yi; spaces (Zi,Si) with functions gi:Zi→X; a space Z with a function h:Z→X and a space W with a function k:X→W. Preimages satisfy (u∘v)−1[T]=v−1[u−1[T]] for composable functions u,v and every subset T of the target.

[A1]

Tin=⟨G⟩ where G:={ fi−1[V]:i∈I, V∈Ti }, and Tfin={ U⊆X:gi−1[U]∈Si for every i } (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology).

[L2]

A map of spaces is continuous if and only if preimages of open sets are open, and if and only if preimages of the members of some subbasis of the target are open (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾, clauses (b) and (d); Continuity of a map of topological spaces at a point and globally).

[L4]

A topology contains ∅ and the whole set and is closed under arbitrary unions and binary intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

Each fi is continuous for Tin: for V∈Ti the set fi−1[V] lies in G⊆⟨G⟩=Tin, so preimages of open sets are open.

A1L1L2
1.2

Let T′ be a topology on X making every fi continuous. Then G⊆T′ by [L2], so Tin=⟨G⟩⊆T′ by [L1].

A1L1L2
1.3

Each gi is continuous for Tfin: if U∈Tfin then gi−1[U]∈Si by the defining condition.

A1L2
1.4

Let T′′ be a topology on X making every gi continuous, and let U∈T′′. Then gi−1[U]∈Si for every i by [L2], so U∈Tfin; hence T′′⊆Tfin.

A1L2
1.5

Assume every fi∘h is continuous. For i∈I and V∈Ti one has h−1[fi−1[V]]=(fi∘h)−1[V], which is open in Z; so preimages under h of all members of G are open, and G is a subbasis for Tin, so h is continuous by clause (d) of [L2].

givenA1L1L2
1.6

Assume every k∘gi is continuous. For V open in W and each i one has gi−1[k−1[V]]=(k∘gi)−1[V], which is open in Zi; so k−1[V]∈Tfin by the defining condition, and k is continuous by clause (b) of [L2].

givenA1L2
2.1

If h:Z→X is continuous then each fi∘h is continuous, and if k:X→W is continuous then each k∘gi is continuous, in both cases as a composite of continuous maps, the fi being continuous by step 1.1 and the gi by step 1.3.

step 1.1step 1.3L3
2.2

Steps 1.1 and 1.2 are claim 1, and steps 1.3 and 1.4 are claim 3.

step 1.1step 1.2step 1.3step 1.4L4
3.1

Step 2.1 gives the forward implications of claims 2 and 4, and steps 1.5 and 1.6 give the reverse implications; so claims 2 and 4 hold, and with step 2.2 all four claims are proved.

step 2.1step 1.5step 1.6step 2.2∎

Remarks

  • The characteristic property pins the topology down. Suppose two topologies T1 and T2 on X both satisfy claim 2 for every space Z and every function h. Apply claim 2 for T1 to Z=(X,T2) and h=id: the composites fi are continuous on (X,T2) by claim 2 for T2 applied to the identity of (X,T2), so the identity (X,T2)→(X,T1) is continuous, that is T1⊆T2. Exchanging the roles gives equality. The same argument with the arrows reversed does claim 4.

  • Only continuity of the composites is tested, never their openness. Claim 2 says nothing about whether h is open or closed, and claim 4 says nothing about k; the constructions below acquire such properties one at a time and each is proved where it is used.

  • The one-element family is not a degenerate case but the main one. The subspace topology is the initial topology of a single inclusion and the quotient topology is the final topology of a single surjection (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology), so claims 2 and 4 with I a one-element set already carry the characteristic properties of both.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

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

Definition

The product set. Let I be a set and let Xi be a set for each i∈I. The product is

∏i∈IXi  :=  { x:x is a function with domain I and x(i)∈Xi for every i∈I },

and we write xi:=x(i), the i-th coordinate of x. Two elements of the product are equal exactly when they agree at every index, functions being equal when they have the same domain and the same values. For j∈I the j-th projection is

πj:∏i∈IXi→Xj,πj(x):=xj.

Notation for a finite product. For I=n a natural number, which is the set {0,1,…,n−1} of its predecessors, an element of ∏k<nXk is a function on n and we write it (x0,…,xn−1). In particular I=2 gives the binary product, written X×Y for ∏i<2Xi with X0=X and X1=Y, whose elements are written (u,v) for the function 0↦u, 1↦v. This is the only meaning the symbol X×Y carries on this page.

Two facts about when the product is nonempty, stated because they are used and because they cost something. If some Xi0 is empty then the product is empty, since no function can take a value in Xi0. Conversely, suppose every Xi is nonempty.

  • For I=n a natural number, the product is nonempty, and this is a theorem of ZF: Every natural-number-indexed list of nonempty sets has a choice function on its family of values applied to the function i↦Xi on n supplies a choice function g for the family of values, and x(i):=g(Xi) defines a member of ∏k<nXk.
  • For an arbitrary I the assertion "∏i∈IXi≠∅ whenever every Xi is nonempty" is the Axiom of Choice: it is the formulation recorded in The Axiom of Choice, and the choice function of Choice function is exactly a point of the product of a family by itself. Every use of it below is flagged at the step that spends it.

The box topology. Now let each Xi carry a topology Ti (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Put

R  :=  { ∏i∈IUi  :  Ui∈Ti for every i∈I },

the family of boxes. R is a basis for a topology (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis): it contains ∏iXi, so it covers the product, and it is closed under binary intersections, since

(∏iUi)∩(∏iVi)=∏i(Ui∩Vi)

and each Ui∩Vi is open by (T3). The topology it generates is the box topology T□, and R is a basis for it (Basis and subbasis for a topology, and the topology generated by a family of sets).

The product topology. The product topology TΠ on ∏iXi is the initial topology of the family of projections (πi)i∈I (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology): the topology generated by the subbasis

G  :=  { πi−1[U]:i∈I, U∈Ti },πi−1[U]=∏j∈IWj  with Wi=U and Wj=Xj for j≠i.

By A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis the finite intersections of members of G form a basis for TΠ, and those finite intersections are exactly the boxes with all but finitely many factors unrestricted:

RΠ  =  { ∏i∈IUi  :  Ui∈Ti for every i, and Ui=Xi for all but finitely many i }.

Indeed the intersection of πi1−1[U1],…,πin−1[Un] is the box whose factor at i is the intersection of those Um with im=i and is Xi when no im equals i; and the intersection of no members is the whole product, the box with every factor Xi. Conversely a box with Ui=Xi off a finite set is such an intersection. Members of RΠ are called basic product-open sets, and members of R boxes. So RΠ⊆R, with equality when I is a natural number.

The empty product. For I=∅ there is exactly one function with domain ∅, the empty function, so ∏i∈∅Xi is a one-point set. A one-point set carries exactly one topology, namely {∅,{∅}}, since a topology must contain the empty set and the whole set and there is nothing else to contain (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison); so the box topology and the product topology agree there, and both equal the discrete topology and the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), which coincide on a one-point set. There are no projections to speak of, and the initial topology of the empty family is indeed the indiscrete one (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology).

Convention. Unless the box topology is named explicitly, ∏iXi always carries the product topology in this library. That is not a matter of taste: the product topology is the one with the characteristic property of the next item, and the box topology has no such property.

Remarks

  • Where the two topologies actually differ. The box topology is finer than the product topology by construction, since RΠ⊆R. They agree whenever I is finite; and, assuming the Axiom of Choice, for a family of nonempty spaces they differ for infinite I as soon as infinitely many factors have a nonempty proper open subset. Nonemptiness is not decoration: if one factor is empty then the product is empty and carries exactly one topology, so the two agree however the other factors are chosen. Both statements are proved two items below, with that hypothesis, and the failure is recorded on this page as a false statement.

  • The product set is a set of functions, and that is not a technicality. The factors are indexed by an arbitrary set, so there is no "list" to write down; writing x=(xi)i∈I is notation for the function x. The finite case recovers the familiar tuple, and the identification of ∏k<nR with the Rn of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it is literal, that item defining Rn as the set of functions n→R.

  • The projections carry no hypothesis. They are defined for every product, including the empty one and products with an empty factor; what does need a hypothesis is their surjectivity, which is the point at which choice enters and which is stated separately in the next item.

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

A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice

Statement

Let (Xi,Ti)i∈I be topological spaces and let P:=∏i∈IXi carry the product topology, with projections πj (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). Then:

  1. The projections are continuous, and the product topology is the coarsest topology on P making all of them continuous.
  2. Characteristic property. For every space Z and every function h:Z→P, h is continuous   ⟺  πi∘h is continuous for every i∈I. The functions πi∘h are the components of h, and every family of functions hi:Z→Xi arises from exactly one h, namely h(z)(i):=hi(z).
  3. The projections are open maps (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological), for the product topology and for the box topology alike. They need not be closed; that failure is recorded on this page as a false statement.
  4. Surjectivity. If every Xi is nonempty then every πj is surjective. For I a natural number this is a theorem of ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values); for an arbitrary I it is the Axiom of Choice (The Axiom of Choice), and this is the only place in the item where a choice principle is used.

Facts & Assumptions

Given: Topological spaces (Xi,Ti)i∈I, the product P=∏i∈IXi with the product topology and the projections πj(x)=xj, a space Z and a function h:Z→P, and an index j∈I.

[A1]

The product topology on P is the initial topology of (πi)i∈I, and a basis for it is the family of boxes ∏iUi with every Ui open and Ui=Xi for all but finitely many i; a basis for the box topology is the family of all boxes ∏iUi with every Ui open (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, Basis and subbasis for a topology, and the topology generated by a family of sets).

[A2]

f is an open map when f[U] is open in the target for every open U in the source (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[L2]

If F is a function with domain a natural number n whose values are nonempty sets, then the family of its values has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values, Choice function).

[L3]

If every member of a family of sets is nonempty then the product of the family is nonempty; this is the Axiom of Choice (The Axiom of Choice, Choice function).

[L4]

The image of a union is the union of the images, and an arbitrary union of open sets is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

By [A1] the product topology is an initial topology, so [L1] gives claim 1 and claim 2 at once, the defining family being (πi)i∈I.

A1L1
1.2

For a family of functions hi:Z→Xi the assignment h(z)(i):=hi(z) defines a function Z→P, since h(z) has domain I and h(z)(i)=hi(z)∈Xi; it satisfies πi∘h=hi, and any h′ with πi∘h′=hi for every i satisfies h′(z)(i)=hi(z)=h(z)(i) for all z and i, hence h′=h.

given
1.3

Let B=∏iUi be a box with every Ui open. If B=∅ then πj[B]=∅. If B≠∅, fix b∈B; then πj[B]=Uj, since πj[B]⊆Uj by definition, and for u∈Uj the function y with yj:=u and yi:=bi for i≠j lies in B and has πj(y)=u.

A1choose
1.4

Assume every Xi is nonempty and I is a natural number n. By [L2] applied to i↦Xi there is a choice function g for the family of values, and x(i):=g(Xi) defines a point of P; so P≠∅.

L2
1.5

Assume every Xi is nonempty and I is arbitrary. By [L3] the product P is nonempty.

L3
2.1

Both the box topology and the product topology have a basis consisting of boxes, by [A1], and the image of a union of basic sets is the union of their images; so by step 1.3 the image under πj of any open set of either topology is a union of sets each of which is ∅ or an open Uj⊆Xj, hence open. This is claim 3.

step 1.3A1A2L4
2.2

Assume every Xi is nonempty and let t∈Xj. By step 1.4 when I is a natural number, and by step 1.5 in general, there is a point p∈P; the function y with yj:=t and yi:=pi for i≠j then lies in P and satisfies πj(y)=t. So πj is surjective, which is claim 4.

step 1.4step 1.5
3.1

Step 1.1 gives claims 1 and 2, step 1.2 gives the bijection between maps into P and families of component maps, step 2.1 gives claim 3 and step 2.2 gives claim 4.

step 1.1step 1.2step 2.1step 2.2∎

Remarks

  • Exactly where choice is spent, and where it is not. Openness of the projections (claim 3) is choice free: step 1.3 uses a single point of the box in question, which is given by the assumption that the box is nonempty, and builds the required preimage from it by changing one coordinate. Surjectivity (claim 4) is different, because there the point has to be produced from nothing but nonemptiness of the factors, and for an infinite index set that is the Axiom of Choice itself.

  • The characteristic property is what makes the product topology the right one. The box topology has no analogue of claim 2: a map into a box-topologised product may have all components continuous and fail to be continuous, and the companion page exhibits the diagonal of RN doing exactly that.

  • Openness does not survive to closedness. A projection is always open and is in general not closed, and the standard witness, the hyperbola in R2, is worked in the false statement on this page. There is no asymmetry of taste here: images of open boxes are computed coordinatewise, while a closed set of the product need not be a union of closed boxes at all.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

The box topology is finer than the product topology, the two agree for a finite index set in ZF, and, assuming the Axiom of Choice for nonempty factors, the box topology is strictly finer whenever infinitely many factors have a nonempty proper open subset

Statement

Let (Xi,Ti)i∈I be topological spaces, let P:=∏i∈IXi, and let TΠ and T□ be the product and the box topology on P (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). Then:

  1. TΠ⊆T□: the box topology is finer than the product topology (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
  2. If I is a natural number then TΠ=T□; this is a theorem of ZF.
  3. Assume the Axiom of Choice. Suppose every Xi is nonempty and let J  :=  { i∈I:Xi has an open subset U with ∅≠U≠Xi }. If J is not finite then TΠ⊊T□: the inclusion of claim 1 is strict.

Claim 3 spends the Axiom of Choice twice (The Axiom of Choice), once to produce a point of P and once to select an open set together with a point of it in each factor indexed by J; both uses are flagged at the steps that make them. The hypothesis is stated in terms of open subsets rather than as "infinitely many factors are non-trivial", because a factor may have more than one point and still have no open set other than ∅ and itself, as the indiscrete topology shows (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and for such a factor the conclusion fails.

Facts & Assumptions

Given: Topological spaces (Xi,Ti)i∈I, the product set P=∏i∈IXi with its two topologies, and the set J of the statement.

[A1]

A basis for TΠ is the family RΠ of boxes ∏iUi with every Ui open and Ui=Xi for all but finitely many i; a basis for T□ is the family R of all boxes ∏iUi with every Ui open (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).

[L1]

If B1⊆B2 are bases for topologies T1 and T2 on the same set, then T1⊆T2, every member of T1 being a union of members of B1⊆B2⊆T2 (Basis and subbasis for a topology, and the topology generated by a family of sets, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

A subset of a finite set is finite; this is fact (i) discharged in The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies.

[L3]

If every member of a family of nonempty sets is nonempty then the family has a choice function, and the product of the family is nonempty; this is the Axiom of Choice (The Axiom of Choice, Choice function).

Proof

technique · direct
1.1

RΠ⊆R, a box with all but finitely many factors equal to Xi being in particular a box.

A1
1.2

If I is a natural number n then R⊆RΠ, since the exceptional index set of any box is a subset of n and hence finite by [L2], so every box is basic product-open.

A1L2
1.3

Assume every Xi is nonempty and J is not finite. For i∈J let Ai:={ (U,u):U∈Ti, u∈U, U≠Xi }; each Ai is nonempty, since J supplies an open U with ∅≠U≠Xi and U nonempty supplies a u∈U.

givenL3
2.1

By [L3] applied to (Ai)i∈J there are (Ui,ui)∈Ai for every i∈J; and by [L3] applied to (Xi)i∈I there is a point p∈P.

step 1.3L3choose
2.2

Claim 1 follows from step 1.1 and [L1], and claim 2 from steps 1.1 and 1.2 with [L1] applied in both directions.

step 1.1step 1.2L1
3.1

Define x∈P by xi:=ui for i∈J and xi:=pi for i∉J, and put B:=∏iVi with Vi:=Ui for i∈J and Vi:=Xi otherwise. Then B∈R⊆T□ and x∈B.

step 2.1A1
4.1

Suppose B were in TΠ. Then by [A1] there is a basic product-open O=∏iOi with x∈O⊆B, and by [A2] its exceptional index set is contained in {i0,…,in−1} for some natural n.

step 3.1A1A2assume-hyp
5.1

The set J is not contained in {i0,…,in−1}: otherwise J would be a subset of a finite set and hence finite by [L2], contrary to the hypothesis of step 1.3. So there is j∈J with Oj=Xj.

step 1.3step 4.1L2
6.1

For j as in step 5.1 and any t∈Xj, the point y with yj:=t and yi:=xi for i≠j lies in O, since x∈O and Oj=Xj; hence y∈B and t=yj∈Vj=Uj. So Xj⊆Uj, contradicting Uj≠Xj from step 2.1.

step 2.1step 3.1step 4.1step 5.1
7.1

Therefore B∉TΠ while B∈T□, so the inclusion of claim 1 is strict, which is claim 3; with step 2.2 all three claims are proved.

step 2.2step 3.1step 6.1∎

Remarks

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

Products commute with subspaces; for infinite nonempty families, the closure identity ∏Ai‾=∏Ai‾ uses the Axiom of Choice

Statement

Let (Xi,Ti)i∈I be topological spaces, let Ai⊆Xi for each i, and give ∏iXi the product topology (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). Then:

  1. Subspaces commute with products. The product of the subspace topologies on the Ai (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) is exactly the subspace topology that ∏iAi inherits from ∏iXi. So the phrase "the product of the subspaces Ai" names one topology, whichever of the two routes is taken.
  2. Closure of a product is the product of the closures. In ∏iXi, ∏i∈IAi‾  =  ∏i∈IAi‾, closures being taken in ∏iXi and in Xi respectively (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). In particular ∏iAi is closed in the product whenever every Ai is closed in Xi.

No hypothesis of nonemptiness is imposed in claim 2: if some Ai0 is empty then both sides are empty, since ∅‾=∅. When every Ai is nonempty the inclusion ⊇ of claim 2 uses the Axiom of Choice for infinite I (The Axiom of Choice) and Every natural-number-indexed list of nonempty sets has a choice function on its family of values for I a natural number, and that is the only place in the item where a choice principle appears.

Facts & Assumptions

Given: Topological spaces (Xi,Ti)i∈I, subsets Ai⊆Xi, the product P:=∏iXi with the product topology, the subset A:=∏iAi⊆P, and the projections πj:P→Xj and πjA:A→Aj.

[A1]

A basis for the product topology on P is the family of boxes ∏iUi with every Ui open and Ui=Xi off a set listed as {i0,…,in−1} for some natural n; the product topology is generated by the subbasis {πi−1[U]:U∈Ti} (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, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis).

[A2]

The subspace topology on A⊆P is { O∩A:O open in P }, and likewise on each Ai⊆Xi (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).

[L1]

A topology generated by a family is the coarsest topology containing it, and two families generating the same topology may be exchanged freely (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L4]

x∈B‾ if and only if every basic open set containing x meets B; B‾ is the smallest closed superset of B, and ∅‾=∅ (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, clauses (c) and (d) and claim 2; Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L5]

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, Choice function); a family of nonempty sets indexed by an arbitrary set has one by the Axiom of Choice (The Axiom of Choice).

Proof

technique · direct
1.1

For i∈I and U∈Ti one has (πiA)−1[U∩Ai]={ x∈A:xi∈U∩Ai }={ x∈A:xi∈U }=πi−1[U]∩A, the middle equality holding because every x∈A already satisfies xi∈Ai.

givenA2
1.2

As U ranges over Ti and i over I, the sets πi−1[U]∩A are exactly the traces on A of the subbasic open sets of P, and the sets U∩Ai are exactly the open sets of the subspace Ai.

A1A2
1.3

If some Ai0=∅ then A=∅ and Ai0‾=∅ by [L4], so A‾=∅ and ∏iAi‾=∅ as well.

givenL4
1.4

Each πi is continuous and πi[A]⊆Ai, so [L3] gives πi[A‾]⊆πi[A]‾⊆Ai‾; hence every x∈A‾ has xi∈Ai‾ for every i, that is A‾⊆∏iAi‾.

givenL2L3L4
1.5

Assume every Ai is nonempty, and fix by [L5] a point a∈∏iAi=A.

L5choose
1.6

Assume every Ai is nonempty, let x∈∏iAi‾ and let B=∏iOi be a basic open set of P with x∈B, with Oi=Xi off {i0,…,in−1} as in [A1]. For each m<n the set Oim∩Aim is nonempty, since xim∈Aim‾ and Oim is an open set containing it.

A1L4
2.1

By step 1.1 and step 1.2 the initial topology on A of the family (πiA) and the subspace topology on A are generated by the same family of subsets of A: the first by the sets (πiA)−1[W] with W open in Ai, the second by the traces on A of the open sets of P, whose subbasic members are the traces of the sets πi−1[U]. So the two topologies coincide, which is claim 1.

step 1.1step 1.2A1A2L1
2.2

By [L5] applied to the function m↦Oim∩Aim on n, choose cm∈Oim∩Aim for each m<n, and define y∈P by yim:=cm for m<n and yi:=ai for every other i, with a as in step 1.5. Then yi∈Ai for every i, so y∈A; and yi∈Oi for every i, since Oi=Xi off the listed indices. So y∈B∩A.

step 1.5step 1.6L5choose
3.1

By step 2.2 every basic open set containing x meets A, so x∈A‾ by [L4]; hence ∏iAi‾⊆A‾ when every Ai is nonempty, and with step 1.4 the two sets are equal in that case.

step 1.4step 2.2L4
4.1

Step 1.3 disposes of the case in which some Ai is empty and step 3.1 of the case in which none is, so claim 2 holds in general; the final sentence of claim 2 follows because Ai=Ai‾ for every i then gives A‾=A, which is closedness by [L4]. With step 2.1 both claims are proved.

step 1.3step 2.1step 3.1L4∎

Remarks

  • Claim 1 is what lets "∏Ai" be written without a warning. Every later item that forms a product of subspaces, the Hilbert cube and the Cantor set among them, silently uses it: the topology on [0,1]N obtained by taking the product of the subspaces [0,1]⊆R is the topology it inherits as a subset of RN.

  • Claim 2 fails for the box topology in the direction one might expect it to hold. Nothing above is claimed for T□. The inclusion A‾⊆∏Ai‾ survives there without any choice principle, since it uses only continuity of the projections, which holds for the box topology as well. The reverse inclusion also holds for the box topology, but only with the Axiom of Choice (The Axiom of Choice): given x∈∏Ai‾ and a box ∏iUi around x, every Ui∩Ai is nonempty, and a choice function picks a point of (∏iUi)∩∏iAi. What is genuinely not claimed here is a choice-free proof of that half.

  • The choice is spent on the coordinates that the basic open set leaves unrestricted. Those are all but finitely many, and for each of them the point y of step 2.2 needs some member of Ai; the finitely many restricted coordinates are handled by Every natural-number-indexed list of nonempty sets has a choice function on its family of values alone. That split is exactly why the finite case of claim 2 is a theorem of ZF.

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

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.

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

The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is

Definition

The underlying set. Let I be a set and let Xi be a set for each i∈I. The disjoint union is

⨆i∈IXi  :=  ⋃i∈I(Xi×{i}),

whose elements are the pairs (x,i) with i∈I and x∈Xi. For j∈I the j-th canonical injection is

κj:Xj→⨆i∈IXi,κj(x):=(x,j).

The construction is what makes the word "disjoint" honest. Each κj is injective (Injection, surjection, bijection), since (x,j)=(x′,j) forces x=x′; the images κj[Xj]=Xj×{j} are pairwise disjoint, since the second coordinate determines j; and their union is the whole set. So no assumption that the Xi are disjoint as sets is needed, and none is made: the tag i separates the copies even when Xi=Xi′ for i≠i′.

The trace of a subset. For U⊆⨆iXi and j∈I write

Uj  :=  κj−1[U]  =  { x∈Xj:(x,j)∈U }⊆Xj,

the trace of U on the j-th summand. A subset is determined by its family of traces, since U=⋃iκi[Ui].

The topology. Now let each Xi carry a topology Ti (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). The disjoint union topology (also coproduct topology, or topological sum) on ⨆iXi is the final topology of the family (κi)i∈I (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology), that is

T⊔  :=  { U⊆⨆iXi  :  Ui∈Ti for every i∈I }:

a set is open exactly when each of its traces is open. That this is a topology is discharged in The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology, where the final topology of any family is verified to satisfy (T1), (T2) and (T3); nothing further is needed here.

Closed sets, dually. F⊆⨆iXi is closed exactly when every trace Fi is closed in Xi. Indeed the trace operation commutes with complementation, κi−1[ ⨆jXj∖F ]=Xi∖Fi, so F is closed if and only if the complement is open if and only if every Xi∖Fi is open.

Each summand sits inside as a clopen subspace. The set κj[Xj]=Xj×{j} has traces Xj at j and ∅ elsewhere, both open and both closed, so it is clopen in the union. Its subspace topology (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) is carried across by κj from Tj, and κj is an embedding (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological); both statements are proved in the next item rather than assumed here.

Degenerate cases. For I=∅ the disjoint union is the empty set with its only topology. For I a one-element set the map κ is a bijection carrying T to T⊔, so the construction returns the one summand up to homeomorphism and changes nothing.

Remarks

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

A map out of a disjoint union is continuous iff each of its restrictions is; the canonical injections are open and closed embeddings; and each summand is clopen in the union

Statement

Let (Xi,Ti)i∈I be topological spaces and let S:=⨆i∈IXi carry the disjoint union topology, with canonical injections κj (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is). Then:

  1. Characteristic property. For every space W and every function k:S→W, k is continuous   ⟺  k∘κi is continuous for every i∈I, and every family of continuous maps ki:Xi→W arises from exactly one such k, namely k(x,i):=ki(x).
  2. The injections are continuous, open and closed and injective (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, Injection, surjection, bijection); consequently each κj is an embedding, and the subspace topology on κj[Xj] is the image of Tj under κj (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).
  3. Each summand is clopen. κj[Xj]=Xj×{j} is both open and closed in S, and the sets κj[Xj], j∈I, are pairwise disjoint with union S.

Facts & Assumptions

Given: Topological spaces (Xi,Ti)i∈I, the set S=⨆iXi with the disjoint union topology, the injections κj(x)=(x,j), an index j∈I, a space W and a function k:S→W.

[A1]

S=⋃i(Xi×{i}); each κi is injective; the sets Xi×{i} are pairwise disjoint with union S; and U⊆S is open exactly when κi−1[U] is open in Xi for every i, closed exactly when every κi−1[U] is closed (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is, Injection, surjection, bijection).

[L2]

f is an open map when images of open sets are open, a closed map when images of closed sets are closed, and an embedding when it is injective and its corestriction to its image, with the subspace topology, is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, 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).

Proof

technique · direct
1.1

By [A2] and [L1] the injections are continuous and claim 1's equivalence holds.

A2L1
1.2

A family of functions ki:Xi→W determines exactly one k:S→W with k∘κi=ki for every i: every element of S is (x,i) for exactly one pair by [A1], so k(x,i):=ki(x) is a well defined function, and any k′ with k′∘κi=ki agrees with it at every (x,i).

A1
1.3

Let V⊆Xj and compute the traces of κj[V]=V×{j}: for i=j the trace is V, and for i≠j it is ∅, since (x,i)∈V×{j} forces i=j.

A1
2.1

If V is open in Xj, then by step 1.3 all traces of κj[V] are open, ∅ being open by [L4]; so κj[V] is open in S by [A1] and κj is an open map.

step 1.3A1L2L4
2.2

If F is closed in Xj, then by step 1.3 the traces of κj[F] are F and ∅, both closed, ∅ being closed by [L4]; so κj[F] is closed in S by [A1] and κj is a closed map.

step 1.3A1L2L4
2.3

The corestriction κj0:Xj→κj[Xj] is a bijection, being injective by [A1] and surjective onto its image, and it is continuous by [L3], since κj is continuous by step 1.1.

step 1.1A1L3
3.1

Taking V:=Xj in step 2.1 and F:=Xj in step 2.2 shows that κj[Xj] is open and closed in S; with the disjointness and the covering property of [A1] this is claim 3.

step 2.1step 2.2A1L4
3.2

κj0 is an open map into the subspace κj[Xj]: for V open in Xj the set κj[V] is open in S by step 2.1 and is contained in κj[Xj], so it equals its own trace on κj[Xj] and is open there.

step 2.1L2
4.1

By steps 2.3 and 3.2 with [L3] the map κj0 is a homeomorphism onto the subspace κj[Xj], so κj is an embedding and the subspace topology on κj[Xj] is the image of Tj; with steps 1.1, 2.1 and 2.2 this is claim 2.

step 1.1step 2.1step 2.2step 2.3step 3.2L2L3
5.1

Step 1.1 and step 1.2 give claim 1, step 4.1 gives claim 2 and step 3.1 gives claim 3.

step 1.1step 1.2step 3.1step 4.1∎

Remarks

  • The coproduct is where "define a map piecewise" becomes a theorem. Claim 1 says that specifying a continuous map on each summand separately, with no compatibility condition whatever, specifies a continuous map on the union. The absence of a compatibility condition is exactly what the disjointness buys; the pasting lemma (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous) is the corresponding statement for covers that do overlap, and it needs the pieces to agree.

  • Being open and closed is unusual, and it is what separates the summands. A continuous map out of S can be constant on one summand and wild on another, so no summand is topologically attached to any other. This is the reason the disjoint union appears in the construction of an adjunction space: the gluing is put in afterwards, by a quotient, and the coproduct contributes no gluing of its own.

  • Nothing here needs the index set to be small. Claims 1 to 3 hold for an arbitrary index set and no choice principle is used, the maps in every step being given by explicit formulas.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection

Definition

The quotient topology. Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let Y be a set and let q:X→Y be a surjection (Injection, surjection, bijection). The quotient topology on Y induced by q is the final topology of the one-element family (q) (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology):

Tq  :=  { V⊆Y:q−1[V]∈T }.

That this is a topology is discharged in The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology, where every final topology is verified to satisfy (T1), (T2) and (T3). Dually, C⊆Y is closed in Tq exactly when q−1[C] is closed in X, because q−1[Y∖V]=X∖q−1[V].

Quotient map. A surjection q:X→Y between topological spaces is a quotient map (also identification map) when the topology of Y is the quotient topology of q, that is when

V is open in Y  ⟺  q−1[V] is open in X(V⊆Y).

The implication from left to right is exactly continuity of q (Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾ clause (b)), so a quotient map is a continuous surjection with the extra property that its topology is as fine as continuity permits. Equivalently, and this form is used as often: C is closed in Y if and only if q−1[C] is closed in X.

Saturated sets. Let q:X→Y be a surjection. A subset A⊆X is saturated with respect to q when

A  =  q−1[ q[A] ],

equivalently when A is a union of fibres q−1[{y}], equivalently when x∈A and q(x′)=q(x) imply x′∈A. The set q−1[q[A]] is the saturation of A, and it is the smallest saturated set containing A. The map V↦q−1[V] is a bijection from P(Y) onto the saturated subsets of X, with inverse A↦q[A], since q is surjective; under it the open sets of the quotient topology correspond exactly to the saturated open subsets of X. That correspondence is the working description of the quotient topology: to know the open sets of Y is to know which open subsets of X are saturated.

Quotient by an equivalence relation. Let ∼ be an equivalence relation on X, that is a relation that is reflexive (x∼x), symmetric (x∼x′ implies x′∼x) and transitive (x∼x′ and x′∼x′′ imply x∼x′′). Write [x]:={ x′∈X:x′∼x } for the equivalence class of x; distinct classes are disjoint and their union is X. The quotient set is X/ ⁣∼ :={ [x]:x∈X } and the canonical projection is

π:X→X/ ⁣∼,π(x):=[x],

which is a surjection by construction. The set X/ ⁣∼ always carries the quotient topology of π, and (X/ ⁣∼, Tπ) is called an identification space. A subset of X is saturated for π exactly when it is a union of equivalence classes.

A convenient special case: collapsing a subset. For ∅≠B⊆X let ∼B be the relation whose classes are B itself and the singletons {x} for x∉B; this is an equivalence relation, its classes being a partition of X. The resulting quotient is written X/B, and its canonical projection is a surjection identifying all of B to a single point and doing nothing else. Saturated sets for ∼B are the sets A with A∩B∈{∅,B}.

Two conventions used throughout. First, "quotient map" is a property of a map together with the two topologies, never of the map alone. Second, a quotient topology is determined by q together with the topology on its domain, and not by the underlying pair of sets (X,Y): two different surjections onto the same set can give different topologies, the same surjection gives different topologies when its domain is retopologised, and where more than one is in play the map is named.

Remarks

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

For a quotient map q:X→Y, a map out of Y is continuous iff its composite with q is; a continuous map on X constant on the fibres of q factors uniquely through q; and a composite of quotient maps is a quotient map

Statement

Let q:X→Y be a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Then:

  1. Characteristic property. For every space W and every function k:Y→W, k is continuous   ⟺  k∘q is continuous.
  2. Factorisation. Let f:X→W be continuous and constant on the fibres of q, that is q(x)=q(x′) implies f(x)=f(x′). Then there is exactly one function fˉ:Y→W with fˉ∘q=f, and it is continuous.
  3. Composites. If q:X→Y and p:Y→Z are quotient maps then p∘q:X→Z is a quotient map.

Facts & Assumptions

Given: A quotient map q:X→Y, a space W, a function k:Y→W, a continuous f:X→W constant on the fibres of q, and a further quotient map p:Y→Z.

[A1]

q is a surjection and V⊆Y is open exactly when q−1[V] is open in X; the topology of Y is the final topology of the one-element family (q) (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection, Injection, surjection, bijection).

[L3]

Preimages compose: (u∘v)−1[T]=v−1[u−1[T]]; a composite of surjections is a surjection (Injection, surjection, bijection).

Proof

technique · direct
1.1

By [A1] the topology of Y is a final topology of the one-element family (q), so [L1] gives claim 1 at once.

A1L1
1.2

Define fˉ:={ (y,w):there is x∈X with q(x)=y and f(x)=w }. It is total on Y, since q is surjective by [A1]; and it is single valued, since q(x)=q(x′) implies f(x)=f(x′) by hypothesis. So fˉ is a function Y→W with fˉ∘q=f.

givenA1
1.3

Any g:Y→W with g∘q=f equals fˉ: for y∈Y pick x with q(x)=y, available by surjectivity, and then g(y)=f(x)=fˉ(y).

givenA1
1.4

p∘q is a surjection, being a composite of surjections.

A1A2L3
1.5

For V⊆Z: (p∘q)−1[V]=q−1[p−1[V]] by [L3].

L3
2.1

By step 1.2 the map fˉ exists with fˉ∘q=f continuous, so fˉ is continuous by step 1.1; with step 1.3 this is claim 2.

step 1.1step 1.2step 1.3
2.2

Let V⊆Z. If V is open in Z then p−1[V] is open in Y by [L2] and [A2], hence q−1[p−1[V]] is open in X by [A1]; by step 1.5 that set is (p∘q)−1[V].

step 1.5A1A2L2
2.3

Conversely, if (p∘q)−1[V] is open in X, then q−1[p−1[V]] is open in X by step 1.5, so p−1[V] is open in Y by [A1], so V is open in Z by [A2].

step 1.5A1A2
3.1

By steps 1.4, 2.2 and 2.3 the map p∘q is a surjection for which V is open in Z exactly when (p∘q)−1[V] is open in X; that is claim 3. With steps 1.1 and 2.1 all three claims are proved.

step 1.1step 1.4step 2.1step 2.2step 2.3A1L4∎

Remarks

  • Claim 2 is how every quotient space in this library is identified. To produce a continuous map out of an identification space one never works with equivalence classes directly: one writes a continuous map on the original space, checks that it does not distinguish identified points, and quotes claim
  1. Both examples of gluing on the companion page are exactly this move.
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

A continuous open surjection, a continuous closed surjection, and a continuous surjection admitting a continuous section are all quotient maps

Statement

Let X and Y be topological spaces and let q:X→Y be continuous (Continuity of a map of topological spaces at a point and globally). Each of the following three conditions makes q a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

  1. q is a surjection and an open map (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
  2. q is a surjection and a closed map.
  3. q admits a continuous section: a continuous s:Y→X with q∘s=idY. (Surjectivity of q is then automatic and need not be assumed.)

Neither clause 1 nor clause 2 is necessary: a quotient map need be neither open nor closed. A witness that is a quotient map by clause 3 while failing clauses 1 and 2 is worked on the companion page, and is named in the remarks below.

Facts & Assumptions

Given: Topological spaces X and Y, a continuous map q:X→Y, a subset V⊆Y, and, where the clause requires it, a continuous s:Y→X with q∘s=idY.

[A1]

q is a quotient map when it is a surjection and, for every V⊆Y, V is open in Y exactly when q−1[V] is open in X (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[A2]

q is an open map when images of open sets are open, and a closed map when images of closed sets are closed (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[L2]

If q is surjective then q[q−1[V]]=V for every V⊆Y; and q−1[Y∖V]=X∖q−1[V] (Injection, surjection, bijection).

[L4]

(u∘v)−1[T]=v−1[u−1[T]] for composable functions (Injection, surjection, bijection).

Proof

technique · direct
1.1

If V is open in Y then q−1[V] is open in X, by continuity of q and [L1]; this half of the quotient condition holds under all three hypotheses.

givenL1
1.2

Assume clause 3 and let y∈Y; then y=q(s(y)), so q is surjective.

given
1.3

Assume clause 1 and that q−1[V] is open in X. Then q[q−1[V]]=V by [L2], and q[q−1[V]] is open in Y by [A2]; so V is open.

givenA2L2
1.4

Assume clause 2 and that q−1[V] is open in X. Then X∖q−1[V]=q−1[Y∖V] by [L2] and is closed by [L3], so q[q−1[Y∖V]]=Y∖V is closed by [A2] and [L2]; hence V is open by [L3].

givenA2L2L3
1.5

Assume clause 3 and that q−1[V] is open in X. Then s−1[q−1[V]]=(q∘s)−1[V]=V by [L4] and q∘s=idY, and s−1[q−1[V]] is open in Y by continuity of s and [L1]; so V is open.

givenL1L4
2.1

Under clause 1 the map q is a surjection by hypothesis and satisfies both halves of the quotient condition, by steps 1.1 and 1.3; so it is a quotient map by [A1].

step 1.1step 1.3A1
2.2

Under clause 2 the same holds by steps 1.1 and 1.4.

step 1.1step 1.4A1
2.3

Under clause 3 the map q is a surjection by step 1.2 and satisfies both halves by steps 1.1 and 1.5.

step 1.1step 1.2step 1.5A1
3.1

Steps 2.1, 2.2 and 2.3 establish the three clauses.

step 2.1step 2.2step 2.3∎

Remarks

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

Every quotient map q:X→Y induces a homeomorphism from X modulo the relation "q agrees" onto Y, so up to homeomorphism the quotient maps out of X are exactly the canonical projections

Statement

Let q:X→Y be a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection) and define a relation on X by

x∼qx′:⟺q(x)=q(x′).

Then ∼q is an equivalence relation, and the induced map

qˉ:X/ ⁣∼q  ⟶  Y,qˉ([x]):=q(x)

is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological), where X/ ⁣∼q carries the quotient topology of its canonical projection π (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Moreover qˉ∘π=q.

So every quotient map out of X is, up to a homeomorphism of its target, the canonical projection of X onto one of its identification spaces: the target of a quotient map carries no information beyond the partition of X into fibres.

Facts & Assumptions

Given: A quotient map q:X→Y, the relation ∼q above, the quotient set Q:=X/ ⁣∼q with its canonical projection π:X→Q and the quotient topology of π, and the map qˉ of the statement.

[A1]

q is a surjection and V⊆Y is open exactly when q−1[V] is open in X; π is a surjection and V⊆Q is open exactly when π−1[V] is open in X; both q and π are continuous (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection, Continuity of a map of topological spaces at a point and globally).

[A2]

Equality is reflexive, symmetric and transitive, and [x]={ x′:q(x′)=q(x) } (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L1]

For a quotient map r and a continuous map f constant on the fibres of r, there is exactly one fˉ with fˉ∘r=f, and it is continuous; and a map out of the target of r is continuous exactly when its composite with r is (For a quotient map q:X→Y, a map out of Y is continuous iff its composite with q is; a continuous map on X constant on the fibres of q factors uniquely through q; and a composite of quotient maps is a quotient map, claims 1 and 2).

[L2]

A homeomorphism is a continuous bijection with continuous inverse; a bijection has a unique two-sided inverse (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, Injection, surjection, bijection).

Proof

technique · direct
1.1

∼q is an equivalence relation, being the relation "q takes the same value", and equality is reflexive, symmetric and transitive.

A2
1.2

q is constant on the fibres of π: if π(x)=π(x′) then x∼qx′, that is q(x)=q(x′).

A2
1.3

π is constant on the fibres of q: if q(x)=q(x′) then x∼qx′, so [x]=[x′] and π(x)=π(x′).

A2
2.1

By step 1.2 and [L1] applied to the quotient map π and the continuous map q, there is exactly one qˉ:Q→Y with qˉ∘π=q, and qˉ is continuous; it satisfies qˉ([x])=q(x).

step 1.2A1L1
2.2

By step 1.3 and [L1] applied to the quotient map q and the continuous map π, there is exactly one πˉ:Y→Q with πˉ∘q=π, and πˉ is continuous.

step 1.3A1L1
3.1

qˉ∘πˉ=idY: composing with the surjection q gives qˉ∘πˉ∘q=qˉ∘π=q=idY∘q, and a surjection may be cancelled on the right.

step 2.1step 2.2A1
3.2

πˉ∘qˉ=idQ: composing with the surjection π gives πˉ∘qˉ∘π=πˉ∘q=π=idQ∘π, and a surjection may be cancelled on the right.

step 2.1step 2.2A1
4.1

By steps 3.1 and 3.2 the maps qˉ and πˉ are mutually inverse bijections, and both are continuous by steps 2.1 and 2.2; so qˉ is a homeomorphism with inverse πˉ, and qˉ∘π=q by step 2.1. With step 1.1 this proves the theorem.

step 1.1step 2.1step 2.2step 3.1step 3.2L2L3∎

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

The adjunction space Y∪fX glued along a continuous map, and, for a nonempty space, the cone and the suspension as quotients of X×[0,1]

Definition

Throughout, [0,1] denotes the closed unit interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with the subspace topology inherited from the usual topology of R (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, 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), and X×[0,1] the binary product with the product topology (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). All three constructions below are quotients (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection) of a space already built on this page, and none of them needs anything further. The one exception is the degenerate case X=∅: then X×[0,1] is empty, so the one-point cone and the two-point suspension stipulated below are not quotients of it, and they are fixed by that stipulation rather than by the construction.

Adjunction space. Let X and Y be topological spaces, let A⊆X carry the subspace topology, and let f:A→Y be continuous (Continuity of a map of topological spaces at a point and globally). Form the disjoint union Y⊔X with its canonical injections κY and κX (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is) and let ∼f be the relation on Y⊔X whose classes are

Cy  :=  {κY(y)}∪{ κX(a):a∈A, f(a)=y }(y∈Y),{κX(x)}(x∈X∖A).

These sets are pairwise disjoint and their union is Y⊔X, since every element of Y⊔X is κY(y) for exactly one y, or κX(x) for exactly one x, and in the latter case lies in Cf(x) when x∈A and in its own singleton otherwise. A family of pairwise disjoint nonempty sets covering a set is the family of classes of exactly one equivalence relation, so ∼f is well defined. The adjunction space is the identification space

Y∪fX  :=  (Y⊔X)/ ⁣∼f

with the quotient topology of its canonical projection. It is said to be obtained by gluing X to Y along f: each point a∈A is identified with its image f(a), and nothing else is identified.

Collapsing a subset. For a space Z and a nonempty B⊆Z, write Z/B for the quotient of Z by the equivalence relation whose classes are B and the singletons {z}, z∉B (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection): all of B becomes one point and nothing else is identified.

Cone. The cone on a space X is

CX  :=  (X×[0,1])/(X×{1}),

the product of X with the unit interval, with the whole top face collapsed to a single point, called the apex. The definition presupposes only that X×{1} is nonempty, which holds exactly when X is nonempty; for X=∅ the product is empty, the quotient of the empty space is empty, and no apex is produced; this library nonetheless takes C∅ to be the one-point space by convention, so that the apex always exists and every cone is nonempty. The convention is a stipulation, not a consequence of the description above, which gives the empty space.

Suspension. The suspension of X is

ΣX  :=  (X×[0,1])/ ⁣∼,

where ∼ has as classes X×{0}, X×{1}, and the singletons {(x,t)} for 0<t<1. So both faces are collapsed, each to its own point, and the two resulting points are distinct as soon as X is nonempty. For X=∅ this library takes Σ∅ to be the two-point discrete space, one apex from each end, matching the convention that a suspension is two cones glued along X; the alternative stipulation of a single point is also in use in the literature, and nothing here depends on the choice.

Mapping cone. For a continuous f:X→Y the mapping cone is the adjunction space Y∪f′CX, where CX is the cone, X is identified with the subspace X×{0} of X×[0,1] and thence with its image in CX, and f′ is the corresponding map into Y. It is recorded here as the standard instance of the two constructions used together, and nothing below depends on it.

What is deliberately not asserted. These constructions produce spaces, and this page proves nothing about which of them are homeomorphic to which. The invariants that separate them, connectedness, compactness and the homotopy notions, are not available for general topological spaces at this point in the reading order: connectedness and compactness are developed here only for subsets of R (Separated sets, disconnection, and connected subset of R) and for metric spaces (Open cover, subcover, compact metric space, and compact subset of a metric space), and neither development applies to a quotient that has not been shown metrizable, while the homotopy notions are absent altogether. So no statement here says that two of these spaces are different, and none says that the cone or the suspension of a familiar space is any particular familiar space.

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not

Definition

A topological space (X,T) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) is Hausdorff when any two distinct points are separated by disjoint open sets: for all x,y∈X with x≠y there are U,V∈T with

x∈U,y∈V,U∩V=∅.

Since an open set containing a point is an open neighbourhood of it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open), the condition reads: distinct points have disjoint open neighbourhoods. Nothing is asserted about points that are equal, and the condition is vacuous for a space with at most one point, so every such space is Hausdorff.

Every metrizable space is Hausdorff. This is not proved here, because it is already discharged: Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not records it among the two things every metrizable space has, deriving it from Distinct points of a metric space have disjoint balls around them, which separates p≠q in a metric space by the disjoint open balls B(p,r) and B(q,r) with r=d(p,q)/2>0. In particular R with its usual topology, every Rn, and every subspace of a metrizable space are Hausdorff.

Not every space is Hausdorff. The indiscrete topology Tind={∅,X} on a set X={a,b} with a≠b (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) is not: the only open set containing a is X, the only one containing b is X, and X∩X=X≠∅. This is the same two-point space that Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not uses to exhibit a topology induced by no metric, and the reason is the same one: failure of the Hausdorff condition is an obstruction to metrizability.

Being Hausdorff is a topological property (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological). If h:X→Z is a homeomorphism and X is Hausdorff, then for z≠z′ in Z the points h−1(z) and h−1(z′) are distinct, so they have disjoint open U,V; the images h[U] and h[V] are open, disjoint, and contain z and z′ respectively, a homeomorphism carrying the open sets of one space bijectively onto those of the other. So no space homeomorphic to a Hausdorff space fails the condition.

Scope of this item. Only the definition, the metrizable case and the two-point failure are recorded here, because that is all this page uses. The Hausdorff condition is one of a graded family of separation axioms; that family, its ordering, and the questions of which of its members are hereditary or preserved by products, are not available at this point in the reading order and nothing here anticipates them. What this page does use is a single negative result: a quotient of a Hausdorff space need not be Hausdorff, which is recorded below as a false statement and witnessed on the companion page.

Remarks

  • Hausdorff spaces have closed singletons. Fix x∈X and take the union of all open subsets of X that avoid x. Every y≠x belongs to one of them, by Hausdorff separation of x and y, while x belongs to none. The union is therefore exactly X∖{x}, so {x} is closed. Thus the Hausdorff property implies the singleton-closed (T1) property. The converse fails: closed singletons need not give disjoint neighbourhoods of distinct points.

  • What the Hausdorff condition buys, in the one place this page needs it. Separation of distinct points by disjoint open sets is exactly what a quotient map can destroy: identifying points of a Hausdorff space can leave two classes every pair of whose open neighbourhoods meet, and the companion page exhibits such a quotient of a metrizable space. Nothing weaker than an explicit witness settles that, since the condition is a statement about all pairs of open sets.

  • The name. Hausdorff's own 1914 axiom system for a topological space included this condition, so "topological space" once meant what is now called a Hausdorff space; this library follows the modern convention in which Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison assumes no separation at all and every separation hypothesis is stated where it is used.

RemarkRemark: AI-generatedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

What the theory of these constructions still owes at this point in the reading order: preservation of quotient maps under products, separation beyond Hausdorff, and the invariants that tell the glued spaces apart

This page builds three constructions, the product, the coproduct and the quotient, proves the characteristic property of each, and develops further the subspace topology introduced earlier in the reading order. Four questions that a reader will ask immediately are deliberately left open, and this remark records which they are and why. Each is a question whose answer needs vocabulary that is not available at this point in the reading order; none of them is a defect of the constructions.

1. Is a product of quotient maps a quotient map? If q:X→Y and q′:X′→Y′ are quotient maps (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection), is the map q×q′:X×X′→Y×Y′ (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) a quotient map? It is a continuous surjection, and it is a quotient map when both q and q′ are open: the image of a basic open box U×U′ under q×q′ is q[U]×q′[U′] (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), so q×q′ is then an open continuous surjection, and an open continuous surjection is a quotient map (A continuous open surjection, a continuous closed surjection, and a continuous surjection admitting a continuous section are all quotient maps, clause 1). That both factors are open is not a convenience of the argument: one of the two being open is not enough, and the standard counterexample is of exactly that shape, its second factor being an identity map, which is open. In general, then, the answer is no, and neither the standard counterexample nor the standard positive theorem is stated here. The positive theorem takes the form "if q is a quotient map and Z is suitably small, then q×idZ is a quotient map", and the smallness condition it needs is a compactness condition, which is later in the reading order. The counterexample that shows some such condition is necessary is a nested construction over an enumeration of Q, out of proportion to what this page uses; nothing on this page or its companion depends on either.

2. Separation beyond the Hausdorff condition. Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not is introduced here in its minimal form and for one purpose only: to state and refute the claim that a quotient of a Hausdorff space is Hausdorff. The Hausdorff condition is the second of a graded family of separation conditions, and the questions that family raises, in particular which of its members are hereditary in the sense of Hereditary, open-hereditary and closed-hereditary properties of topological spaces and which are preserved by products, are not available at this point in the reading order. No statement on this page anticipates any of them, and in particular nothing here asserts or denies that any separation condition other than the Hausdorff one is hereditary.

3. The invariants that would distinguish the glued spaces. The adjunction space Y∪fX glued along a continuous map, and, for a nonempty space, the cone and the suspension as quotients of X×[0,1] builds the adjunction space, the cone and the suspension, and the companion page builds R/Z, the torus, the cylinder and the Mobius band as quotients of an interval or a square. These are constructions, not classifications. Deciding that two of them are not homeomorphic requires an invariant, and the standard invariants for these particular spaces are connectedness, compactness and the homotopy notions. None of the three is available here in the form the question needs: connectedness and compactness are developed earlier in the reading order only for subsets of R and for metric spaces, neither of which covers a quotient that has not been shown metrizable, and the homotopy notions are developed only later in the reading order. Accordingly no item on this page or its companion claims that two of these spaces differ; where two constructions are shown to agree, an explicit homeomorphism is exhibited.

4. Metrizability of a product. Every subspace of a metrizable space is metrizable and every subspace of a first countable space is first countable, the metric case being the subspace metric already identified with the subspace topology shows that metrizability passes to subspaces. Whether it passes to products is a different question, and this page answers it only in named instances, never in general: 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 metrises the product of n copies of R, and the companion page metrises the Hilbert cube [0,1]N by the explicit ∑k∣xk−yk∣/2 k+1, while its identification of {0,1}N with the Cantor set metrises that product too, as a by-product of a homeomorphism rather than as an aim. No general theorem about products of metrizable spaces is stated here, in any number of factors, and the reader should not read any of these instances as more than the single instance it is.

One thing that is settled, and is worth separating from the four above. The coproduct raises no such question: a disjoint union of spaces is described completely by its traces (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is), maps out of it are described completely by their restrictions (A map out of a disjoint union is continuous iff each of its restrictions is; the canonical injections are open and closed embeddings; and each summand is clopen in the union), and every summand sits inside it as a clopen subspace. Everything a reader might want to know about the coproduct at this point is proved on this page.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: the product topology and the box topology agree on every product

Statement

False claim: for every family of topological spaces (Xi)i∈I the product topology and the box topology on ∏i∈IXi are the same topology (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).

The claim is correct for a finite index set. It fails when the index set is infinite and the factors have enough open sets, under the hypotheses of claim 3 of The box topology is finer than the product topology, the two agree for a finite index set in ZF, and, assuming the Axiom of Choice for nonempty factors, the box topology is strictly finer whenever infinitely many factors have a nonempty proper open subset, which assumes the Axiom of Choice (The Axiom of Choice); the witness written out below needs no choice principle at all. The refutation below writes down the standard witness explicitly, in RN=∏k∈NR with every factor carrying the usual topology (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): the shrinking box

B  :=  ∏k∈N(−1k+1, 1k+1)

is open in the box topology and is not open in the product topology. No choice principle is used, the factors of B being given by a formula.

Facts & Assumptions

Given: The index set N, the product P:=∏k∈NR with each factor carrying the usual topology, the box B of the statement, and the point z∈P with zk=0 for every k. Here 1/(k+1) abbreviates 1/ι(k+1), the inverse of the canonical natural (The canonical natural ι(n)=n⋅1F of a field).

[L1]

ι(k+1)≥1>0 for every k∈N, and ι is strictly increasing, hence injective (Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field).

[L2]

If 0<u≤v then 0<1/v≤1/u (Inverses of positives are positive, and reciprocation reverses order).

[L3]

For every natural n≥1 and reals a0,…,an−1 the set {a0,…,an−1} has a maximum (Every nonempty finite set of reals has a maximum and a minimum).

[L4]

If U belongs to a topology and x∈U, then U is open; and a topology is a family of subsets of the underlying set (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Refutation

technique · direct
1.1

For every k∈N: 1/(k+1)>0 by [L1] and [L2], so 0∈(−1/(k+1), 1/(k+1)) by [A2]; hence z∈B.

A2L1L2
1.2

For every k∈N: 1/(k+1)≤1, since 1≤ι(k+1) by [L1] and [L2] applied with u=1 and v=ι(k+1).

L1L2
1.3

Each factor (−1/(k+1), 1/(k+1)) is open in the usual topology of R, being a bounded open interval, so B is a box with open factors and hence open in the box topology.

A1A2
1.4

Suppose B were open in the product topology. Then by [A1] there is a basic product-open O=∏kOk with z∈O⊆B, and Ok=R for every k outside a list j0,…,jn−1 with n∈N.

A1L4assume-hyp
2.1

There is j∈N with Oj=R: if n=0 the list is empty and j:=0 serves; if n≥1 then by [L3] the set {ι(j0),…,ι(jn−1)} has a maximum, attained at some index m0<n, and j:=jm0+1 satisfies ι(j)>ι(jm) for every m<n by [L1], hence j≠jm for every m<n.

step 1.4L1L3
3.1

Let y∈P be the point with yj:=1 and yk:=zk=0 for k≠j. Then y∈O, since yj=1∈R=Oj and yk=zk∈Ok for k≠j.

step 1.4step 2.1
4.1

y∉B: by step 1.2 one has 1/(j+1)≤1=yj, so yj∉(−1/(j+1), 1/(j+1)) by [A2].

step 1.2step 3.1A2
5.1

Steps 3.1 and 4.1 contradict O⊆B from step 1.4, so B is not open in the product topology; by step 1.3 it is open in the box topology, so the two topologies on P are different and the claim is false.

step 1.3step 1.4step 3.1step 4.1∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: ∏iUi is open in the product topology whenever every Ui is open

Statement

False claim: if Ui is open in Xi for every i∈I, then ∏i∈IUi is open in ∏i∈IXi with the product topology (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).

What is true is the version with a restriction on how many factors may be cut down: ∏iUi is open in the product topology when every Ui is open and Ui=Xi for all but finitely many i, those being exactly the basic product-open sets (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, Basis and subbasis for a topology, and the topology generated by a family of sets). The unrestricted claim is the definition of the box topology, which is finer, and is strictly finer under the hypotheses of claim 3 of The box topology is finer than the product topology, the two agree for a finite index set in ZF, and, assuming the Axiom of Choice for nonempty factors, the box topology is strictly finer whenever infinitely many factors have a nonempty proper open subset, which assumes the Axiom of Choice (The Axiom of Choice); the witness written out below exhibits the strictness in RN with no choice principle at all.

The refutation uses RN=∏k∈NR with the usual topology on each factor (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) and the single open set Uk:=(0,1) in every factor: ∏k(0,1) is not open in the product topology, although (0,1) is open in R.

Facts & Assumptions

Given: The product P:=∏k∈NR with the product topology, the set C:=∏k∈N(0,1)⊆P, and the point c∈P with ck=1/2 for every k, where 1/2 is the inverse of ι(2) (The canonical natural ι(n)=n⋅1F of a field).

[L1]

0<1, so 1<1+1=2 (The multiplicative identity is positive).

[L3]

For every natural n≥1 and reals a0,…,an−1 the set {a0,…,an−1} has a maximum (Every nonempty finite set of reals has a maximum and a minimum).

[L4]

A topology is a family of subsets of the underlying set, and every member of a basis of it is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Refutation

technique · direct
1.1

c∈C, since ck=1/2∈(0,1) for every k by [A2].

A2
1.2

2∉(0,1), since 1<2 by [L1] and membership of (0,1) requires t<1 by [A2].

A2L1
1.3

Suppose C were open in the product topology. Then by [A1] there is a basic product-open O=∏kOk with c∈O⊆C, and Ok=R for every k outside a list j0,…,jn−1 with n∈N.

A1L4assume-hyp
2.1

There is j∈N with Oj=R: for n=0 the list is empty and j:=0 serves; for n≥1 the set {ι(j0),…,ι(jn−1)} has a maximum by [L3], attained at some m0<n, and j:=jm0+1 satisfies ι(j)>ι(jm), hence j≠jm, for every m<n by [L2].

step 1.3L2L3
3.1

Let y∈P be the point with yj:=2 and yk:=ck=1/2 for k≠j. Then y∈O, since yj∈R=Oj and yk=ck∈Ok for k≠j, using c∈O.

step 1.3step 2.1
4.1

y∉C, since yj=2∉(0,1) by step 1.2.

step 1.2step 3.1
5.1

Steps 3.1 and 4.1 contradict O⊆C from step 1.3, so C is not open in the product topology although every factor (0,1) is open in R; the claim is therefore false.

step 1.1step 1.3step 3.1step 4.1∎

Remarks

  • The correct statement, and why the finiteness is there. The basic open sets of a product are the finite intersections of the sets πi−1[U], and each of those constrains one coordinate only; a finite intersection therefore constrains finitely many coordinates. Constraining all of them at once, as C does, is a box, and a box need not be a union of such finite intersections.

  • Nothing is wrong with ∏k(0,1) as a set or as a space. It is a perfectly good subspace of RN, and by claim 1 of Products commute with subspaces; for infinite nonempty families, the closure identity ∏Ai‾=∏Ai‾ uses the Axiom of Choice its subspace topology is the product of the subspace topologies of the factors. What fails is only that it is not an open subset of the ambient product.

  • The same computation with shrinking intervals gives the sharper failure. Replacing (0,1) by (−1/(k+1), 1/(k+1)) produces a box whose only product-interior point would have to have all but finitely many coordinates unrestricted, and that box separates the two topologies outright; that is the false statement immediately before this one.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: the projections of a product are closed maps

Statement

False claim: every projection πj:∏iXi→Xj of a product with the product topology is a closed map, that is, carries closed subsets of the product to closed subsets of Xj (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, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

What is true is the corresponding statement for open sets: every projection is an open map (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, claim 3). The claim above fails already for the binary product R2=R×R, whose product topology is the usual one (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). The witness is the hyperbola

H  :=  { (x,y)∈R2:xy=1 },

which is closed in R2 while π0[H]=R∖{0} is not closed in R.

Facts & Assumptions

Given: R2=∏k<2R with the product topology, the first projection π0(x,y)=x, and the set H of the statement.

[A1]

The product topology on R2 is the metric topology of d∞((x,y),(x′,y′))=max⁡{∣x−x′∣, ∣y−y′∣}, so R2 is metrizable (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).

[L1]

The multiplication map m:R2→R, m(x,y):=xy, is continuous. Indeed, at (a,b) and for ε>0, put δ:=min⁡{1, ε∣a∣+∣b∣+1}>0. If d∞((x,y),(a,b))<δ, then ∣x∣<∣a∣+1 and ∣xy−ab∣≤∣x∣ ∣y−b∣+∣b∣ ∣x−a∣<(∣a∣+∣b∣+1)δ≤ε. The bound uses xy−ab=x(y−b)+b(x−a), the triangle inequality ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality) and ∣uv∣=∣u∣ ∣v∣ (Basic properties of the absolute value). This is the metric definition of continuity (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Inverses of positives are positive, and reciprocation reverses order, Maximum and minimum of a set).

[L2]

The singleton {1} is closed in R: if t≠1, the open interval of radius ∣t−1∣/2 about t avoids 1. A continuous map of metric spaces has closed preimages of closed sets (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, Metric continuity characterisations, with countable choice for the sequential converse, clause (c)).

[L3]

U⊆R is open in the usual topology exactly when every point of U has a bounded open interval around it inside U; (a,b)={t:a<t<b} (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).

Refutation

technique · direct
1.1

Since H=m−1[{1}], [L1] and [L2] show that H is closed in R2.

A1L1L2
1.2

For x≠0 the point (x,1/x) lies in H, since x⋅(1/x)=1; and (0,y)∉H for every y, since 0⋅y=0≠1. So π0[H]=R∖{0}.

given
1.3

R∖{0} is not closed in R: its complement {0} is not open, because for every r>0 the interval (−r,r) contains r/2, which is nonzero and hence outside {0}.

L3
2.1

By step 1.1 the set H is closed in R2, while by steps 1.2 and 1.3 its image π0[H]=R∖{0} is not closed in R; so π0 is not a closed map by [A2] and the claim is false.

step 1.1step 1.2step 1.3A2∎

Remarks

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

FALSE: every quotient map is an open map

Statement

False claim: every quotient map q:X→Y (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection) is an open map, that is, carries open subsets of X to open subsets of Y (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

The converse implication is the one that holds: a continuous open surjection is a quotient map (A continuous open surjection, a continuous closed surjection, and a continuous surjection admitting a continuous section are all quotient maps, clause 1). The claim above fails for the cheapest identification there is, collapsing a closed interval of R to a point. Take X:=R with its usual topology (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), B:=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length), and let

q:R→R/B

be the canonical projection of the quotient that identifies all of B to one point and identifies nothing else (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Then q is a quotient map by construction, and q[(−1, 1/2)] is not open.

Facts & Assumptions

Given: R with its usual topology; B=[0,1]; the equivalence relation on R whose classes are B and the singletons {t} for t∉B; the quotient R/B with the quotient topology and its canonical projection q; and the set U:=(−1, 1/2).

[A1]

q is a surjection, the topology of R/B is the quotient topology of q, and consequently V⊆R/B is open exactly when q−1[V] is open in R; so q is a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[A2]

A⊆R is saturated for q exactly when A∩B is ∅ or B, and q−1[q[A]] is the saturation of A (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L1]

Refutation

technique · direct
1.1

U=(−1, 1/2) is open in R, being a bounded open interval.

L1
1.2

U∩B=[0, 1/2), which is neither ∅, since it contains 0, nor B, since 1∈B and 1∉[0,1/2); so U is not saturated.

A2L1
1.3

(−1, 1] is not open in R: for every r>0 the interval (1−r, 1+r) contains 1+r/2, which satisfies 1+r/2>1 and so lies outside (−1,1]; hence no bounded open interval around 1 lies inside (−1,1].

L1
2.1

q−1[q[U]]=U∪B=(−1, 1]: the saturation of U adds to U exactly the class of each of its points, and the only non-singleton class meeting U is B itself, by step 1.2.

step 1.2A2L1
3.1

By step 2.1 and step 1.3 the set q−1[q[U]] is not open in R, so q[U] is not open in R/B by [A1].

step 2.1step 1.3A1L3
4.1

By [A1] the map q is a quotient map, and by step 1.1 and step 3.1 it carries the open set U to a set that is not open; so q is not an open map by [A3], and the claim is false.

step 1.1step 3.1A1A3L2∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

FALSE: a quotient of a Hausdorff space is Hausdorff

Statement

False claim: if X is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and q:X→Y is a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection), then Y is Hausdorff.

The refutation is the line with two origins. Let

S  :=  R⊔R  =  ⨆i<2R

be the disjoint union of two copies of R with its usual topology (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is, 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), whose points are the pairs (x,i) with x∈R and i<2. Let ∼ be the equivalence relation on S whose classes are

{(x,0),(x,1)}  (x≠0),{(0,0)},{(0,1)},

and let L:=S/ ⁣∼ with the quotient topology and canonical projection q. Then S is Hausdorff and L is not: the two classes q(0,0) and q(0,1), the "two origins", cannot be separated by disjoint open sets.

Facts & Assumptions

Given: The space S=⨆i<2R with the disjoint union topology, the relation ∼ above, the quotient L=S/ ⁣∼ with its canonical projection q, and the two points a:=q(0,0) and b:=q(0,1) of L.

[A1]

U⊆S is open exactly when both traces Ui={ x∈R:(x,i)∈U } are open in R; each set R×{i} is open in S; and κi[V]=V×{i} is open in S whenever V is open in R (The disjoint union (coproduct) ⨆iXi with the final topology of the canonical injections: a set is open exactly when each of its traces is, A map out of a disjoint union is continuous iff each of its restrictions is; the canonical injections are open and closed embeddings; and each summand is clopen in the union).

[A2]

The classes listed in the statement are pairwise disjoint and cover S, so ∼ is an equivalence relation; q is a surjection and V⊆L is open exactly when q−1[V] is open in S (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L2]

The order of R is total, so a two-element set of reals has a minimum, which lies in the set and is a lower bound for it (Maximum and minimum of a set); ∣s∣≥0, and ∣s∣>0 when s≠0 (Basic properties of the absolute value); and ∣s−u∣≤∣s−t∣+∣t−u∣ (The triangle inequality).

Refutation

technique · direct
1.1

S is Hausdorff. Let (x,i)≠(y,j) in S. If i≠j then R×{i} and R×{j} are disjoint open sets containing them, by [A1]. If i=j then x≠y; put r:=∣x−y∣/2>0 by [L2], and take (x−r,x+r)×{i} and (y−r,y+r)×{i}, which are open by [A1] and [L1] and are disjoint, since a common point t would give ∣x−y∣≤∣x−t∣+∣t−y∣<2r=∣x−y∣.

A1A3L1L2
1.2

a≠b: the classes {(0,0)} and {(0,1)} are distinct members of the partition in [A2], and q sends (0,i) to the class of (0,i).

A2
1.3

For t≠0 one has q(t,0)=q(t,1), the two points lying in the common class {(t,0),(t,1)}.

A2
2.1

Suppose U,V⊆L are open with a∈U, b∈V and U∩V=∅. Then q−1[U] and q−1[V] are open in S by [A2], with (0,0)∈q−1[U] and (0,1)∈q−1[V].

step 1.2A2assume-hyp
3.1

By [A1] the trace of q−1[U] at index 0 is an open subset of R containing 0, so by [L1] there is ε>0 with (−ε,ε)×{0}⊆q−1[U]; likewise there is δ>0 with (−δ,δ)×{1}⊆q−1[V].

step 2.1A1L1
4.1

Put t:=min⁡{ε,δ}/2. Then 0<t<ε and t<δ by [L1] and [L2], so t≠0, (t,0)∈q−1[U] and (t,1)∈q−1[V].

step 3.1L1L2
5.1

By step 1.3 and step 4.1 the point q(t,0)=q(t,1) lies in U and in V, contradicting U∩V=∅. So no such U and V exist.

step 1.3step 2.1step 4.1
6.1

By step 1.1 the space S is Hausdorff, by [A2] the map q is a quotient map, and by steps 1.2 and 5.1 the two distinct points a and b of L have no disjoint open neighbourhoods, so L is not Hausdorff by [A3]. The claim is therefore false.

step 1.1step 1.2step 5.1A2A3∎

Remarks

Sources