Freiman.lowerEarlyTerminal_domain_context
ProvedFreiman.lowerEarlyTerminal_domain_contexthall-raynumber-theory
The actual normalized incoming words have the catalog suffix flags and equal common parity; ¬L prevents confusing a lone left1 context with suffix31.
Preamble
import Definitions.Def_Freiman_lowerEarlyTerminalGeometry open Freiman
Formal statement
theorem Freiman.lowerEarlyTerminal_domain_context (t : ℝ) (p : LowerPair) (hs : lowerState t p) (hd : lowerEarlyDomain p)
(C : LowerEarlyTerminalCatalog)
(hc : C ∈ [lowerEarlyTerminalEarly3,lowerEarlyTerminalState1,lowerEarlyTerminalState2,lowerEarlyTerminalTerminal3])
(he : lowerEnds (lowerNormalize p).1 C.leftContext) : lowerEarlyTerminalMatches p C := by
sorrySource
Freiman's Hall ray: Proof report and corrected English text (8 September 2026), pp.120–132, §§ s15:early-residual and s15:terminal-extension; pp.133–139, Proposition l139chain and Appendix app:l139cert.