Every three binary splits append a continued-fraction digit
ProvedFreiman.upper_tree_word_growthcontinued-fractionshall-raynumber-theory
At depth r the accumulated positive-digit prefix has length at least floor(r/3), for all initial states and prefixes.
Preamble
import Definitions.Def_Freiman_upperModel
Formal statement
namespace Freiman
theorem upper_tree_word_growth (p : List ℕ+) (k : Fin 5) (w : List Bool) :
w.length / 3 ≤ (upperStateAt ⟨p, k⟩ w).word.length := by
sorry
end FreimanSource
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, Part IV, active source report/source/staging/parts/m2a.tex. Paragraph after m2a:ratio-table.