Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Separated sets: A‾∩B=A∩B‾=∅

Definition

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let A,B⊆X, with closures taken in X (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). Then A and B are separated when

A‾∩B=∅andA∩B‾=∅.

Equivalently, neither set meets the closure of the other. The condition is symmetric in A and B by construction, and it is inherited downwards: if A and B are separated and A′⊆A, B′⊆B, then A′ and B′ are separated, because A′⊆A forces A′‾⊆A‾, the closure A‾ being a closed superset of A′ and A′‾ the smallest such (A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set, claim 2).

Separated sets are disjoint, and being disjoint is not enough. From A⊆A‾ one gets A∩B⊆A‾∩B=∅. The converse fails: in R with its usual topology the sets A=(0,1) and B=[1,2) are disjoint, yet 1∈A‾∩B, so they are not separated.

Two sufficient conditions, both used constantly below.

  1. Disjoint closed sets are separated. If A and B are closed and disjoint then A‾=A and B‾=B (A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set, claim 2), so both displayed intersections are A∩B=∅.
  2. Disjoint open sets are separated. Let U,V be open and disjoint. If y∈V then V is an open set containing y and missing U, so y∉U‾ by clause (c) of A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set; hence U‾∩V=∅, and symmetrically U∩V‾=∅.

Separation is absolute rather than relative to a subspace. Let A,B⊆S⊆X with S carrying the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). Then A and B are separated in the space S if and only if they are separated in X. Indeed cl⁡S(A)=A‾∩S (For A⊆S⊆X the closure of A in S is A‾X∩S, while the interior only contains int⁡X(A)∩S, with equality when S is open; and a dense subset of X traces to a dense subset of every open S, claim 1), so

cl⁡S(A)∩B=A‾∩S∩B=A‾∩B

because B⊆S, and symmetrically for the other intersection. So the phrase "A and B are separated" needs no ambient space named once both sets are fixed, and this is exactly what makes the notion the right hypothesis for complete normality later on this page.

Remarks

  • Why the notion is not "disjoint closures". Requiring A‾∩B‾=∅ is strictly stronger, and it is too strong to be useful: in R the sets (0,1) and (1,2) are separated in the sense above, while their closures [0,1] and [1,2] meet. The definition asks only that each set avoid the other's closure.

  • The vocabulary collides with two others and neither is meant here. "A and B are separated by disjoint open sets" is a different, stronger condition, and it is the conclusion of the normality and complete-normality axioms below, not the hypothesis. "Separable", meaning "has an at most countable dense subset", is unrelated and is defined later in Separability: the existence of an at most countable dense subset ↗.

  • Nothing here needs a separation axiom. The definition and all four observations above hold in an arbitrary topological space, points closed or not.

Depends on

Used by

Dependency tree · two levels

12 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