Alternative Equation Formats

$$\begin{array}{rl}[0,{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_1)& =\text{interval where }{T}_0\text{ (the full tree) has minimal cost complexity}\\ [{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_1,{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_2)& =\text{interval where }{T}_1\text{ has minimal cost complexity}\\ ⋮<!--\; ⋮\; --><span\; class="Comment\_comment\_\_N0+Yl"></span>& \\ [{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_m,\mathrm{\infty <!--\; \infty \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>})& =\text{interval where }{T}_m\text{ (the root node) has minimal cost complexity}\end{array}$$

$$\begin{array}{rl}[0,{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_1)& =\text{interval where }{T}_0\text{ (the full tree) has minimal cost complexity}\\ [{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_1,{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_2)& =\text{interval where }{T}_1\text{ has minimal cost complexity}\\ ⋮<!--\; ⋮\; --><span\; class="Comment\_comment\_\_N0+Yl"></span>& \\ [{\mathrm{\alpha <!--\; \alpha \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>}}_m,\mathrm{\infty <!--\; \infty \; --><span\; class="Comment\_comment\_\_N0+Yl"></span>})& =\text{interval where }{T}_m\text{ (the root node) has minimal cost complexity}\end{array}$$

\begin{align*} {[}0, \alpha _1) & = \mbox{interval where } T_0 \mbox{ (the full tree) has minimal cost complexity}\\ {[}\alpha _1, \alpha _2) & = \mbox{interval where } T_1 \mbox{ has minimal cost complexity}\\ \vdots & \\ {[}\alpha _ m, \infty ) & = \mbox{interval where } T_ m \mbox{ (the root node) has minimal cost complexity} \end{align*}