Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Assuming countable choice, a countable product of first countable spaces is first countable

Statement

Assuming ACω\mathrm{AC}_\omega, a countable product of first countable spaces is first countable.

Facts & Assumptions

Given: A point in a countable product of first countable spaces.

[A1]

Countable choice selects a countable local base in every coordinate (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L1]

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 ACω\mathrm{AC}_\omega).

Proof

technique · constructive
1.1

Choose the coordinate local bases by [A1].

A1construct
2.1

Finite-support products of their members form a local base at the given point: refine each of the finitely many restricted coordinates of a basic product neighbourhood by a member of its selected local base.

step 1.1F1
3.1

Finite subsets of the countable index set are countable in total: code the subsets of size at most nn by nn-tuples and use finite induction on the product theorem in [L1], followed by the countable-union theorem. For each fixed finite support, the possible coordinate choices are a finite product of countable local bases and hence countable. The union over all finite supports is countable by [L1].

step 2.1L1
4.1

The product is first countable.

step 3.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 63 results over 20 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