Proper-power language is not regular

Over an alphabet containing $a,b$, the language $\{w^n:n\ge 2\}$ is not regular language. Intersecting it with the regular language $a^{+}b{a}^{+}b$ gives exactlywhich fails the pumping lemma for regular languages.