Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

Basis and subbasis for a topology, and the topology generated by a family of sets

Definition

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

A family B⊆T is a basis for T if every open set is a union of members of B: for every U∈T there is BU⊆B with U=⋃BU. Equivalently, and this is the form used in proofs,

for every U∈T and every x∈U there is B∈B with x∈B⊆U.

The two forms say the same thing. If every open U is such a union and x∈U, then x lies in one of the sets united, which is a member of B inside U. Conversely, if the displayed condition holds then U=⋃{ B∈B:B⊆U }, since each such B is contained in U and each x∈U lies in one of them. Note that ⋃∅=∅, so the empty open set is covered by the empty subfamily and needs no member of B. The members of a basis are called basic open sets.

The topology generated by a family. Let S⊆P(X) be any family of subsets of X. Then

⟨S⟩:=⋂{ T′:T′ is a topology on X with S⊆T′ }

is a topology on X, it contains S, and it is contained in every topology on X that contains S. It is called the topology generated by S, and S is a subbasis for a topology T when T=⟨S⟩.

This is well posed, and the obligation is discharged here. The collection being intersected is nonempty, because P(X) is a topology on X containing S; so the intersection is an intersection of a nonempty family of subsets of P(X) and is a set. It is a topology: ∅ and X lie in every topology on X, hence in the intersection, which is (T1); if S′⊆⟨S⟩ then S′ is a subfamily of each T′ in the collection, so ⋃S′ lies in each T′ and hence in the intersection, which is (T2); and the same argument with U∩V gives (T3). It contains S because every T′ in the collection does, and it is contained in each such T′ because an intersection is contained in each of its members. So ⟨S⟩ is the coarsest topology on X containing S (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and in particular it is uniquely determined by S.

Neither notion is intrinsic to the family alone. "B is a basis for T" and "S is a subbasis for T" are relations between a family and a topology, not properties of the family. The question of which families are a basis for some topology, and how the topology generated by a subbasis is computed from it, is settled by the next item.

Remarks

  • Every topology is a basis for itself, so a basis always exists; the point of a basis is to be smaller and more explicit than T, and the point of a subbasis is to be smaller still at the cost of one round of finite intersections.

  • Two extremes of the generated topology. ⟨∅⟩ is the indiscrete topology, since {∅,X} is a topology containing the empty family and is contained in every topology. At the other end, ⟨P(X)⟩=P(X) is the discrete topology.

  • Generation is monotone and idempotent. If S1⊆S2 then every topology containing S2 contains S1, so ⟨S1⟩⊆⟨S2⟩; and ⟨⟨S⟩⟩=⟨S⟩ because ⟨S⟩ is itself a topology containing S. Both are used silently below.

Depends on

Used by

…and 31 more results.

Dependency tree · two levels

2 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