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 be a set, and for write
-
is a basis for some topology on (Basis and subbasis for a topology, and the topology generated by a family of sets) if and only if
- (B1) , and
- (B2) for all and every there is with .
When (B1) and (B2) hold, that topology is unique: it is , which is also exactly the family of all unions of subfamilies of .
-
Let be an arbitrary family and let be the family of intersections of finitely many members of . Then satisfies (B1) and (B2), and , the topology generated by . 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 . In claim 2 the phrase "finitely many" includes none, and the intersection of the empty subfamily of is , because the defining condition "lies in every member of the empty family" holds of every point of . Hence for every , including , and no covering hypothesis is imposed on a subbasis. The competing convention takes only nonempty finite intersections and compensates by requiring ; 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 comes out as the indiscrete topology rather than being undefined.
Facts & Assumptions
Given: A set ; a family and the family displayed above; a family and the family , where the value at is the empty intersection .
Topology axioms (T1) , (T2) closure under arbitrary unions, (T3) closure under binary intersections, and the fact that (T3) iterated gives every intersection of open sets (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
is a basis for when and every is a union of members of ; equivalently, when for every and there is with (Basis and subbasis for a topology, and the topology generated by a family of sets).
is a topology on , contains , and is contained in every topology on that contains (Basis and subbasis for a topology, and the topology generated by a family of sets).
Proof
Assume (B1) and (B2).
Assume instead that is a basis for some topology on .
, being the value of the empty intersection, and , each being the intersection of the one-term list .
is closed under binary intersections: the intersection of with is the intersection of the concatenated list, again a list of finitely many members of .
always, since for and the set itself witnesses the defining condition; and every equals , since each such lies in and each lies in one of them.
Under the assumption of step 1.1: , the defining condition being vacuous, and , since by (B1) every lies in some and every subset of satisfies ; so (T1) holds for .
Under the assumption of step 1.1: if and , then for some , and membership of supplies with ; so and (T2) holds.
Under the assumption of step 1.1: if and , fix with and ; then , and (B2) supplies with , so and (T3) holds.
Under the assumption of step 1.2: by (T1), so [L2] gives for each a member with , whence , which is (B1); and for the set is open by (T3), so [L2] gives for each a member with , which is (B2).
Under the assumption of step 1.2: . Indeed implies by the second form of [L2]; and conversely makes a union of members of by step 1.5, hence open by (T2).
By steps 1.3 and 1.4, satisfies (B1), since forces , and (B2), since may be taken as .
Steps 2.1, 2.2 and 2.3 make a topology on whenever (B1) and (B2) hold, and step 1.5 then makes a basis for it and identifies with the family of unions of subfamilies of ; so (B1) and (B2) are sufficient.
Step 2.4 shows (B1) and (B2) are necessary, and step 2.5 shows that any topology having as a basis equals , which is the asserted uniqueness; with step 3.1 this proves claim 1.
By step 2.6 and step 3.1 applied to , the family is a topology on with basis , and it contains by step 1.3 and step 1.5.
Let be any topology on with ; then , because by (T1) covers the empty intersection and (T3) iterated covers the intersections of members of , and hence by (T2), every member of the former being a union of members of .
By steps 4.2 and 5.1 the topology contains and is contained in every topology containing , so it is the coarsest such topology, that is ; with step 2.6 this proves claim 2.
Remarks
-
What (B1) and (B2) are not. (B2) does not say that is closed under intersections; it says only that the intersection of two members is a union of members. The basis of open intervals of 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 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 , 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: is a subbasis for and a basis for it exactly when already satisfies (B1) and (B2).
Depends on
Used by
- Refuted, assuming countable choice: every Hausdorff space built from ordinal spaces is normal. The deleted Tychonoff plank ((ω₁ + 1) × (ω + 1)) ∖ {(ω₁, ω)} is Hausdorff and not normal Counterexample
- The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V) = {f : f[K] ⊆ V} Definition
- The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology Definition
- The lower-limit topology on ℝ, with the half-open intervals [a,b) as a basis Definition
- The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua Definition
- The order topology on an ordinal, with the half-open intervals (α, β] and the initial segments [0, β] as a basis Definition
- The product set ∏_i ∈ I Xᵢ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space Definition
- The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X Definition
- The topology of pointwise convergence on Y^X, which is the product topology, and its restriction to C(X,Y) Definition
- For the lower-limit line, χ=d=L=c=ℵ₀ and w=2^ℵ₀ under choice Example
- ℝ with the half-open intervals [a,b) as a basis is not compact and, assuming the Axiom of Countable Choice, is Lindel"of, while its square is not Lindel"of, the antidiagonal being an uncountable closed discrete subspace Example
- The discrete and indiscrete topologies, their closures and interiors, and their continuous maps in each direction Example
- The order topology on a totally ordered set, with the open rays as a subbasis, and its agreement with the usual topology of ℝ Example
- The Sorgenfrey line: ℝ with the half-open intervals [a,b) as a basis is strictly finer than the usual topology, is first countable, has a countable dense subset, and its sequences converge only from the right Example
- The Sorgenfrey plane: the product of two half-open-interval lines has the rectangles [a,b) × [c,d) as a basis and ℚ × ℚ as a countable dense subset Example
- Under choice, the Niemytzki plane is Tychonoff and locally metrizable but not normal, paracompact, or metrizable Example
- Assuming countable choice, refuted: Lindelöfness is productive False statement
- FALSE: the compact-open topology on C(X,Y) is metrizable for every metric X and Y False statement
- FALSE: the evaluation map on C(X,Y) with the compact-open topology is continuous for every metric X False statement
- Refuted: every separable space is second countable False statement
- Refuted: separability is hereditary False statement
- A sequence converges in the topology of pointwise convergence exactly when it converges at every point Lemma
- If (Uᵣ)_r ∈ D are open with overlineUᵣ ⊆ Uₛ whenever r < s and U₁ = X, then x ↦ inf{ r ∈ D : x ∈ Uᵣ } is a continuous map X → [0,1], and no choice principle is used Lemma
- On an ordinal with its order topology the sets [0,β] and (α,β] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff Lemma
- The K-topology on ℝ, generated by the open intervals together with their complements of K = {1/(n+1) : n ∈ ℕ}, is T₁ and Hausdorff but not regular Lemma
- Tube lemma: if K is a compact subset of a metric space X, Z is a topological space and N is open in X × Z with K × {z₀} ⊆ N, then K × W ⊆ N for some open W ∋ z₀ Lemma
- Tube lemma: if K is compact and an open N ⊆ X × Z contains K × {z₀}, then N contains K × W for some open W ∋ z₀ Lemma
- The four live convention forks of general topology and which side this library takes on each Remark
- Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma Theorem
- Characteristic properties: a map into a space with the initial topology is continuous iff every composite with the defining family is, a map out of a space with the final topology is continuous iff every composite with the defining family is, and the two topologies are respectively the coarsest and the finest making that family continuous Theorem
- For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(overlineA) ⊆ overlinef(A) Theorem
- For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence Theorem
- If f : X × Z → Y is continuous then its transpose F : Z → C(X,Y), F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on X beyond being metric Theorem
- If X is a locally compact metric space then the evaluation map is continuous for the compact-open topology Theorem
- On C(X,Y) with X and Y metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence Theorem
- Products commute with subspaces; for infinite nonempty families, the closure identity overline∏ Aᵢ=∏ overlineAᵢ uses the Axiom of Choice Theorem
- The box topology is finer than the product topology, the two agree for a finite index set in ZF, and, assuming the Axiom of Choice for nonempty factors, the box topology is strictly finer whenever infinitely many factors have a nonempty proper open subset Theorem
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
- Base (topology) (Wikipedia) (standard reference, not scraped)
- Subbase (Wikipedia) (standard reference, not scraped)
- J. Munkres, Topology, 2nd ed., §13 (standard reference, not scraped)