Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 choice and countable choice, refuted: arbitrary products of second countable spaces are second countable

Statement

Assuming choice and countable choice, arbitrary products of second countable spaces are second countable.

Facts & Assumptions

Given: Choice, countable choice, and an index set I with ∣I∣>2ℵ0.

[L2]

The Cantor cube 2I is not separable when ∣I∣>2ℵ0 (Under choice, if ∣I∣>2ℵ0, then the Cantor cube 2I is not separable).

[L3]

Assuming countable choice, every second countable space is separable (Assuming countable choice, every second countable space is separable).

Refutation

technique · direct
1.1

For each i∈I, let Xi={0,1} with the discrete topology; each Xi is second countable.

L1
1.2

Their product is the Cantor cube 2I by [L1].

L1
2.1

The product 2I is not separable by [L2].

step 1.2L2
3.1

If 2I were second countable, [L3] would make it separable, contradicting step 2.1; hence this product of second countable spaces is not second countable.

step 2.1L3
4.1

This family of factors refutes the claimed arbitrary-product principle.

step 1.1step 3.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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