Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Interior, closure, boundary, exterior, derived set and isolated point in a topological space

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let AXA \subseteq X and let xXx \in X. Neighbourhoods are as in Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, so a neighbourhood need not be open.

  • The interior of AA is int(A):={UT:UA}\operatorname{int}(A) := \bigcup \{\, U \in \mathcal{T} : U \subseteq A \,\}.
  • The closure of AA is A:={FX:F closed and AF}\overline{A} := \bigcap \{\, F \subseteq X : F \text{ closed and } A \subseteq F \,\}.
  • The exterior of AA is ext(A):=int(XA)\operatorname{ext}(A) := \operatorname{int}(X \setminus A).
  • The boundary of AA is A:=Aint(A)\partial A := \overline{A} \setminus \operatorname{int}(A).
  • xx is a limit point (accumulation point) of AA if every neighbourhood NN of xx satisfies N(A{x})N \cap (A \setminus \{x\}) \ne \varnothing. The set of limit points of AA is the derived set AA'.
  • xx is an isolated point of AA if xAx \in A and some neighbourhood NN of xx satisfies NA={x}N \cap A = \{x\}.

Both operators are well posed, and the two names are justified rather than asserted. The interior is a union of open sets, hence open by (T2), it is contained in AA, and it contains every open UAU \subseteq A: so int(A)\operatorname{int}(A) is the largest open subset of AA. The family being intersected in the definition of A\overline{A} is nonempty, since XX is closed and contains AA, so the intersection is a set; it is closed by (C2) of Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, it contains AA, and it is contained in every closed FAF \supseteq A: so A\overline{A} is the smallest closed superset of AA. In particular

int(A)AA,\operatorname{int}(A) \subseteq A \subseteq \overline{A},

and AA is open if and only if A=int(A)A = \operatorname{int}(A), and closed if and only if A=AA = \overline{A}, in each case because one inclusion is automatic and the other says exactly that AA belongs to the family in question.

Interior and closure are exchanged by complementation. For every AXA \subseteq X,

Xint(A)=XA,XA=int(XA)=ext(A).X \setminus \operatorname{int}(A) = \overline{X \setminus A}, \qquad X \setminus \overline{A} = \operatorname{int}(X \setminus A) = \operatorname{ext}(A).

Indeed UXUU \mapsto X \setminus U is a bijection between the open subsets of AA and the closed supersets of XAX \setminus A, and it turns unions into intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison); applying complementation to the first identity gives the second. So ext(A)=XA\operatorname{ext}(A) = X \setminus \overline{A}, and every statement about interiors has a mirror statement about closures.

The pointwise description of the interior. xint(A)x \in \operatorname{int}(A) if and only if AA is a neighbourhood of xx. If xint(A)x \in \operatorname{int}(A) then int(A)\operatorname{int}(A) is an open set with xint(A)Ax \in \operatorname{int}(A) \subseteq A; conversely a neighbourhood relation xUAx \in U \subseteq A with UU open puts xx in the union defining int(A)\operatorname{int}(A). The corresponding description of the closure is proved as the next item, because it is the statement that does the work in every later proof.

XX is the disjoint union of the three regions. Since int(A)A\operatorname{int}(A) \subseteq \overline{A}, the three sets int(A)\operatorname{int}(A), A=Aint(A)\partial A = \overline{A} \setminus \operatorname{int}(A) and ext(A)=XA\operatorname{ext}(A) = X \setminus \overline{A} are pairwise disjoint and their union is XX. This is recorded again, with the identities for interior and closure of unions and intersections, in the lemma two items below.

Remarks

  • The boundary is symmetric in AA and its complement: A=AXA\partial A = \overline{A} \cap \overline{X \setminus A}, because Aint(A)=A(Xint(A))=AXA\overline{A} \setminus \operatorname{int}(A) = \overline{A} \cap (X \setminus \operatorname{int}(A)) = \overline{A} \cap \overline{X \setminus A} by the complementation identity above. Hence A=(XA)\partial A = \partial(X \setminus A), and A\partial A is closed, being an intersection of two closed sets.

  • A limit point of AA need not lie in AA, and a point of AA need not be a limit point of AA. The points of AA that are not limit points of AA are exactly its isolated points, directly from the two definitions. The relation A=AA\overline{A} = A \cup A' is a theorem, proved next, not a restatement.

  • These are the metric notions when the topology is a metric topology. For a metric space the definitions of Interior, closure, boundary, limit point, isolated point and dense subset of a metric space are stated with balls in place of neighbourhoods, and the balls around xx are a neighbourhood base at xx; the identification is carried out where metrizable spaces are defined, later on this page, and it is what allows metric examples to be quoted here without reproof.

Depends on

Used by

…and 24 more results.

Dependency tree · next 3 levels

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