Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 σ-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  :=  ∏x∈D{0,1},D:={0,1}N,

of one copy of the two-point discrete space for every 0-1 sequence, together with the sequence (Fn) in Y whose n-th term reads off the n-th coordinate, Fn(x):=xn. 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} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), the set D={0,1}N of functions N→{0,1} (The natural numbers N (von Neumann)), the product Y=∏x∈D{0,1} with the product topology (The product set ∏i∈IXi 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}, and the elements Fn∈Y defined by Fn(x):=xn for n∈N and x∈D.

[A1]

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

[L3]

A sequence in a space is a function on N; it converges to p when every open set containing p contains all but finitely many of its terms; a subsequence is given by a strictly increasing index map j↦nj, which satisfies nj≥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 nk≥k, Countably compact, Lindel"of, sequentially compact, limit point compact and σ-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

Y 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) in Y has a subsequence (Fnj) converging to some G∈Y, the index map j↦nj being strictly increasing.

A1L3step 1.2
3.1

Define x∈D by xk:=0 when k=nj for an even j, xk:=1 when k=nj for an odd j, and xk:=0 for every k not of the form nj; this is well defined because j↦nj is injective, being strictly increasing. Then Fnj(x)=xnj is 0 for even j and 1 for odd j.

L3step 2.1construct
4.1

The set πx−1[{G(x)}] is open by [L2] and contains G, so by step 2.1 it contains Fnj for all large j; that is, Fnj(x)=G(x) for all large j. But step 3.1 makes Fnj(x) take the value 0 at every even j and 1 at every odd j, 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 D here is the set of all 0-1 sequences, and the point x 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 0-1 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}-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 Y comes from. Nothing else in the refutation selects anything; the point x is defined by a rule.

Depends on

Used by

Dependency tree · two levels

58 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