Alphabeta MathHow 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.
Assuming countable choice, a countable product of second countable spaces is second countable
Statement
Assuming , a countable product of second countable spaces is second countable.
Facts & Assumptions
Given: Second countable factors indexed by a countable set.
Countable choice selects a countable basis in each factor (The Axiom of Countable Choice ()).
A product of two at most countable sets is at most countable, and under countable choice a countable union of at most countable sets is at most countable (A product of two at most countable sets is at most countable, Countable unions of at most countable sets, assuming ).
Finite-support boxes whose nontrivial coordinates are basis members form a basis for the product topology (The product set 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, Second countability: an at most countable basis for the topology).
Proof
Use [A1] to choose countable factor bases.
Finite-support boxes with selected basic coordinates form a basis for the product by [F1].
The finite subsets of a countable index set form an at most countable family: after enumerating the index set, subsets of size at most are coded by -tuples of natural numbers, which are countable by finite induction using the product theorem in [L1], and their union over is countable by the union theorem in [L1]. For each fixed finite support , the choices of one member of the selected basis in every coordinate of form a finite product of countable sets and are countable by the same induction. A final application of the countable-union theorem shows that all finite-support boxes form an at most countable family.
Thus the product is second countable.
Depends on
- Second countability: an at most countable basis for the topology
- The product set $\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 product of two at most countable sets is at most countable
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Under the Axiom of Countable Choice, countable products and G_δ subspaces of Polish spaces are Polish Corollary
- A projection with finite-dimensional kernel is Fredholm Example
- A regular level set in a Banach space Example
- Implication, preservation, counterexample, and choice ledger for the countability axioms Remark
- The Borel product of Rᵐ and Rⁿ is the Borel sigma-algebra of Rᵐ⁺ⁿ Theorem
Dependency tree · two levels
20 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
- UCR General Topology Notes (standard reference, not scraped)
- Second-countable space (Wikipedia) (standard reference, not scraped)