The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each such number occurs in the tree exactly once and in the form , where are and are relatively prime positive integers. This tree is associated with the matrices $L_1 = \left( \begin{matrix} 1 & 0 \ 1 & 1 \end{matrix} \right)R_1 = \left( \begin{matrix} 1 & 1 \ 0 & 1 \end{matrix} \right)$, which freely generate the monoid of matrices with determinant 1 and nonnegative integral coordinates. For other pairs of matrices and that freely generate submonoids of , there are forests of infinitely many rooted infinite binary trees that partition the set of positive rational numbers, and possess a remarkable symmetry property.

生成讲解博客的中文版本

生成AI智能校验的中文版本