Freiman late: late normalizations from width

Proved

Freiman.late_normalizations_from_width

by tp · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-certificatesfreimanhall-raylate

Each intermediate fork digit is appended to the side that is actually wider at that cover. The strict reflected condition prevents swapping equal-width incoming sides.

Preamble

import Definitions.Def_Freiman_lateGeometry
import Mathlib.Tactic

set_option maxRecDepth 8000
set_option maxHeartbeats 0

open Freiman

Formal statement

theorem Freiman.late_normalizations_from_width (hw : LowerHistoryWidthLaw) : ∀ (p : LowerPair) (path : LatePath), latePathValid lateCatalog path → lateHolds (lateBounds lateCatalog path.required) (lateR p) (lateS p) (lateQ p) → ∀ n ∈ path.normalizations, lateNormalizationHolds p n := by
  sorry

Source

Freiman report, §15, printed source pages 140–144; active lower_140_144.tex and Appendix Complete finite certificates for printed pages 140–144 (late_certificates.tex); exact late_readable_certificates.json with both original cover_*_certificate.json trees.

View graph