The exact six-step state cycles of the two greatest-tail reference words
ProvedFreiman.background_reference_cyclescontinued-fractionsmarkov-spectrumnumber-theory
The period 131312 from the empty state and the period 131213 from state 3 follow exactly the six-state phase lists explicitly recorded in backgroundPhaseState. Each returns to its initial state and parity after six digits.
Preamble
import Definitions.Def_Freiman_backgroundWords
Formal statement
namespace Freiman
theorem background_reference_cycles (r : Bool) (n : ℕ) :
backgroundRun (backgroundReferenceState r)
((List.range n).map (backgroundReference r)) = some (backgroundPhaseState r n) := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, §1.4, Lemma 1.7 and its proof, printed pp. 11–12.