Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Freiman late: mixed natural-tail selected-mode identity

Proved
Freiman.late_mixed_natural_endpoint_from_width_cf

by Koki Yamada · Sep 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-certificatesfreimanhall-raylate

This is the natural-tail case of the mixed-parity late endpoint identity. For a matching cover and a recorded late endpoint whose outward words have opposite length parity, write www for the strictly wider physical side after appending those words, or the left side in a width tie. If the requested endpoint direction is the opposite of the virtual-upper choice of www, then every selected mode whose bounds hold reconstructs the actual continued-fraction endpoint from the two natural 333 or 313131 tails of the original words, together with the unique complementary width orientation. Nonempty right additions make the 313131 representative agree with the physical suffix.

lateActualEndpoint(p,e)=lateActualValue(p,e).\mathrm{lateActualEndpoint}(p,e)=\mathrm{lateActualValue}(p,e).lateActualEndpoint(p,e)=lateActualValue(p,e).
Preamble
import Definitions.Def_Freiman_lateGeometry
import Mathlib.Tactic

set_option maxRecDepth 8000
set_option maxHeartbeats 0

open Freiman
Formal statement
theorem Freiman.late_mixed_natural_endpoint_from_width_cf (hcf : ∀ (w : List ℕ+) (z : CertField), 0 ≤ certFieldVal z → certFieldVal (lowerHistoryCF w z) = prefixEval w (certFieldVal z)) (hw : LowerHistoryWidthLaw) (p : LowerPair) (e : LateEndpoint) (hm : lateMatches p e.right3) (hne1 : e.words.1 ≠ []) (hne2 : e.words.2 ≠ []) (hv : lateEndpointValid lateCatalog e) (hp : lowerHistoryWordParity (lateContext e.right3) e.words false ≠ lowerHistoryWordParity (lateContext e.right3) e.words true) (hnat : e.upper ≠ ! lowerHistoryWordParity (lateContext e.right3) e.words (decide (¬ lowerWidth ((lowerNormalize p).2 ++ e.words.2) ≤ lowerWidth ((lowerNormalize p).1 ++ e.words.1)))) : ∀ ids ∈ e.modes, lateHolds (lateBounds lateCatalog ids) (lateR p) (lateS p) (lateQ p) → lateActualEndpoint p e.words e.upper = lateActualValue p e.value := by
  sorry
Source
Freiman report, §15, printed source pages 140–144; restriction of Freiman.late_mixed_endpoint_from_width_cf to the natural-tail branch of the mixed source list.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me