Explain the theoretical definition of the empty string, often denoted as epsilon or lambda, and distinguish it from the empty language. Discuss its necessity in the construction of finite automata and regular expressions, specifically addressing why it must be included in the alphabet's closure.