Let assume "m" is the minimum pumping lemma.

Let take the string a$^m$.b$^m$, so only all a's part is covered, now you take any string in that part as y.. You repeat it, you find the strings which are not in the language. Hence given language is not regular