Basis
basis for a set
a basis for a set is a collection
B
of subsets of
X
called basis elements such that
- for each
x
∈
X
, there is at least one basis element
B
containing
x
- if
x
belongs in the intersection of two basis elements
B
1
and
B
2
, then there is a basis element
B
3
containing
x
such that
B
3
⊆
B
1
∩
B
2
collection generated by a basis
Given a basis
B
we define the set
G
B
by
U
∈
G
B
iff for each
x
∈
U
there is a
B
∈
B
such that
x
∈
B
and
B
⊆
U
G
B
is a topology
The collection
G
B
is a topology
We will verify it's a topology from the definition
∅
is in
G
B
because it vacuously satisfies the condition.
X
is in
G
B
since given any point
x
∈
X
, we have a
B
∈
B
such that
x
∈
B
⊆
X
by the definition of a basis
Now suppose we have an arbitrary union of elements from
G
B
, say
S
⊆
G
B
,
M
=
⋃
U
∈
S
U
. We need to verify that
M
∈
G
B
, so let
x
∈
M
, therefore
x
∈
U
¯
for some
U
¯
∈
S
and since
U
¯
was assumed to be in
G
B
we know that there is some
B
∈
B
such that
x
∈
B
⊆
U
¯
but also
U
¯
⊆
M
since
M
includes
U
¯
in the union so then
x
∈
B
⊆
M
meaning by the definition that
M
∈
G
B
Now if we are given a finite intersection of elements from
G
B
we will prove by induction that it is also an element of
G
B
- base case
if
n
=
1
then the union of one element from
G
B
(namely just itself) is also an element of
G
B
trivially.
Before moving to the inductive step, notice that it also holds for
n
=
2
, because given
U
1
,
U
2
∈
G
B
, we can see that for any
x
∈
U
1
∩
U
2
, we know that we have a basis elements
B
1
,
B
2
∈
B
such that
x
∈
B
1
⊆
U
1
and
x
∈
B
2
⊆
U
2
and thus
x
also belongs to the intersection of
B
1
and
B
2
, so by the definition of a basis, we get a
B
3
⊆
B
1
∩
B
2
that contains
x
since
B
1
∩
B
2
⊆
U
1
∩
U
2
, we have
x
∈
B
3
⊆
U
1
∩
U
2
, which means that
U
1
∩
U
2
∈
G
B
- inductive step
Let
k
∈
N
1
and assume that the intersection of
k
elements from
G
B
is also in
G
B
now we'll show it's true for
k
+
1
. So consider the intersection
U
1
∩
…
∩
U
k
+
1
, then we can re-write it as
(
U
1
∩
…
∩
U
k
)
∩
U
k
+
1
so by our inductive hypothesis
(
U
1
∩
…
∩
U
k
)
∈
G
B
and therefore this
k
+
1
union is a union of two elements already in
G
B
so by our
n
=
2
argument
U
1
∩
…
∩
U
k
+
1
∈
G
B
, as needed.
topology generated by a basis
Since a collection generated by a basis turns out to be a topology we define
T
B
:=
G
B
and call it the topology generated by
B
basis for a topology
We say that
B
is a basis for a topology
T
when
T
B
=
T
. In this case we may also say that
B
generates
T
basis elements are open in a generated topology
Suppose we have the topology
T
B
, then given any
B
∈
B
,
B
∈
T
b
, in other words
B
⊆
T
B
Considering a topology generated by a basis
B
we can see that for any
B
∈
B
, we can use
B
itself such that for each
x
∈
B
, we have
B
so that
B
⊆
B
, to show that
B
∈
T
B
topology generated by a basis consists of unions
T
B
equals the collection of all unions of elements of
B
Symbolically we can write this collection of unions as
U
=
{
⋃
B
∈
S
B
:
S
⊆
C
}
Suppose we have a subset of elements from
B
called
S
, then for each
B
∈
S
it is open in
X
because it is a basis element, and therefore by the definition of a topology, as
⋃
B
⊆
S
B
is an arbitrary union of open sets it is also open in
X
, so we've shown that
U
⊆
T
B
We'll show the converse now, so suppose that
U
∈
T
B
, we want to prove that it's equal to an arbitrary union of elements of
B
.
Recall the definition of a topology generated by a basis so since
U
∈
T
B
then for each
x
∈
U
we have some
B
x
∈
B
with
x
∈
B
x
⊆
U
, therefore
U
=
⋃
x
∈
U
B
x
, and as a union of of elements of
B
thus
U
is an element of
U
so
T
B
⊆
U
.
basis criterion
Let
(
X
,
T
)
be a topological space. Suppose that
C
is a collection of open sets of
X
such that for each open set
U
of
X
and each
x
∈
U
, there is an element
C
of
C
such that
x
∈
C
⊆
U
. Then
C
is a basis and
T
C
=
T
We'll first show that
C
is a basis, so let
x
∈
X
, but
X
is open and so we can use
X
as the element of
C
satisfying
x
∈
X
⊆
X
.
Now let
C
1
,
C
2
be elements of
C
and now consider
C
1
∩
C
2
, since it's a finite intersection, then we know it's also open in
X
from the definition of a topology.
Since
C
1
∩
C
2
is open, let
x
∈
C
1
∩
C
2
, then by the definition of
C
, there is some
C
∈
C
such that
x
∈
C
⊆
C
1
∩
C
2
, so we can take
B
3
=
C
in the definition of basis, to see that the second condition is satisfied, and thus we know that
C
is a basis
Now we want to show that
T
C
=
T
. So suppose
U
∈
T
C
, then it can be written as a union as elements from
C
, but since
C
was defined to consist of open sets of
X
, then this union is also open with respect to
X
by the definition of a topology.
Now suppose that
U
∈
T
and consider some
x
∈
U
then by the definition of
C
, there is some
C
∈
C
such that
x
∈
C
⊆
U
, looking back at the definition for a topology generated by a basis, we can see this means
U
∈
T
C
, as needed.
basis finer equivalence
Let
B
and
B
′
be bases for the topologies
T
and
T
′
, respectively on
X
. Then the following are equivalent:
-
T
′
is finer than
T
- for each
x
∈
X
and each basis element
B
∈
B
containing
x
there is a basis element
B
′
∈
B
′
such that
x
∈
B
′
⊆
B
TODO
topology equality with basis
Given two bases
B
and
B
′
for the toplogies
T
and
T
′
on
X
, then
T
=
T
′
if and only if all of the following hold:
- for each
x
∈
X
and each basis element
B
∈
B
containing
x
there is a basis element
B
′
∈
B
′
such that
x
∈
B
′
⊆
B
- for each
x
∈
X
and each basis element
B
′
∈
B
′
containing
x
there is a basis element
B
∈
B
such that
x
∈
B
⊆
B
′
TODO
standard topology on
R
n
Let
B
be the collection of all sets of the form
{
y
∈
R
n
:
‖
x
−
y
‖
<
ϵ
}
for any
x
∈
R
n
and
ϵ
∈
R
>
0
, then the topology generated by
B
is called the standard topology on the
R
n
. Whenever we consider
R
n
, we shall suppose it is given this topology unless we specifically state otherwise
lower limit topology on R
If B is the collection of all half-open intervals of the form
[a, b) = {x | a ≤ x \lt b}, where a \lt b, the topology generated by B is called the lower limit topology on R.
When R is given the lower limit topology, we denote it by Rl
K topology
Finally let K denote the
set of all numbers of the form 1/n, for n ∈ Z+, and let B be the collection of all open
intervals (a, b), along with all sets of the form (a, b) − K. The topology generated
by B will be called the K-topology on R. When R is given this topology, we denote
it by RK
subbasis
A subbasis
S
for a topology on
X
is a collection of subsets of
X
whose union equals
X
. The topology generated by the subbasis
S
is defined to be the collection
T
of all unions of finite intersections of elements of
S
topology generated by a subbasis
Given a subbasis
S
, we know that this induces a basis
B
S
, and therefore a topology
T
B
S
which we call the topology generated by the subbasis
S
.
subbasis for a topology
We say that
S
is a subbasis for the topology
T
when
T
B
S
=
T