For the language $\{w \mid w \in \Sigma^\*, w \neq \lambda\}$, is the following regular expression correct?

$(a+b)^+$ . Which is $(a+b)$ to the power of $+$ which I think accepts all combinations of $a$ and $b$ except for the empty string.

Can someone please confirm?