Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

FALSE: every compact space is sequentially compact

Statement

False claim: every compact topological space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) is sequentially compact (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets).

Where the claim comes from, and what is actually true. For a metric space the two conditions are equivalent, and the claim above is that equivalence transplanted to an arbitrary topological space. The refutation builds its own witness out of Tychonoff's theorem (Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice): the product

Y  :=  xD{0,1},D:={0,1}N,Y \;:=\; \prod_{x \in D} \{0,1\}, \qquad D := \{0,1\}^{\mathbb{N}},

of one copy of the two-point discrete space for every 00-11 sequence, together with the sequence (Fn)(F_n) in YY whose nn-th term reads off the nn-th coordinate, Fn(x):=xnF_n(x) := x_n. The Axiom of Choice is assumed, since Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice carries it.

Facts & Assumptions

Given: The two-point discrete space {0,1}\{0,1\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), the set D={0,1}ND = \{0,1\}^{\mathbb{N}} of functions N{0,1}\mathbb{N} \to \{0,1\} (The natural numbers N\mathbb{N} (von Neumann)), the product Y=xD{0,1}Y = \prod_{x \in D} \{0,1\} with the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), the projections πx:Y{0,1}\pi_x : Y \to \{0,1\}, and the elements FnYF_n \in Y defined by Fn(x):=xnF_n(x) := x_n for nNn \in \mathbb{N} and xDx \in D.

[A1]

The false claim: every compact topological space is sequentially compact.

[L3]

A sequence in a space is a function on N\mathbb{N}; it converges to pp when every open set containing pp contains all but finitely many of its terms; a subsequence is given by a strictly increasing index map jnjj \mapsto n_j, which satisfies njjn_j \ge j; and a space is sequentially compact when every sequence has a convergent subsequence (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, Sequences of reals: bounded, eventually, frequently, tails, subsequences, A strictly increasing index map satisfies nkkn_k \ge k, Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets).

Refutation

technique · contradiction
1.1

Suppose the claim [A1] holds, so that every compact space is sequentially compact.

A1assume-contra
1.2

YY is compact by [L1], being a product of copies of the compact two-point discrete space.

L1
2.1

By [A1] and step 1.2 the sequence (Fn)(F_n) in YY has a subsequence (Fnj)(F_{n_j}) converging to some GYG \in Y, the index map jnjj \mapsto n_j being strictly increasing.

A1L3step 1.2
3.1

Define xDx \in D by xk:=0x_k := 0 when k=njk = n_j for an even jj, xk:=1x_k := 1 when k=njk = n_j for an odd jj, and xk:=0x_k := 0 for every kk not of the form njn_j; this is well defined because jnjj \mapsto n_j is injective, being strictly increasing. Then Fnj(x)=xnjF_{n_j}(x) = x_{n_j} is 00 for even jj and 11 for odd jj.

L3step 2.1construct
4.1

The set πx1[{G(x)}]\pi_x^{-1}[\{G(x)\}] is open by [L2] and contains GG, so by step 2.1 it contains FnjF_{n_j} for all large jj; that is, Fnj(x)=G(x)F_{n_j}(x) = G(x) for all large jj. But step 3.1 makes Fnj(x)F_{n_j}(x) take the value 00 at every even jj and 11 at every odd jj, so it is constant on no set of large indices. This contradiction refutes the claim [A1].

A1L2step 2.1step 3.1discharge-contradiction

Remarks

What the witness exploits. Compactness of a product is a statement about covers and survives an index set of any size; sequential compactness is a statement about countably many terms and does not. The index set DD here is the set of all 00-11 sequences, and the point xx built at step 3.1 is chosen to disagree with the given subsequence at exactly the places that matter, which is possible precisely because every 00-11 sequence is available as an index.

No binary expansion of a real number is used, and none is needed: the witness is built from {0,1}\{0,1\}-valued functions directly, so nothing here rests on the representation of reals by digits.

The Axiom of Choice is assumed only through Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, which is where compactness of YY comes from. Nothing else in the refutation selects anything; the point xx is defined by a rule.

Depends on

Used by

Dependency tree · next 3 levels

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