Let denote the directed Cayley graph on the positive coordinate basis, equivalently the Cartesian product of directed cycles of length . The equal side directed Hamilton decomposition problem asks when the arc set of partitions into directed Hamilton cycles. We prove that such a decomposition exists for every and every odd , settling the equal side directed Hamilton decomposition problem at all odd moduli. The proof combines root flat certificate theorem, a prefix count primitivity criterion, and a modular trade lifting theorem with two closure principles: the Cartesian product and the successor step . Together these propagate the small base dimensions to all . The boundary cases and , where the prefix-count family saturates its zero symbol budget, are handled by explicit non prefix zero set root flat certificates whose zero set compiler. An accompanying Lean 4 formalization verifies the main theorem and the finite certificate predicates.

生成讲解博客的中文版本

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