In my work related to the axiom of choice one of the central notions is a filter of subgroups. Namely, if $G$ is a group, a filter of subgroups is a non-empty collection of subgroups which is closed under supergroups and finite intersections.
But we are not interested in any filter, but specifically in normal filters which satisfy the clause that if $g\in G$ and $H$ is in the filter, then $g Hg^{-1}$ is also in the filter.
Are there also ultrafilters (maximal proper filters) of subgroups? Certainly there are principal ones, e.g. all the groups which contain a certain element of $G$ is the principal ultrafilter generated by the subgroup $\langle g\rangle$. But are there free ultrafilters?
If there are, are there any normal ultrafilters (ultrafilters which are also normal), or do the two conditions clash in some way?
I know that we can think about the filters of subgroups as just filters on $G$ in the standard set theoretic sense, and then considering all the subgroups generated by sets in the filter. But this doesn't help me understand how might a free and normal ultrafilter of subgroups can look like, especially since this is not a bijection between the two notions (look at the case where a subgroup can be generated by two disjoint subsets).