The finite parity policy is extremal in each of the six reference phases
ProvedFreiman.background_phase_policycontinued-fractionsmarkov-spectrumnumber-theory
For each reference phase, a digit at most four which does not complete 31313 and which is not four at an odd zero-based position is bounded by the greedy reference digit in the required alternating order.
Preamble
import Definitions.Def_Freiman_backgroundWords
Formal statement
namespace Freiman
theorem background_phase_policy (r : Bool) (n : ℕ) (d : ℕ+) (hd : BackgroundCandidate r n d) :
if Even n then backgroundReference r n ≤ d else d ≤ backgroundReference 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.