Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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, refuted: Lindelöfness is productive

Statement

Assuming countable choice, products of Lindelöf spaces are Lindelöf.

Facts & Assumptions

Given: The lower-limit line SS, with basis [a,b)[a,b) for a<ba<b, and its product S2S^2.

[L2]

The rationals are at most countable and dense in the real line, the real line is uncountable, and a set injecting into an at most countable set is at most countable (Q\mathbb{Q} is countably infinite, The rationals embed densely in the reals, R\mathbb{R} is uncountable (Cantor's nested intervals, 1874), A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}).

[A1]

Countable choice selects from every nonempty family indexed by an at most countable set (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

Refutation

technique · direct
1.1

For an open cover U\mathcal U of SS, let D\mathcal D be all basic intervals [a,b)[a,b) lying in members of U\mathcal U, and put C={(a,b):[a,b)D}C=\bigcup\{(a,b):[a,b)\in\mathcal D\}. For every rational pair p<qp<q for which (p,q)(a,b)(p,q)\subseteq(a,b) for some [a,b)D[a,b)\in\mathcal D, use [A1] to select one such member of D\mathcal D. The selected family is at most countable and covers CC: every point of an interval (a,b)(a,b) lies in some rational interval (p,q)(a,b)(p,q)\subseteq(a,b).

L1L2A1
1.2

The antidiagonal A={(x,x):xR}A=\{(x,-x):x\in\mathbb R\} is uncountable and discrete in S2S^2, because [x,x+1)×[x,x+1)[x,x+1)\times[-x,-x+1) meets AA only in (x,x)(x,-x).

L1L2
1.3

The antidiagonal is closed: a point (u,v)(u,v) with u+v0u+v\ne0 has a basic rectangle avoiding AA, using [u,u+1)×[v,v+1)[u,u+1)\times[v,v+1) when u+v>0u+v>0 and sufficiently short intervals ending before the sum reaches 00 when u+v<0u+v<0.

L1
2.1

Fix an enumeration of Q\mathbb Q. If xCx\notin C, some member of D\mathcal D containing xx must have left endpoint exactly xx; otherwise xx would lie in its ordinary interior and hence in CC. Let rxr_x be the first rational in the fixed enumeration satisfying x<rxx<r_x and [x,rx)D[x,r_x)\in\mathcal D; such a rational exists by [L2]. If x<yx<y and rx=ryr_x=r_y, then y(x,rx)Cy\in(x,r_x)\subseteq C, a contradiction. Thus xrxx\mapsto r_x injects RC\mathbb R\setminus C into Q\mathbb Q, so RC\mathbb R\setminus C is at most countable.

step 1.1L1L2
2.2

The open cover consisting of S2AS^2\setminus A and one isolating basic rectangle for each point of AA has no at most countable subcover, so S2S^2 is not Lindelöf.

step 1.2step 1.3L3
3.1

The selected basic intervals from step 1.1 together with the [x,rx)[x,r_x) from step 2.1 form an at most countable basic cover of SS. Using [A1], select for each of them a containing member of U\mathcal U. The result is an at most countable subcover, so SS is Lindelöf.

step 1.1step 2.1A1L3
4.1

Thus the Lindelöf space SS has a non-Lindelöf square, refuting productivity of Lindelöfness.

step 3.1step 2.2

Depends on

Used by

Dependency tree · next 3 levels

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