I'm struggling to prove the regular expression identity $$(a(a+b)^*)^* = (ab^*)^*$$
The recommendation is to use induction on the star operator. My strategy was to first prove that $$(a(a+b)^*)^* \subseteq (ab^*)^*$$ and then prove $$(ab^*)^* \subseteq (a(a+b)^*)^*$$
I started with the first one, using induction on the inner start of the left side. So the base case is: $$(a\epsilon)^* \subseteq (ab^*)^*$$ Which holds. Then For the inductive hypothesis I assume: $$(aX)^*\subseteq(a)$$ And then set out to prove $$(aX(a+b)^*)^* \subseteq (ab^*)^*$$ Now I know there is a set identity that would make it sufficient to prove: $$(aX(a+b)^*) \subseteq (ab^*)$$ Then by the I.H: $$(a(ab^*)^*(a+b)^*) \subseteq (ab^*)$$ And this is as far as I've been able to get! I don't know how to manipulate what I have here to reach the goal. Am I on the right track? Any hints, identities that could be useful to help me finish this proof. Thanks.
$a(a + b)^*$ is a followed by any number of a's and b's.
$((a(a + b)^*)^*$ is the same with the addition of the empty string.
$(ab^*)^*$ includes the empty string and any string of a's and b's begining with a.
So the regular expressions are equivalent.
The advise of induction with * is confusing.
Do they mean double induction for the iterated use of *?
This Mathjax thing can be obnoxious when the preview is different than how the answer appeares, thus requiring additional, unexpected editing.