regular languages – Is (a+b)* and (ab)* same in finite automata?


Regular language of (a+b)* and (ab)* are:
(a+b)* = { ε, a, b, aa , ab , bb , ba, aaa, …}
(ab)* = { ε, a, b, aa, ab, ba, bb, aaa, … }

I am new to Finite automata and this simple notion is confusing me!
I didn’t find (a+b)* = (ab)* in rules of regular expressions.