## Defining Basis

Out study and examples so far gave use 3 insights about the proposed idea of basis for a topology on X:

**Property**: It is a collection of subsets of X.**Property**: Union of elements in the collection is the whole of X.**Property**: All possible intersections is either empty or contained in the collection.**Synthesizing Topology**: We can synthesize a topology on X by taking*all possible unions of sets in the collection.*

Let’s try to frame a definition using these facts:

A X be a set. Then a collection of subsets of X is (almost) called a basis for a topology on X if

- Union of elements in the collection is the whole of X.
- All possible intersections is either empty or contained in the collection.

The topology generated by this basis is given by all possible union of elements of .

Why did I call it “Almost”? I’ll leave that as a mystery for now! I don’t think we need more examples, but let me give some!

### Example 1

Consider the set of all real numbers, and the collection . Clearly, it forms a basis (verify!) and the topology generated by it is .

In fact, this trick works with any set X with the collection where .

### Example 2

Consider any set X and consider the collection of all singleton subsets of X, say . Then generates discrete topology on X. (Verify!)

## A Very Intriguing Example 3

That’s a lot of dramatic build up for this example – in fact, it helps us reframe the definition of basis and make it more general! Before we begin, note that our second condition insists that either possible intersections is empty or it is contained in our basis.

Consider the set X = {1, 2, 3, 4, 5}. Let

Note that the condition 1 in definition is easily satisfied. But what about ! That means, second condition that either intersection is empty or is contained in seems to be false in this case!

But still, let’s try to find all possible unions and see if it forms a topology on X.

Absolutely curious, isn’t it? In fact, it’s time to rework our definition of basis a bit.