Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)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.

Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open

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) and let xXx \in X.

A set NXN \subseteq X is a neighbourhood of xx if there is an open UTU \in \mathcal{T} with xUNx \in U \subseteq N. The family of all neighbourhoods of xx is written N(x)\mathcal{N}(x) and called the neighbourhood filter at xx. A neighbourhood that is itself open is an open neighbourhood.

Convention, and it is a live fork: in this library a neighbourhood need not be open. The competing convention, used by Munkres among others, defines a neighbourhood of xx to be an open set containing xx. Both are in current use; this library follows the one above and writes "open neighbourhood" in full whenever openness is wanted, so that no statement here depends on which convention a reader brings.

A family BxN(x)\mathcal{B}_x \subseteq \mathcal{N}(x) is a neighbourhood base at xx if every neighbourhood of xx contains a member of Bx\mathcal{B}_x: for every NN(x)N \in \mathcal{N}(x) there is BBxB \in \mathcal{B}_x with BNB \subseteq N.

Four immediate consequences, established here because they are used constantly.

  1. XX is a neighbourhood of each of its points, since xXXx \in X \subseteq X and XX is open by (T1); so N(x)\mathcal{N}(x) \ne \varnothing and every point has at least one neighbourhood base, namely N(x)\mathcal{N}(x) itself.
  2. A superset of a neighbourhood of xx is a neighbourhood of xx: if xUNMx \in U \subseteq N \subseteq M with UU open then xUMx \in U \subseteq M.
  3. The intersection of two neighbourhoods of xx is a neighbourhood of xx: if xUNx \in U \subseteq N and xVMx \in V \subseteq M with U,VU, V open, then UVU \cap V is open by (T3) and xUVNMx \in U \cap V \subseteq N \cap M. By iteration the same holds for any intersection of finitely many neighbourhoods of xx.
  4. A set is open exactly when it is a neighbourhood of each of its points. If UU is open and xUx \in U then xUUx \in U \subseteq U. Conversely, if NN is a neighbourhood of each of its points, choose for each xNx \in N an open UxU_x with xUxNx \in U_x \subseteq N; then N=xNUxN = \bigcup_{x \in N} U_x is open by (T2). No choice principle is involved: UxU_x may be taken to be the union of all open subsets of NN containing xx, which is determined by xx and NN, and is open by (T2).

Basic sets give neighbourhood bases. If B\mathcal{B} is a basis for T\mathcal{T} (Basis and subbasis for a topology, and the topology generated by a family of sets) then Bx:={BB:xB}\mathcal{B}_x := \{\, B \in \mathcal{B} : x \in B \,\} is a neighbourhood base at xx consisting of open sets. Each such BB is open and contains xx, hence is a neighbourhood of xx; and if NN(x)N \in \mathcal{N}(x), fix open UU with xUNx \in U \subseteq N and then BBB \in \mathcal{B} with xBUx \in B \subseteq U, which gives BBxB \in \mathcal{B}_x with BNB \subseteq N. A member of Bx\mathcal{B}_x is called a basic neighbourhood of xx.

Remarks

  • The convention costs nothing and buys one thing. Every statement of the form "for every neighbourhood NN of xx ... " whose predicate is preserved when NN is enlarged is equivalent to the statement with NN restricted to open neighbourhoods: every neighbourhood contains an open one, and the predicate then passes to the larger set. Eventual-membership and the usual local-existence tests have this form; an arbitrary predicate need not. What the wider notion buys is that N(x)\mathcal{N}(x) is a filter on XX in the sense of Filter on a set: consequence 1 is (F1), consequence 3 is (F3), consequence 2 is (F4), and (F2) holds because xUx \in U \subseteq \varnothing is impossible, so \varnothing is a neighbourhood of no point. Under the narrower convention the family of open sets containing xx fails (F4) as soon as some non-open set contains an open set around xx, so the name "neighbourhood filter" would not be available.

  • A neighbourhood base is not required to be closed under intersection, and the bases used below usually are not; what is required is only that its members be cofinal downwards among neighbourhoods.

Depends on

Used by

…and 18 more results.

Dependency tree · next 3 levels

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