Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis

Statement

Let XX be a set, and for BP(X)\mathcal{B} \subseteq \mathcal{P}(X) write

TB:={UX:for every xU there is BB with xBU}.\mathcal{T}_{\mathcal{B}} := \{\, U \subseteq X : \text{for every } x \in U \text{ there is } B \in \mathcal{B} \text{ with } x \in B \subseteq U \,\} .

  1. B\mathcal{B} is a basis for some topology on XX (Basis and subbasis for a topology, and the topology generated by a family of sets) if and only if

    • (B1) B=X\bigcup \mathcal{B} = X, and
    • (B2) for all B1,B2BB_1, B_2 \in \mathcal{B} and every xB1B2x \in B_1 \cap B_2 there is B3BB_3 \in \mathcal{B} with xB3B1B2x \in B_3 \subseteq B_1 \cap B_2.

    When (B1) and (B2) hold, that topology is unique: it is TB\mathcal{T}_{\mathcal{B}}, which is also exactly the family of all unions of subfamilies of B\mathcal{B}.

  2. Let SP(X)\mathcal{S} \subseteq \mathcal{P}(X) be an arbitrary family and let BS\mathcal{B}_{\mathcal{S}} be the family of intersections of finitely many members of S\mathcal{S}. Then BS\mathcal{B}_{\mathcal{S}} satisfies (B1) and (B2), and TBS=S\mathcal{T}_{\mathcal{B}_{\mathcal{S}}} = \langle \mathcal{S} \rangle, the topology generated by S\mathcal{S}. So the finite intersections of any subbasis form a basis for the topology it generates.

The nullary intersection: this library takes the empty intersection to be XX. In claim 2 the phrase "finitely many" includes none, and the intersection of the empty subfamily of S\mathcal{S} is XX, because the defining condition "lies in every member of the empty family" holds of every point of XX. Hence XBSX \in \mathcal{B}_{\mathcal{S}} for every S\mathcal{S}, including S=\mathcal{S} = \varnothing, and no covering hypothesis is imposed on a subbasis. The competing convention takes only nonempty finite intersections and compensates by requiring S=X\bigcup \mathcal{S} = X; under it claim 2 holds verbatim once that hypothesis is added, and the two conventions differ only in which of the two devices supplies (B1). The choice made here is recorded again among this page's conventions, and it is the reason \langle \varnothing \rangle comes out as the indiscrete topology {,X}\{\varnothing, X\} rather than being undefined.

Facts & Assumptions

Given: A set XX; a family BP(X)\mathcal{B} \subseteq \mathcal{P}(X) and the family TB\mathcal{T}_{\mathcal{B}} displayed above; a family SP(X)\mathcal{S} \subseteq \mathcal{P}(X) and the family BS:={S1Sn:nN, S1,,SnS}\mathcal{B}_{\mathcal{S}} := \{\, S_1 \cap \dots \cap S_n : n \in \mathbb{N},\ S_1, \dots, S_n \in \mathcal{S} \,\}, where the value at n=0n = 0 is the empty intersection XX.

[L1]

