Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

For continuous f,g:Z→Y with Y Hausdorff the agreement set {z∈Z:f(z)=g(z)} is closed in Z

Statement

Let Z be a topological space, let Y be a Hausdorff space (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and let f,g:Z→Y be continuous (Continuity of a map of topological spaces at a point and globally). Then the agreement set

E(f,g)  :=  { z∈Z:f(z)=g(z) }

is closed in Z.

No hypothesis is placed on Z: the separation hypothesis is on the codomain alone, and it is not decoration. Let Y0={a,b} with a≠b carry the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), which is not Hausdorff. Every function Z→Y0 is continuous, the only preimages to check being those of ∅ and Y0, namely ∅ and Z. So for any subset S⊆Z the constant map f0≡a and the map g0 taking the value a on S and b off S are continuous with E(f0,g0)=S, closed or not.

Facts & Assumptions

Given: Topological spaces Z and Y with Y Hausdorff, continuous maps f,g:Z→Y, and the product Y×Y with the product topology.

[A1]

E(f,g)=⟨f,g⟩−1[ΔY], where ⟨f,g⟩:Z→Y×Y is the pairing and ΔY the diagonal (The diagonal ΔX⊆X×X, the diagonal map δX, and the pairing ⟨f,g⟩ of two maps).

[L1]

The pairing ⟨f,g⟩ is continuous whenever f and g are (δX is a topological embedding of X onto ΔX, and ⟨f,g⟩ is continuous whenever f and g are, claim 1).

Proof

technique · direct
1.1

⟨f,g⟩:Z→Y×Y is continuous.

L1
1.2

ΔY is closed in Y×Y.

L2
2.1

E(f,g)=⟨f,g⟩−1[ΔY] is the preimage of a closed set under a continuous map, hence closed in Z.

step 1.1step 1.2A1L3∎

Remarks

  • Why the diagonal criterion is the right tool here. The condition "f(z)=g(z)" is a condition on the pair of values, so it becomes a membership condition once the two maps are packaged into one map into the square; the criterion then converts the separation hypothesis on Y into the closedness of the set that condition names. Nothing is proved twice: the whole content is A space is Hausdorff if and only if its diagonal is closed in the square carrying the product topology together with the preimage identity of The diagonal ΔX⊆X×X, the diagonal map δX, and the pairing ⟨f,g⟩ of two maps.

  • Both hypotheses are used, and only these. Continuity of f and g enters only through [L1], and the Hausdorff condition only through [L2]. In particular no countability, compactness or separation hypothesis on Z appears anywhere in the argument.

  • The complement is what the statement is often used for. Z∖E(f,g) is open, so if f and g differ at a point they differ throughout some open neighbourhood of it. Equivalently, E(f,g) contains the closure of every subset of Z on which f and g agree, which is the form in which a statement about a dense set is obtained from this one.

Depends on

Used by

Dependency tree · two levels

28 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