No, in general you cannot just check $a$ and $b$. It’s not enough to check all elements in a generating set for $G$.
In general, if $G$ is generated by a set $X$, and $H$ is a subgroup, to check that $H$ is a normal subgroup it is enough to do one of two things:
- Check that for each $x\in X$ we have $xHx^{-1}=H$; or
- Check that for each $x\in X$, we have both $xHx^{-1}\subseteq H$ and $x^{-1}Hx\subseteq H$.
It is not enough to check that for every $x\in X$ you have $xHx^{-1}\subseteq H$, which is what you are proposing. For example, you can see this previous answer to show that in general, the set of elements such that $xHx^{-1}\subseteq H$ need not be closed under inverses, so you could end up with the semigroup generated by $X$ rather than all of $G$ if you only check $xHx^{-1}\subseteq H$.
That said, in the finite case it will be enough to check $xHx^{-1}\subseteq H$ for every $x\in X$, because the fact that $H$ is finite guarantees you get equality, so you are in fact verifying item 1 above.
Likewise, say you have a generating set $Y$ for $H$. In that case, it is enough to check $gyg^{-1}\in \langle Y\rangle$ for all $y\in Y$ and all $g\in G$. That suffices, because you get an arbitrary power of $y$ because $(gyg^{-1})^k = gy^kg^{-1}$ for all integers $k$, so if $gyg^{-1}\in H$, then $gy^kg^{-1}\in H$.
So, if $G=\langle X\rangle$, and $H=\langle Y\rangle$, it is enough to check that:
- For all $y\in Y$, for all $g\in G$, $gyg^{-1}\in H$; or
- For all $y\in Y$ and all $x\in X$, both $xyx^{-1}\in H$ and $x^{-1}yx\in H$.