Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

Refuted: the agreement set of two continuous maps is closed, with no hypothesis on the codomain. Two continuous maps R→{a,b} into the indiscrete two-point space have agreement set Q

Statement refuted

False claim: for continuous maps f,g:Z→Y between topological spaces the agreement set E(f,g)={ z∈Z:f(z)=g(z) } is closed in Z, with no hypothesis on the codomain Y.

The witness is the pair of maps of FALSE: two continuous maps that agree on a dense subset of their common domain are equal, with no hypothesis on the codomain: take Z=R with its usual topology, Y0={a,b} with a≠b and the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), f≡a, and g equal to a at every rational and to b at every irrational. Both are continuous, and

E(f,g)  =  QR,

which is dense in R (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and is not all of R, hence is not closed.

So the hypothesis dropped is the Hausdorff condition on the codomain, which is what For continuous f,g:Z→Y with Y Hausdorff the agreement set {z∈Z:f(z)=g(z)} is closed in Z assumes; and the failure is the worst possible one, the agreement set being dense rather than merely non-closed.

Facts & Assumptions

Given: R with its usual topology; the set QR of rationals inside R; the two-point set Y0={a,b} with a≠b and the indiscrete topology; and the maps f≡a and g equal to a on QR and to b off it.

[A3]

A⊆R is dense exactly when U∩A≠∅ for every nonempty open U, equivalently when A‾=R (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, forms 1 and 2).

[L2]

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

[L3]

The set of irrationals is uncountable, hence not finite, hence nonempty (The irrationals are uncountable, Finite, countably infinite, countable, uncountable).

[L5]

If the codomain is Hausdorff then the agreement set of two continuous maps is closed, and two such maps agreeing on a dense subset are equal (For continuous f,g:Z→Y with Y Hausdorff the agreement set {z∈Z:f(z)=g(z)} is closed in Z, Two continuous maps into a Hausdorff space that agree on a dense subset are equal).

Counterexample

technique · constructive
1.1

Give Y0={a,b} the indiscrete topology and take f,g:R→Y0 with f(x)=a for every x, g(x)=a for x∈QR and g(x)=b otherwise.

A2construct
1.2

QR is dense in R: given a nonempty open U, pick x∈U and by [A1] a real r>0 with (x−r,x+r)⊆U; by [L2] some rational lies strictly between x−r and x+r, hence in U.

A1A3L2
1.3

There is a real t∉QR.

L3choose
2.1

Both maps are continuous: the only open subsets of Y0 are ∅ and Y0, whose preimages are ∅ and R, both open.

step 1.1A2L1
2.2

E(f,g)=QR: for x∈QR both maps take the value a, and for x∉QR they take the values a and b, which differ.

step 1.1
3.1

E(f,g)‾=R by steps 1.2 and 2.2, while E(f,g)≠R since t∉QR by step 1.3; so E(f,g) is not closed by [L4].

step 1.2step 1.3step 2.2A3L4
4.1

Steps 2.1 and 3.1 exhibit two continuous maps whose agreement set is not closed, so the claim is false; by [A2] the codomain is not Hausdorff, which is exactly the hypothesis [L5] carries.

step 2.1step 3.1A2L5discharge-construct∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

72 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