Changes

|}

|}

Let <math>S\!</math> be the set of rooted trees and let <math>S_0\!</math> be the 2-element subset of <math>S\!</math> that consists of a rooted node and a rooted edge. Expressed more briefly in various ways:

Let <math>S\!</math> be the set of rooted trees and let <math>S_0\!</math> be the 2-element subset of <math>S\!</math> that consists of a rooted node and a rooted edge.

{| align="center" cellpadding="10" style="text-align:center"

{| align="center" cellpadding="10" style="text-align:center"

|}

|}

Simple intuition, or a simple inductive proof, will assure us that any rooted tree can be reduced by way of the arithmetic initials either to a root node [[Image:Cactus Node Big Fat.jpg|16px]] or else to a rooted edge [[Image:Cactus Spike Big Fat.jpg|12px]]&nbsp;.

Simple intuition, or a simple inductive proof, assures us that any rooted tree can be reduced by way of the arithmetic initials either to a root node [[Image:Cactus Node Big Fat.jpg|16px]] or else to a rooted edge [[Image:Cactus Spike Big Fat.jpg|12px]]&nbsp;.

For example, consider the reduction that proceeds as follows:

For example, consider the reduction that proceeds as follows: