ΘρϵηΠατπ

Basis for a Set

a basis for a set X is a collection ℬ of subsets of X called basis elements such that

  1. for each x∈X, there is at least one basis element B containing x
  2. if x belongs in the intersection of two basis elements B1 and B2, then there is a basis element B3 containing x such that B3⊆B1∩B2
Intervals With Rational Endpoints Are a Basis for the Real Numbers
The set 𝒥:={(a,b):a<b∈ℚ} is a basis for ℝ.

Let x∈ℝ, and consider the points x−1,x,x+1, so that we obain some j,k∈ℚ such that x−1<j<x<k<x+1 so x∈(j,k)∈𝒥

Now suppose that x∈J1∩J2 for some J1,J2∈𝒥 since they are both intervals then so is their intersection, therefore take J3=J1∩J2, to see why this works, if J1=(a,b),J2=(c,d) then the possibilities for J1∩J2 are (a,b),(c,d),(c,b),(a,d), in any such case we obtain an interval with rational end points, and thus this shows x∈J3⊆J1∩J2 and that J3∈𝒥

Half Open Intervals With Rational Endpoints Are a Basis for the Real Numbers
The set {[a,b):a<b∈ℚ} is a basis for ℝ
For any x∈ℝ then x∈[x,x+1), additionally given some x∈[a,b)∩[c,d) then since their intersection is non-empty we deduce that [a,b)∩[c,d)=[i,j) where (i,j)∈{(a,b),(c,d),(a,d),(c,b)} and therefore this will be our basis element contained in the intersection containing x.
collection generated by a basis
Given a basis ℬ we define the set Gℬ by U∈Gℬ iff for each x∈U there is a B∈ℬ such that x∈B and B⊆U
Gℬ is a topology
The collection Gℬ is a topology

We will verify it's a topology from the definition

∅ is in Gℬ because it vacuously satisfies the condition. X is in Gℬ since given any point x∈X, we have a B∈ℬ such that x∈B⊆X by the definition of a basis

Now suppose we have an arbitrary union of elements from Gℬ, say S⊆Gℬ,M=⋃U∈SU. We need to verify that M∈Gℬ, so let x∈M, therefore x∈U for some U∈S and since U was assumed to be in Gℬ we know that there is some 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ℬ

Now if we are given a finite intersection of elements from Gℬ we will prove by induction that it is also an element of Gℬ

  • base case
  • if n=1 then the union of one element from Gℬ (namely just itself) is also an element of Gℬ trivially.

    Before moving to the inductive step, notice that it also holds for n=2, because given U1,U2∈Gℬ, we can see that for any x∈U1∩U2, we know that we have a basis elements B1,B2∈ℬ such that x∈B1⊆U1 and x∈B2⊆U2 and thus x also belongs to the intersection of B1 and B2, so by the definition of a basis, we get a B3⊆B1∩B2 that contains x since B1∩B2⊆U1∩U2, we have x∈B3⊆U1∩U2, which means that U1∩U2∈Gℬ

  • inductive step
  • Let k∈ℕ1 and assume that the intersection of k elements from Gℬ is also in Gℬ now we'll show it's true for k+1. So consider the intersection U1∩…∩Uk+1, then we can re-write it as (U1∩…∩Uk)∩Uk+1 so by our inductive hypothesis (U1∩…∩Uk)∈Gℬ and therefore this k+1 union is a union of two elements already in Gℬ so by our n=2 argument U1∩…∩Uk+1∈Gℬ, as needed.

topology generated by a basis
Since a collection generated by a basis turns out to be a topology we define 𝒯ℬ:=Gℬ and call it the topology generated by ℬ
basis for a topology
We say that ℬ is a basis for a topology 𝒯 when 𝒯ℬ =𝒯. In this case we may also say that ℬ generates 𝒯
basis elements are open in a generated topology
Suppose we have the topology 𝒯ℬ, then given any B∈ℬ, B∈T𝒷, in other words ℬ⊆Tℬ
Considering a topology generated by a basis ℬ we can see that for any B∈ℬ, we can use B itself such that for each x∈B, we have B so that B⊆B, to show that B∈𝒯ℬ
Topology Generated by a Basis Consists of Unions
𝒯ℬ equals the collection of all unions of elements of ℬ, that is: 𝒯ℬ={⋃B∈𝒮B:𝒮⊆ℬ}

The the set on the right hand side be denoted as 𝒰, we will start by showing that 𝒰⊆𝒯ℬ.

Suppose we have a subset of elements from ℬ called 𝒮, then for each B∈𝒮 it is open in X because it is a basis element, and therefore by the definition of a topology, as ⋃B⊆𝒮B is an arbitrary union of open sets it is also open in X, so we've shown that 𝒰⊆𝒯ℬ

We'll show the converse now, so suppose that U∈𝒯ℬ, we want to prove that it's equal to an arbitrary union of elements of ℬ.

Recall the definition of a topology generated by a basis so since U∈𝒯ℬ then for each x∈U we have some Bx∈ℬ with x∈Bx⊆U, therefore U=⋃x∈UBx, and as a union of of elements of ℬ thus U is an element of 𝒰 so 𝒯ℬ⊆𝒰.

basis criterion
Let (X,𝒯) be a topological space. Suppose that 𝒞 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 𝒞 such that x∈C⊆U. Then 𝒞 is a basis and 𝒯𝒞=𝒯

We'll first show that 𝒞 is a basis, so let x∈X, but X is open and so we can use X as the element of 𝒞 satisfying x∈X⊆X.

Now let C1,C2 be elements of 𝒞 and now consider C1∩C2, since it's a finite intersection, then we know it's also open in X from the definition of a topology.

Since C1∩C2 is open, let x∈C1∩C2, then by the definition of 𝒞, there is some C∈𝒞 such that x∈C⊆C1∩C2, so we can take B3=C in the definition of basis, to see that the second condition is satisfied, and thus we know that 𝒞 is a basis

Now we want to show that 𝒯𝒞=𝒯. So suppose U∈𝒯𝒞, then it can be written as a union as elements from 𝒞, but since 𝒞 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∈𝒯 and consider some x∈U then by the definition of 𝒞, there is some C∈𝒞 such that x∈C⊆U, looking back at the definition for a topology generated by a basis, we can see this means U∈𝒯𝒞, as needed.

basis finer equivalence
Let ℬ and ℬ′ be bases for the topologies 𝒯 and 𝒯′, respectively on X. Then the following are equivalent:
  1. 𝒯′ is finer than 𝒯
  2. for each x∈X and each basis element B∈ℬ containing x there is a basis element B′∈ℬ′ such that x∈B′⊆B
TODO
topology equality with basis
Given two bases ℬ and ℬ′ for the toplogies 𝒯 and 𝒯′ on X, then 𝒯=𝒯′ if and only if all of the following hold:
  • for each x∈X and each basis element B∈ℬ containing x there is a basis element B′∈ℬ′ such that x∈B′⊆B
  • for each x∈X and each basis element B′∈ℬ′ containing x there is a basis element B∈ℬ such that x∈B⊆B′
TODO
The Real Intervals With Rational Endpoints Generate Generate the Standard Topology
The countable basis for ℝ : {(a,b):a<b∈ℚ} generates the standard topology on ℝ
We will prove that they are equal by comparing the basis elements, so let x∈ℝ and suppose that x∈(a,b) with a<b∈ℚ, then (a,b) itself is an element of the standard basis for ℝ. Also note that given any x∈ℝ and some open interval such that: x∈(c,d) where c<d∈ℝ then by considering the pairs c,x and x,d we obtain some j,k∈ℚ between those pairs then x∈(j,k)⊆(a,b) therefore the topologies they generate are the same.
The Topology Generated by the Half Open Intervals With Rational Endpoints Is Strictly Corser Lower Limit Topology
Let ℬ={[a,b):a<b∈ℚ}, then 𝒯ℬ⊂𝒯ℓ

We will show that 𝒯ℬ⊂𝒯ℓ by showing 𝒯ℬ⊆𝒯ℓ and 𝒯ℬ≠𝒯ℓ.

Let x∈ℝ and [a,b)∈ℬ such that x∈[a,b) then the interval [a,b) considered with endpoints in ℝ is a basis element of the lower limit topology and is contained within it trivially and so we deduce that 𝒯ℬ⊆𝒯ℝ.

Now we'll prove that 𝒯ℬ≠𝒯ℓ, to do this we will use the contrapositive of this corollary. So consider x=2, then [2,2) is a basis element from the lower limit topology that contains 2 but there is no element from the rational lower limit basis that contains this element and is also contained within [2,2) to see why suppose for the sake of contradiction there was one, of the form [q,p) if it contains 2 then we must have that q≤2<p but since we require that [q,p)⊆[2,2) it implies that 2≤q so we must have that q=2 but that's a contradiction since q∈ℚ

standard topology on ℝn
Let ℬ be the collection of all sets of the form {y∈ℝn:‖x−y‖<ϵ} for any x∈ℝn and ϵ∈ℝ>0, then the topology generated by ℬ is called the standard topology on the ℝn. Whenever we consider ℝ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 𝒯 of all unions of finite intersections of elements of S
intersections of subbasis elements forms a basis
Given a subbasis S, then the collection of finite intersections of elements of S is a basis, which we denote by ℬS
TODO
topology generated by a subbasis
Given a subbasis S, we know that this induces a basis ℬS, and therefore a topology 𝒯ℬ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 𝒯 when 𝒯ℬS=𝒯
The Topology Generated by a Basis Equals the Intersection of All Topologies That Contain That Basis
Let 𝒜 be a basis, and let 𝐀 be the collection of all topologies 𝒯 such that 𝒜⊆𝒯, then 𝒯𝒜=⋂𝐀

Recall that 𝒜⊆𝒯𝒜 therefore 𝒯𝒜∈𝐀 therefore ⋂𝐀⊆𝒯𝒜

Now let U∈𝒯𝒜, therefore it is a union of elements from 𝒜, but since each 𝒯∈𝐀 contains 𝒜 they also contain unions of elements of 𝒜 and therefore U∈⋂𝒯𝒜