One-digit continuant recurrence
ProvedFreiman.continuant_appendclassical-spectracontinued-fractionsfreiman-hall-rayproof-graph
Appending a digit gives exactly the two numerator and two denominator recurrences. This is the finite-word induction step in the report.
Preamble
import Definitions.Def_Freiman_continuants
Formal statement
namespace Freiman
theorem continuant_append (w : List ℕ+) (a : ℕ+) :
wordContinuantData (w ++ [a]) =
((wordContinuantP w, (a : ℕ) * wordContinuantP w + wordContinuantPrevP w),
(wordContinuantQ w, (a : ℕ) * wordContinuantQ w + wordContinuantPrevQ w)) := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, foundations.tex, §1.1, found:continuants