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.

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

Depends on

Used by

Dependency tree · two levels

23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources