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

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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 LL.

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

[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)\mathcal P(D) into P(E)\mathcal P(E) when a normal space has closed discrete DD and dense EE (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 L2L^2 has E=Q2E=\mathbb Q^2 at most countable and D={(x,x):xR}D=\{(x,-x):x\in\mathbb R\} closed discrete with DRD\approx\mathbb R (The lower-limit plane has a countable dense set and a closed discrete antidiagonal of size R|\mathbb{R}|).

[L3]

Cantor's theorem gives no injection P(P(N))P(N)\mathcal P(\mathcal P(\mathbb N))\to\mathcal P(\mathbb N), and Schröder-Bernstein turns injections both ways into a bijection (Assuming the Axiom of Choice, 2κ=P(κ)2^{\kappa} = \lvert \mathcal{P}(\kappa) \rvert, and Cantor's theorem in cardinal form: κ<2κ\kappa < 2^{\kappa}, The Schröder-Bernstein theorem).

[L4]

The ternary Cantor-set coding injects P(N)\mathcal P(\mathbb N) into R\mathbb R, while x{qQ:q<x}x\mapsto\{q\in\mathbb Q:q<x\} injects R\mathbb R into P(Q)\mathcal P(\mathbb Q); a rational between distinct reals makes the latter map injective, and QN\mathbb Q\approx\mathbb N (The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}, ℚ is dense in every Archimedean ordered field, Q\mathbb{Q} is countably infinite).

Proof

technique · contradiction
1.1

By [A1] and [F1], LL is normal. Suppose, for a contradiction, that L2L^2 is normal.

A1F1assume-contra
1.2

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

L1L2
1.3

The two injections of [L4], with the fixed bijection QN\mathbb Q\approx\mathbb N, give RP(N)\mathbb R\approx\mathcal P(\mathbb N) by Schröder-Bernstein. Therefore DP(N)D\approx\mathcal P(\mathbb N), while ENE\preceq\mathbb N.

L2L3L4
2.1

Taking direct images under these injections turns step 1.2 into an injection P(P(N))P(N)\mathcal P(\mathcal P(\mathbb N))\to\mathcal P(\mathbb N).

step 1.2step 1.3
3.1

This contradicts Cantor's theorem in [L3]. Therefore L2L^2 is not normal, while LL is normal, proving nonproductivity.

L3step 1.1step 2.1discharge-contradiction

Depends on

Used by

Dependency tree · next 3 levels

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