Suppose we have a collection $\mathcal{E}$ containing some subsets of a nonempty set $E$. Assume $E \in \mathcal{E}$. Define $\hat{\mathcal{E}}$ to be the smallest collection containing elements of $\mathcal{E}$ and closed under countable intersections. It is clear that $\hat{\mathcal{E}}$ is simply the intersection of all collections containing elements of $\mathcal{E}$ and closed under countable intersections.
What can we say about the elements of $\hat{\mathcal{E}}$?
My hunch is that if $A \in \hat{\mathcal{E}}$, then $A$ is a countable intersection of elements of $\mathcal{E}$. I am unable to prove or disprove this claim though.
If the claim is false, then when can we say the above property holds? If $\mathcal{E}$ is countable, then the above property can be shown to be true.
Let $\mathcal{E}'$ be the collections of all countable intersections of elements of $\mathcal{E}$. We would like to show that $\mathcal{E}' = \hat{\mathcal{E}}$.
By definition $\mathcal{E}'$ contains all elements on $\mathcal{E}$ and is closed under countable intersections because a countable intersection of countable intersections is still a countable intersection. Since $\hat{\mathcal{E}}$ is the smallest collection with these properties, we have $\hat{\mathcal{E}} \subseteq \mathcal{E}'$. But $\hat{\mathcal{E}}$ contains all elements of $\mathcal{E}$, and hence must contain all countable intersections of elements in $\mathcal{E}$, so $\mathcal{E}' \subseteq \hat{\mathcal{E}}$, thus we have shown $\mathcal{E}' = \hat{\mathcal{E}}$.