Notes:Basis for a topology/McCarty
Overview
After finding out that base/subbase are terms (and the book I saw them in wasn't the odd one out) I've decided to note what the book says here.
Things make a lot more sense now.
Statements
Definition: Basis / Base
Let (X,J) be a topological space, let B⊆J. We say B is a base or basis for J if[1]:
- ∀U∈J∃{Bα}α∈I⊆B[U=⋃α∈IUα] - all open sets are unions of elements of B
Claim: J is smallest topology containing B
Suppose K is another topology on X and B⊆K, then:
- J⊆K
- Caution:I do not see this - YET
Obviously, you can't just pick some random elements of J and call them a basis. That leads to the next theorem:
Theorem: Conditions for a collection of sets to be a basis for a topology
A collection, B of sets is a base/basis for some topology J on ⋃B if and only if:
- ∀S,T∈B∀x∈S∩T∃U∈B[x∈U⊆S∩T]
Terminology: Subbase/subbasis
If A is an arbitrary family of sets then B - the family of all finite intersections of elements of A[Note 1] - is a base for a topology, J on ⋃B.
- We call A a subbase/subbasis for J.
Corollary / Claim: subbase/subbasis conditions
The family A is a subbase/subbasis for J if and only if:
- A⊆J and
- For each member of J the member is the union of (finite intersections of elements of A)
Applications to continuity
Theorem
Suppose f:X→Y is a function between two topological spaces, (X,J) and (Y,K). Let A be a sub-basis for K, then:
- f is continuous if and only if ∀A∈A[f−1(A)∈J]
TODO: I really need to create the pages that show the pre-image of functions preserves things like unions and intersections
References
Notes
- Jump up ↑ Note that the "convention" of taking the intersection of no sets as the entire set (or union of all of the elements of A) and the union of no sets as the empty set mean this is okay