The recursive tree implements the five physical split rows
ProvedFreiman.upper_tree_split_identificationcontinued-fractionshall-raynumber-theory
At each node, the recursive finite state, including the parity-dependent interchange of physical sides, gives exactly the parent and children in the corresponding prefixed deletion row.
Preamble
import Definitions.Def_Freiman_upperModel
Formal statement
namespace Freiman
theorem upper_tree_split_identification (p : List ℕ+) (k : Fin 5) (w : List Bool) :
let s := upperStateAt ⟨p, k⟩ w; let D := upperImageSplit s.word (upperRows s.row);
upperTree p k w = D.parent ∧
upperTree p k (w ++ [false]) = D.left ∧
upperTree p k (w ++ [true]) = D.right := 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. Binary deletion order after m2a:endpoint-identities.