Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

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.1givenA2

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.

1.2A1A2

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.

1.3givenL4

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

1.4givenL2L3L4

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‾.

1.5L5choose

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

1.6A1L4

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.

2.1step 1.1step 1.2A1A2L1

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.

2.2step 1.5step 1.6L5choose

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.

3.1step 1.4step 2.2L4

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.

4.1step 1.3step 2.1step 3.1L4∎

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.

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.

Depends on

Dependency tree · 2 levels

Sources