Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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)(X, \mathcal{T}) be a topological space, let B\mathcal{B} be a basis for T\mathcal{T} (Basis and subbasis for a topology, and the topology generated by a family of sets) and let AXA \subseteq X. Interior and closure are as in Interior, closure, boundary, exterior, derived set and isolated point in a topological space.

  • AA is dense in XX if A=X\overline{A} = X.
  • AA is codense in XX if XAX \setminus A is dense.
  • AA is nowhere dense in XX if int(A)=\operatorname{int}(\overline{A}) = \varnothing.

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

  1. A=X\overline{A} = X;
  2. UAU \cap A \ne \varnothing for every nonempty open UXU \subseteq X;
  3. BAB \cap A \ne \varnothing for every nonempty BBB \in \mathcal{B}.

Proof. (1) \Rightarrow (2): if UU is open and nonempty, pick xUx \in U; then xAx \in \overline{A}, so UAU \cap A \ne \varnothing by clause (c) of A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set. (2) \Rightarrow (3): a nonempty member of B\mathcal{B} is a nonempty open set. (3) \Rightarrow (1): let xXx \in X; every BBB \in \mathcal{B} with xBx \in B is nonempty and so meets AA, hence xAx \in \overline{A} by clause (d) of A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA 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. AA is codense if and only if int(A)=\operatorname{int}(A) = \varnothing, because Xint(A)=XAX \setminus \operatorname{int}(A) = \overline{X \setminus A} (Interior, closure, boundary, exterior, derived set and isolated point in a topological space), so XA=X\overline{X \setminus A} = X holds exactly when int(A)=\operatorname{int}(A) = \varnothing.

Nowhere dense implies codense, and the converse fails. If int(A)=\operatorname{int}(\overline{A}) = \varnothing then int(A)int(A)=\operatorname{int}(A) \subseteq \operatorname{int}(\overline{A}) = \varnothing by monotonicity of the interior, so AA 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)(0,1) inside R\mathbb{R} has closure [0,1][0,1] and is neither codense nor nowhere dense. A closed set is nowhere dense precisely when it is codense, since then A=A\overline{A} = A.

Remarks

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

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

  • 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 · next 3 levels

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