A Simple Proof of the Collatz Conjecture Using Case Analysis and the Method of Minimal Counterexample

This preprint proposes a new proof strategy for the Collatz conjecture, based on a classification of odd numbers and their transitions under the Collatz operation. The convergence is demonstrated using transition rules between classes, combined with the method of minimal counterexample. This work is not peer-reviewed and is intended to present a novel theoretical framework.