Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck 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, normality is not productive: the normal lower-limit line has a nonnormal square

Statement

Assuming the Axiom of Choice, the lower-limit line is normal but its square is not normal. Hence normality is not productive, even for a product of two factors.

Facts & Assumptions

Given: The Axiom of Choice and the lower-limit line L.

[A1]

The Axiom of Choice supplies a choice function for every family of nonempty sets, hence for every countably indexed family, which is the Axiom of Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

Under the Axiom of Countable Choice, the lower-limit line is normal (Assuming countable choice, the lower-limit line is normal).

[L1]

Jones's lemma injects P(D) into P(E) when a normal space has closed discrete D and dense E (Jones's bound: under choice, a closed discrete subspace of a normal space cannot have more subsets than a dense set has subsets).

[L2]

The plane L2 has E=Q2 at most countable and D={(x,−x):x∈R} closed discrete with D≈R (The lower-limit plane has a countable dense set and a closed discrete antidiagonal of size ∣R∣).

[L3]

Cantor's theorem gives no injection P(P(N))→P(N), and Schröder-Bernstein turns injections both ways into a bijection (Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ, The Schröder-Bernstein theorem).

[L4]

The ternary Cantor-set coding injects P(N) into R, while x↦{q∈Q:q<x} injects R into P(Q); a rational between distinct reals makes the latter map injective, and Q≈N (The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N, ℚ is dense in every Archimedean ordered field, Q is countably infinite).

Proof

technique · contradiction
1.1

By [A1] and [F1], L is normal. Suppose, for a contradiction, that L2 is normal.

A1F1assume-contra
1.2

Jones's lemma applied to the D,E of [L2] injects P(D) into P(E).

L1L2
1.3

The two injections of [L4], with the fixed bijection Q≈N, give R≈P(N) by Schröder-Bernstein. Therefore D≈P(N), while E⪯N.

L2L3L4
2.1

Taking direct images under these injections turns step 1.2 into an injection P(P(N))→P(N).

step 1.2step 1.3
3.1

This contradicts Cantor's theorem in [L3]. Therefore L2 is not normal, while L is normal, proving nonproductivity.

L3step 1.1step 2.1discharge-contradiction∎

Depends on

Used by

Dependency tree · two levels

71 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