The Critical Factorization Theorem is a fundamental result in combinatorics on words that relates the presence of local repetitions within a word to the overall periodicity of the word.