Freiman.lowerEarlyTerminal_short_contacts
ProvedFreiman.lowerEarlyTerminal_short_contactshall-raynumber-theory
Read every consecutive two-way contact from the finite short-route requirements.
Preamble
import Definitions.Def_Freiman_lowerEarlyTerminalGeometry open Freiman
Formal statement
theorem Freiman.lowerEarlyTerminal_short_contacts (C : LowerEarlyTerminalCatalog) (p : LowerPair) (mode : ℕ) (hm : mode<2)
(h : lowerEarlyTerminalRequiredSound C p mode) (ha : lowerEarlyTerminalAt p (lowerEarlyTerminalHyp C mode))
(ho : ∀ w : LowerPair, lowerEndpoint w false ≤ lowerEndpoint w true)
(hcontact : ∀ a b, lowerEarlyTerminalKindHolds p (.compare (section14LabelWords a) true (section14LabelWords b) false false) →
lowerEarlyTerminalKindHolds p (.compare (section14LabelWords b) true (section14LabelWords a) false false) →
lowerEarlyTerminalContact p a b) :
(if mode=0 then lowerEarlyTerminalFirst else lowerEarlyTerminalSecond).IsChain (lowerEarlyTerminalContact p) := 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.