Topology axioms (T1) ,XT\varnothing, X \in \mathcal{T}, (T2) closure under arbitrary unions, (T3) closure under binary intersections, and the fact that (T3) iterated gives every intersection of n1n \ge 1 open sets (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

B\mathcal{B} is a basis for T\mathcal{T} when BT\mathcal{B} \subseteq \mathcal{T} and every UTU \in \mathcal{T} is a union of members of B\mathcal{B}; equivalently, when for every UTU \in \mathcal{T} and xUx \in U there is BBB \in \mathcal{B} with xBUx \in B \subseteq U (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

S\langle \mathcal{S} \rangle is a topology on XX, contains S\mathcal{S}, and is contained in every topology on XX that contains S\mathcal{S} (Basis and subbasis for a topology, and the topology generated by a family of sets).

Proof

technique · direct
1.1

Assume (B1) and (B2).

assume-hyp
1.2

Assume instead that B\mathcal{B} is a basis for some topology T\mathcal{T} on XX.

assume-hyp
1.3

XBSX \in \mathcal{B}_{\mathcal{S}}, being the value of the empty intersection, and SBS\mathcal{S} \subseteq \mathcal{B}_{\mathcal{S}}, each SSS \in \mathcal{S} being the intersection of the one-term list SS.

given
1.4

BS\mathcal{B}_{\mathcal{S}} is closed under binary intersections: the intersection of S1SnS_1 \cap \dots \cap S_n with S1SmS'_1 \cap \dots \cap S'_m is the intersection of the concatenated list, again a list of finitely many members of S\mathcal{S}.

given
1.5

BTB\mathcal{B} \subseteq \mathcal{T}_{\mathcal{B}} always, since for BBB \in \mathcal{B} and xBx \in B the set BB itself witnesses the defining condition; and every UTBU \in \mathcal{T}_{\mathcal{B}} equals {BB:BU}\bigcup \{\, B \in \mathcal{B} : B \subseteq U \,\}, since each such BB lies in UU and each xUx \in U lies in one of them.

givenL2
2.1

Under the assumption of step 1.1: TB\varnothing \in \mathcal{T}_{\mathcal{B}}, the defining condition being vacuous, and XTBX \in \mathcal{T}_{\mathcal{B}}, since by (B1) every xXx \in X lies in some BBB \in \mathcal{B} and every subset of XX satisfies BXB \subseteq X; so (T1) holds for TB\mathcal{T}_{\mathcal{B}}.

step 1.1L1
2.2

Under the assumption of step 1.1: if STB\mathcal{S}' \subseteq \mathcal{T}_{\mathcal{B}} and xSx \in \bigcup \mathcal{S}', then xUx \in U for some USU \in \mathcal{S}', and membership of UU supplies BBB \in \mathcal{B} with xBUSx \in B \subseteq U \subseteq \bigcup \mathcal{S}'; so STB\bigcup \mathcal{S}' \in \mathcal{T}_{\mathcal{B}} and (T2) holds.

step 1.1L1
2.3

Under the assumption of step 1.1: if U,VTBU, V \in \mathcal{T}_{\mathcal{B}} and xUVx \in U \cap V, fix B1,B2BB_1, B_2 \in \mathcal{B} with xB1Ux \in B_1 \subseteq U and xB2Vx \in B_2 \subseteq V; then xB1B2x \in B_1 \cap B_2, and (B2) supplies B3BB_3 \in \mathcal{B} with xB3B1B2UVx \in B_3 \subseteq B_1 \cap B_2 \subseteq U \cap V, so UVTBU \cap V \in \mathcal{T}_{\mathcal{B}} and (T3) holds.

step 1.1L1choose
2.4

Under the assumption of step 1.2: XTX \in \mathcal{T} by (T1), so [L2] gives for each xXx \in X a member BBB \in \mathcal{B} with xBXx \in B \subseteq X, whence B=X\bigcup \mathcal{B} = X, which is (B1); and for B1,B2BTB_1, B_2 \in \mathcal{B} \subseteq \mathcal{T} the set B1B2B_1 \cap B_2 is open by (T3), so [L2] gives for each xB1B2x \in B_1 \cap B_2 a member B3BB_3 \in \mathcal{B} with xB3B1B2x \in B_3 \subseteq B_1 \cap B_2, which is (B2).

step 1.2L1L2
2.5

Under the assumption of step 1.2: T=TB\mathcal{T} = \mathcal{T}_{\mathcal{B}}. Indeed UTU \in \mathcal{T} implies UTBU \in \mathcal{T}_{\mathcal{B}} by the second form of [L2]; and conversely UTBU \in \mathcal{T}_{\mathcal{B}} makes UU a union of members of BT\mathcal{B} \subseteq \mathcal{T} by step 1.5, hence open by (T2).

step 1.2step 1.5L1L2
2.6

By steps 1.3 and 1.4, BS\mathcal{B}_{\mathcal{S}} satisfies (B1), since XBSX \in \mathcal{B}_{\mathcal{S}} forces BS=X\bigcup \mathcal{B}_{\mathcal{S}} = X, and (B2), since B1B2BSB_1 \cap B_2 \in \mathcal{B}_{\mathcal{S}} may be taken as B3B_3.

step 1.3step 1.4
3.1

Steps 2.1, 2.2 and 2.3 make TB\mathcal{T}_{\mathcal{B}} a topology on XX whenever (B1) and (B2) hold, and step 1.5 then makes B\mathcal{B} a basis for it and identifies TB\mathcal{T}_{\mathcal{B}} with the family of unions of subfamilies of B\mathcal{B}; so (B1) and (B2) are sufficient.

step 2.1step 2.2step 2.3step 1.5L1L2
4.1

Step 2.4 shows (B1) and (B2) are necessary, and step 2.5 shows that any topology having B\mathcal{B} as a basis equals TB\mathcal{T}_{\mathcal{B}}, which is the asserted uniqueness; with step 3.1 this proves claim 1.

step 2.4step 2.5step 3.1
4.2

By step 2.6 and step 3.1 applied to BS\mathcal{B}_{\mathcal{S}}, the family TBS\mathcal{T}_{\mathcal{B}_{\mathcal{S}}} is a topology on XX with basis BS\mathcal{B}_{\mathcal{S}}, and it contains S\mathcal{S} by step 1.3 and step 1.5.

step 1.3step 1.5step 2.6step 3.1
5.1

Let T\mathcal{T}' be any topology on XX with ST\mathcal{S} \subseteq \mathcal{T}'; then BST\mathcal{B}_{\mathcal{S}} \subseteq \mathcal{T}', because XTX \in \mathcal{T}' by (T1) covers the empty intersection and (T3) iterated covers the intersections of n1n \ge 1 members of S\mathcal{S}, and hence TBST\mathcal{T}_{\mathcal{B}_{\mathcal{S}}} \subseteq \mathcal{T}' by (T2), every member of the former being a union of members of BS\mathcal{B}_{\mathcal{S}}.

step 1.5step 4.2L1
6.1

By steps 4.2 and 5.1 the topology TBS\mathcal{T}_{\mathcal{B}_{\mathcal{S}}} contains S\mathcal{S} and is contained in every topology containing S\mathcal{S}, so it is the coarsest such topology, that is TBS=S\mathcal{T}_{\mathcal{B}_{\mathcal{S}}} = \langle \mathcal{S} \rangle; with step 2.6 this proves claim 2.

step 2.6step 4.2step 5.1L3

Remarks

  • What (B1) and (B2) are not. (B2) does not say that B\mathcal{B} is closed under intersections; it says only that the intersection of two members is a union of members. The basis of open intervals of R\mathbb{R} satisfies (B2) outright, since an intersection of two open intervals is an open interval or empty, whereas the basis of half-open intervals of the Sorgenfrey line uses the same closure property; a basis of open balls in a metric space uses the weaker form in an essential way.

  • The subbasis clause is what makes generation computable. The definition of S\langle \mathcal{S} \rangle as an intersection of topologies says nothing about what its members look like; claim 2 says they are exactly the unions of finite intersections of members of S\mathcal{S}, which is how every generated topology in this library is actually described.

  • A family may be a basis for at most one topology, but it is a subbasis for at most one as well, and the two roles differ: S\mathcal{S} is a subbasis for S\langle \mathcal{S} \rangle and a basis for it exactly when S\mathcal{S} already satisfies (B1) and (B2).

Depends on

Used by

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