Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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)iI(X_i, \mathcal{T}_i)_{i \in I} be topological spaces, let P:=iIXiP := \prod_{i \in I} X_i, and let TΠ\mathcal{T}^{\Pi} and T\mathcal{T}^{\square} be the product and the box topology on PP (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Then:

  1. TΠT\mathcal{T}^{\Pi} \subseteq \mathcal{T}^{\square}: 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 II is a natural number then TΠ=T\mathcal{T}^{\Pi} = \mathcal{T}^{\square}; this is a theorem of ZF.
  3. Assume the Axiom of Choice. Suppose every XiX_i is nonempty and let J  :=  {iI:Xi has an open subset U with UXi}.J \;:=\; \{\, i \in I : X_i \text{ has an open subset } U \text{ with } \varnothing \ne U \ne X_i \,\} . If JJ is not finite then TΠT\mathcal{T}^{\Pi} \subsetneq \mathcal{T}^{\square}: 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 PP and once to select an open set together with a point of it in each factor indexed by JJ; 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 \varnothing 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)iI(X_i,\mathcal{T}_i)_{i \in I}, the product set P=iIXiP = \prod_{i \in I} X_i with its two topologies, and the set JJ of the statement.

[A1]

A basis for TΠ\mathcal{T}^{\Pi} is the family RΠ\mathcal{R}^{\Pi} of boxes iUi\prod_i U_i with every UiU_i open and Ui=XiU_i = X_i for all but finitely many ii; a basis for T\mathcal{T}^{\square} is the family R\mathcal{R} of all boxes iUi\prod_i U_i with every UiU_i open (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[A2]

A basic product-open set is an intersection of finitely many sets πi1[U]\pi_{i}^{-1}[U], so its exceptional index set {i:UiXi}\{\, i : U_i \ne X_i \,\} is contained in a set listed as {i0,,in1}\{i_0, \dots, i_{n-1}\} for some natural nn (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, 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).

[L1]

If B1B2\mathcal{B}_1 \subseteq \mathcal{B}_2 are bases for topologies T1\mathcal{T}_1 and T2\mathcal{T}_2 on the same set, then T1T2\mathcal{T}_1 \subseteq \mathcal{T}_2, every member of T1\mathcal{T}_1 being a union of members of B1B2T2\mathcal{B}_1 \subseteq \mathcal{B}_2 \subseteq \mathcal{T}_2 (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\mathcal{R}^{\Pi} \subseteq \mathcal{R}, a box with all but finitely many factors equal to XiX_i being in particular a box.

A1
1.2

If II is a natural number nn then RRΠ\mathcal{R} \subseteq \mathcal{R}^{\Pi}, since the exceptional index set of any box is a subset of nn and hence finite by [L2], so every box is basic product-open.

A1L2
1.3

Assume every XiX_i is nonempty and JJ is not finite. For iJi \in J let Ai:={(U,u):UTi, uU, UXi}\mathcal{A}_i := \{\, (U,u) : U \in \mathcal{T}_i,\ u \in U,\ U \ne X_i \,\}; each Ai\mathcal{A}_i is nonempty, since JJ supplies an open UU with UXi\varnothing \ne U \ne X_i and UU nonempty supplies a uUu \in U.

givenL3
2.1

By [L3] applied to (Ai)iJ(\mathcal{A}_i)_{i \in J} there are (Ui,ui)Ai(U_i, u_i) \in \mathcal{A}_i for every iJi \in J; and by [L3] applied to (Xi)iI(X_i)_{i \in I} there is a point pPp \in 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 xPx \in P by xi:=uix_i := u_i for iJi \in J and xi:=pix_i := p_i for iJi \notin J, and put B:=iViB := \prod_i V_i with Vi:=UiV_i := U_i for iJi \in J and Vi:=XiV_i := X_i otherwise. Then BRTB \in \mathcal{R} \subseteq \mathcal{T}^{\square} and xBx \in B.

step 2.1A1
4.1

Suppose BB were in TΠ\mathcal{T}^{\Pi}. Then by [A1] there is a basic product-open O=iOiO = \prod_i O_i with xOBx \in O \subseteq B, and by [A2] its exceptional index set is contained in {i0,,in1}\{i_0, \dots, i_{n-1}\} for some natural nn.

step 3.1A1A2assume-hyp
5.1

The set JJ is not contained in {i0,,in1}\{i_0, \dots, i_{n-1}\}: otherwise JJ would be a subset of a finite set and hence finite by [L2], contrary to the hypothesis of step 1.3. So there is jJj \in J with Oj=XjO_j = X_j.

step 1.3step 4.1L2
6.1

For jj as in step 5.1 and any tXjt \in X_j, the point yy with yj:=ty_j := t and yi:=xiy_i := x_i for iji \ne j lies in OO, since xOx \in O and Oj=XjO_j = X_j; hence yBy \in B and t=yjVj=Ujt = y_j \in V_j = U_j. So XjUjX_j \subseteq U_j, contradicting UjXjU_j \ne X_j from step 2.1.

step 2.1step 3.1step 4.1step 5.1
7.1

Therefore BTΠB \notin \mathcal{T}^{\Pi} while BTB \in \mathcal{T}^{\square}, 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 59 results over 25 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources