Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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 topology is induced by some metric

Statement

False claim: every topological space (X,T)(X,\mathcal{T}) is metrizable, that is, for every topology there is a metric on XX whose metric topology is T\mathcal{T} (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

The claim fails for the smallest interesting reason available: every metric space separates distinct points by disjoint open sets (Distinct points of a metric space have disjoint balls around them), and the indiscrete topology on a set with two points has no two disjoint nonempty open sets at all (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

Facts & Assumptions

Given: A two-point set X={a,b}X = \{a,b\} with aba \ne b, carrying the indiscrete topology Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\}.

[A1]

The indiscrete topology on XX has exactly the two open sets \varnothing and XX (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[A2]

(X,T)(X,\mathcal{T}) is metrizable when some metric dd on XX has Td=T\mathcal{T}_d = \mathcal{T} (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

[L1]

In a metric space, distinct points pqp \ne q admit disjoint open sets B(p,r)B(p,r) and B(q,r)B(q,r) containing pp and qq respectively, with r=d(p,q)/2>0r = d(p,q)/2 > 0 (Distinct points of a metric space have disjoint balls around them).

Refutation

technique · direct
1.1

Suppose dd were a metric on XX with Td=Tind\mathcal{T}_d = \mathcal{T}_{\mathrm{ind}}.

assume-hyp
1.2

Since aba \ne b, [L1] supplies open sets UaU \ni a and VbV \ni b of (X,d)(X,d) with UV=U \cap V = \varnothing.

givenL1
2.1

By the supposition of step 1.1 the sets UU and VV lie in Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\}; and aUa \in U, bVb \in V make both nonempty, so U=V=XU = V = X by [A1].

step 1.1step 1.2A1L2
3.1

Then UV=XU \cap V = X \ne \varnothing, since aXa \in X, contradicting the disjointness of step 1.2; so no such metric dd exists and (X,Tind)(X, \mathcal{T}_{\mathrm{ind}}) is not metrizable.

step 1.2step 2.1A2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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