Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets

Definition

Let (X,T) be a topological space, let B be a basis for T (Basis and subbasis for a topology, and the topology generated by a family of sets) and let A⊆X. Interior and closure are as in Interior, closure, boundary, exterior, derived set and isolated point in a topological space.

  • A is dense in X if A‾=X.
  • A is codense in X if X∖A is dense.
  • A is nowhere dense in X if int⁡(A‾)=∅.

Three equivalent forms of density, and the one used in practice. The following are equivalent:

  1. A‾=X;
  2. U∩A≠∅ for every nonempty open U⊆X;
  3. B∩A≠∅ for every nonempty B∈B.

Proof. (1) ⇒ (2): if U is open and nonempty, pick x∈U; then x∈A‾, so U∩A≠∅ 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. (2) ⇒ (3): a nonempty member of B is a nonempty open set. (3) ⇒ (1): let x∈X; every B∈B with x∈B is nonempty and so meets A, hence x∈A‾ by clause (d) 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. Form 3 is what makes density checkable: for the Sorgenfrey line it is a statement about half-open intervals, and for a metric space a statement about balls.

Codensity is emptiness of the interior. A is codense if and only if int⁡(A)=∅, because X∖int⁡(A)=X∖A‾ (Interior, closure, boundary, exterior, derived set and isolated point in a topological space), so X∖A‾=X holds exactly when int⁡(A)=∅.

Nowhere dense implies codense, and the converse fails. If int⁡(A‾)=∅ then int⁡(A)⊆int⁡(A‾)=∅ by monotonicity of the interior, so A is codense. The two notions can differ only on sets whose closure is larger than themselves, and there they sometimes do: a dense set with empty interior, such as the rationals inside the real line, is codense and is not nowhere dense, its closure being everything. They may also agree on such a set: (0,1) inside R has closure [0,1] and is neither codense nor nowhere dense. A closed set is nowhere dense precisely when it is codense, since then A‾=A.

Remarks

  • Density is a property of the pair, not of the set. A subset dense in X need not be dense in a space with a finer topology. In a nonempty indiscrete space every nonempty subset is dense, while ∅ is not; in the empty space ∅ is dense as well. Where a density claim is made below the topology is always named.

  • The empty set. ∅ is nowhere dense and codense in every space, and it is dense only in X=∅. X itself is dense in X and is nowhere dense only when X=∅.

  • What is deliberately not defined here. Separability, meaning the existence of an at most countable dense subset, is a countability axiom not developed at this point in the reading order; it is defined later in Separability: the existence of an at most countable dense subset ↗. Where a space on the companion page has an at most countable dense subset, that is what is said in full.

Depends on

Used by

Dependency tree · two levels

5 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