Freiman.lowerEarlyTerminal_domain_laws
ProvedFreiman.lowerEarlyTerminal_domain_lawshall-raynumber-theory
Package the three suffix classes, incoming orientation and exact source rectangles. This step contains only finite catalog selection.
Preamble
import Definitions.Def_Freiman_lowerEarlyTerminalGeometry open Freiman
Formal statement
theorem Freiman.lowerEarlyTerminal_domain_laws (hc : ∀ t p, lowerState t p → lowerEarlyDomain p →
∃ i : Fin 3, lowerEnds (lowerNormalize p).1 (lowerEarlyTerminalShortCatalog i).leftContext)
(hf : ∀ t p, lowerState t p → lowerEarlyDomain p →
∀ C ∈ [lowerEarlyTerminalEarly3,lowerEarlyTerminalState1,lowerEarlyTerminalState2,lowerEarlyTerminalTerminal3],
lowerEnds (lowerNormalize p).1 C.leftContext → lowerEarlyTerminalMatches p C)
(hr : ∀ t p, lowerState t p → lowerEarlyDomain p →
∀ C ∈ [lowerEarlyTerminalEarly3,lowerEarlyTerminalState1,lowerEarlyTerminalState2,lowerEarlyTerminalTerminal3],
lowerEnds (lowerNormalize p).1 C.leftContext →
certRectangleMem C.rectangle (lowerEarlyTerminalR p) (lowerEarlyTerminalS p)) :
LowerEarlyTerminalDomainLaws := 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.