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: two continuous maps that agree on a dense subset of their common domain are equal, with no hypothesis on the codomain

Statement

False claim: if ZZ and YY are topological spaces, DZD \subseteq Z is dense (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets), and f,g:ZYf, g : Z \to Y are continuous (Continuity of a map of topological spaces at a point and globally) with f(d)=g(d)f(d) = g(d) for every dDd \in D, then f=gf = g.

The refutation takes Z=RZ = \mathbb{R} with its usual topology (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), the dense set D=QRD = \mathbb{Q}_{\mathbb{R}} of rationals inside R\mathbb{R} (The rationals embed densely in the reals), and for codomain the two-point set Y0={a,b}Y_0 = \{a,b\} with aba \ne b carrying the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), which is not Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not). The maps are the constant faf \equiv a and the map gg equal to aa at every rational and to bb at every irrational. Both are continuous, they agree on DD, and they differ at every irrational.

The hypothesis the claim drops is the Hausdorff condition on the codomain, which is what Two continuous maps into a Hausdorff space that agree on a dense subset are equal assumes.

Facts & Assumptions

Given: R\mathbb{R} with its usual topology; the set QR\mathbb{Q}_{\mathbb{R}} of rationals inside R\mathbb{R}; and a two-element set Y0={a,b}Y_0 = \{a,b\} with aba \ne b.

[A3]

ARA \subseteq \mathbb{R} is dense exactly when UAU \cap A \ne \varnothing for every nonempty open URU \subseteq \mathbb{R} (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, form 2).

[L2]

Strictly between any two reals lies a rational (The rationals embed densely in the reals).

[L3]

The set RQR\mathbb{R} \setminus \mathbb{Q}_{\mathbb{R}} of irrationals is uncountable (The irrationals are uncountable); an uncountable set is not finite and the empty set is finite, so it is nonempty (Finite, countably infinite, countable, uncountable).

[L4]

Two continuous maps into a Hausdorff space agreeing on a dense subset of their common domain are equal (Two continuous maps into a Hausdorff space that agree on a dense subset are equal).

Refutation

technique · constructive
1.1

Give Y0={a,b}Y_0 = \{a,b\} the indiscrete topology; it is not Hausdorff.

A2construct
1.2

QR\mathbb{Q}_{\mathbb{R}} is dense in R\mathbb{R}: given a nonempty open UU, pick xUx \in U and by [A1] a real r>0r > 0 with (xr,x+r)U(x-r, x+r) \subseteq U; by [L2] some rational lies strictly between xrx - r and x+rx + r, hence in UU.

A1A3L2
1.3

There is a real tQRt \notin \mathbb{Q}_{\mathbb{R}}, the set of irrationals being nonempty.

L3choose
2.1

Every function hh from a topological space into Y0Y_0 is continuous: the only open subsets of Y0Y_0 are \varnothing and Y0Y_0, whose preimages are \varnothing and the whole domain, both open.

step 1.1A2L1
3.1

Define f:RY0f : \mathbb{R} \to Y_0 by f(x):=af(x) := a for every xx, and g:RY0g : \mathbb{R} \to Y_0 by g(x):=ag(x) := a for xQRx \in \mathbb{Q}_{\mathbb{R}} and g(x):=bg(x) := b otherwise; both are continuous by step 2.1.

step 2.1construct
4.1

ff and gg agree at every point of QR\mathbb{Q}_{\mathbb{R}}, which is dense in R\mathbb{R} by step 1.2.

step 1.2step 3.1
4.2

f(t)=af(t) = a and g(t)=bg(t) = b for the irrational tt of step 1.3, and aba \ne b, so fgf \ne g.

step 1.3step 3.1
5.1

Steps 3.1, 4.1 and 4.2 exhibit two continuous maps agreeing on a dense subset of their common domain and not equal, so the claim is false; by step 1.1 the codomain is not Hausdorff, which is exactly the hypothesis [L4] carries and the claim drops.

step 1.1step 3.1step 4.1step 4.2L4discharge-construct

Remarks

  • The failure is as large as it can be. The two maps agree precisely on QR\mathbb{Q}_{\mathbb{R}} and differ at every other point of R\mathbb{R}, so nothing is salvaged by weakening the conclusion from equality to agreement off a small set: the disagreement set is the whole of the irrationals.

  • Continuity is not being cheated. Both maps are continuous for the honest reason recorded in step 2.1, that the codomain has only two open sets. No pathology of R\mathbb{R} is involved, and the same construction runs with R\mathbb{R} replaced by any space with a dense subset that is not the whole space.

  • Why a two-point codomain suffices. The Hausdorff condition is a statement about pairs of distinct points, so the smallest space that can fail it has two points, and the indiscrete topology is the coarsest topology on it. Taking the coarsest topology is also what makes every map into it continuous, so the witness needs no verification of continuity beyond counting the open sets.

Depends on

Used by

Dependency tree · next 3 levels

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