Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 continuous bijection of topological spaces is a homeomorphism

Statement

False claim: if XX and YY are topological spaces and f:XYf : X \to Y is a continuous bijection (Continuity of a map of topological spaces at a point and globally, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological), then ff is a homeomorphism.

Continuity of f1f^{-1} is an independent demand, and A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces says exactly what it amounts to: a continuous bijection is a homeomorphism precisely when it is an open map, equivalently a closed map. The claim above asserts that this is automatic, and it is not. The witness below is the smallest possible one — a two-point set carrying two different topologies — and it uses nothing beyond The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies.

Facts & Assumptions

Given: A two-point set S={a,b}S = \{a,b\} with aba \ne b, carrying on the one hand the discrete topology P(S)={,{a},{b},S}\mathcal{P}(S) = \{\varnothing, \{a\}, \{b\}, S\} and on the other the Sierpinski topology TSier={,{b},S}\mathcal{T}_{\mathrm{Sier}} = \{\varnothing, \{b\}, S\}; and the identity function id:(S,P(S))(S,TSier)\mathrm{id} : (S, \mathcal{P}(S)) \to (S, \mathcal{T}_{\mathrm{Sier}}).

[A1]

The discrete topology on SS is P(S)\mathcal{P}(S), in which every subset is open; the Sierpinski topology on {a,b}\{a,b\} is {,{b},S}\{\varnothing, \{b\}, S\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

A homeomorphism is a continuous bijection with continuous inverse; an open map carries open sets to open sets (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[L2]

A continuous bijection is a homeomorphism if and only if it is an open map (A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces, claim 1).

Refutation

technique · direct
1.1

id\mathrm{id} is a bijection of SS onto SS, being the identity function of the set SS.

given
1.2

id\mathrm{id} is continuous: for every VTSierV \in \mathcal{T}_{\mathrm{Sier}} the preimage id1[V]=V\mathrm{id}^{-1}[V] = V is a subset of SS, hence open in the discrete topology.

givenA1A2
1.3

{a}\{a\} is open in the discrete topology on SS, and {a}TSier\{a\} \notin \mathcal{T}_{\mathrm{Sier}}, the three members of TSier\mathcal{T}_{\mathrm{Sier}} being \varnothing, {b}\{b\} and SS, none of which is {a}\{a\} because aba \ne b.

givenA1
2.1

id\mathrm{id} is not an open map: by step 1.3 the image id[{a}]={a}\mathrm{id}[\{a\}] = \{a\} of an open set is not open in the target.

step 1.3L1
3.1

By steps 1.1, 1.2 and 2.1, id\mathrm{id} is a continuous bijection that is not open, hence not a homeomorphism by [L2]; equivalently, its inverse — again the identity function of SS, now read from (S,TSier)(S,\mathcal{T}_{\mathrm{Sier}}) to (S,P(S))(S,\mathcal{P}(S)) — is not continuous, because the preimage of the open set {a}\{a\} is {a}\{a\}, which is not open in TSier\mathcal{T}_{\mathrm{Sier}}. So the claim is false.

step 1.1step 1.2step 2.1step 1.3A2L1L2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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