Basis for a topology
From Maths
Revision as of 01:47, 22 September 2016 by Alec (Talk | contribs) (Refactored page, preliminary version)
Grade: A
This page is currently being refactored (along with many others)
Please note that this does not mean the content is unreliable. It just means the page doesn't conform to the style of the site (usually due to age) or a better way of presenting the information has been discovered.
The message provided is:
The message provided is:
Updating with findings.
Contents
[hide]Definition
Let (X,J) be a topological space and let B∈P(P(X)) be any collection of subsets of X[Note 1]. We say B is a basis for the topology J if both of the following are satisfied:
- ∀B∈B[B∈J]
- ∀U∈J∃{Bα}α∈I⊆B[⋃α∈IBα=U]
Topology generated by a basis
Let X be a set and let B∈P(P(X)) be any collection of subsets of X, then:
- (X,{⋃A | A∈P(B)}) is a topological space with B being a basis for the topology {⋃A | A∈P(B)}
- we have both of the following conditions:
See also
Notes
- Jump up ↑ We could say something else instead of B∈P(P(X)):
- Let B∈P(J) - so B is explicitly a collection of open sets, then we could drop condition 1. Or!
- Let B⊆J. But it is our convention to not say "let A⊆B" but "let A∈P(B)" instead. To emphasise that the power-set is possibly in play.
That is a weird way of saying if we have a structure (eg topological space, measurable space, so forth) say (A,B) we usually deal with (collections of) subsets of A and specify they must be in B. - Jump up ↑ By the implies-subset relation ∀x∈X∃B∈B[x∈B] really means X⊆⋃B, as we only require that all elements of X be in the union. Not that all elements of the union are in X. However:
- B∈P(P(X)) by definition. So clearly (or after some thought) the reader should be happy that B contains only subsets of X and he should see that we cannot as a result have an element in one of these subsets that is not in X.
- We then use Union of subsets is a subset of the union (with Bα:=X) to see that ⋃B⊆X - as required.
- Jump up ↑ We could of course write:
- ∀U,V∈B ∀x∈⋃B ∃W∈B[(x∈U∩V)⟹(x∈W∧W⊆U∩V)]
- Jump up ↑ Suppose that U,V∈B are given but disjoint, then there are no x∈U∩V to speak of, and x∈W may be vacuously satisfied by the absence of an X, however:
- x∈W⊆U∩V is taken to mean x∈W and W⊆U∩V, so we must still show ∃W∈B[W⊆U∩V]
- This is not always possible as W would have to be ∅ for this to hold! We do not require ∅∈B (as for example in the metric topology)
- x∈W⊆U∩V is taken to mean x∈W and W⊆U∩V, so we must still show ∃W∈B[W⊆U∩V]
References
|
OLD PAGE
Definition
Let X be a set. A basis for a topology on X is a collection of subsets of X, B⊆P(X) such that[1]:
- ∀x∈X∃B∈B[x∈B] - every element of X belongs to at least one basis element.
- ∀B1,B2∈B,x∈X ∃B3∈B[x∈B1∩B2⟹(x∈B3∧B3⊆B1∩B2)][Note 1] - if any 2 basis elements have non empty intersection, there is a basis element within that intersection containing each point in it.
Note that:
- The elements of B are called basis elements[1]
Topology generated by B
If B is such a basis for X, we define the topology J generated by B[1] as follows:
- A subset of X, U⊆X is considered open (equivalently, U∈J) if:
- ∀x∈U∃B∈B[x∈B∧B⊆U][Note 2]
[Expand]
Claim: This (J) is indeed a topology
See also
Notes
- Jump up ↑ This is a great example of a hiding if-and-only-if, note that:
- (x∈B3∧B3⊆B1∩B2)⟹x∈B1∩B2 (by the implies-subset relation) so we have:
- (x∈B3∧B3⊆B1∩B2)⟹x∈B1∩B2⟹(x∈B3∧B3⊆B1∩B2)
- Thus (x∈B3∧B3⊆B1∩B2)⟺x∈B1∩B2
- (x∈B3∧B3⊆B1∩B2)⟹x∈B1∩B2 (by the implies-subset relation) so we have:
- Jump up ↑ Note that each basis element is itself is open. This is because U is considered open if forall x, there is a basis element containing x with that basis element ⊆U, if U is itself a basis element, it clearly satisfies this as B⊆B
TODO: Make this into a claim
References
- ↑ Jump up to: 1.0 1.1 1.2 Topology - Second Edition - James R. Munkres