Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reverse finite list matches the backward convergent

Proved
Freiman.perron_backward_prefix

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

continued-fractionshall-raynumber-theory

The finite fraction of the reversed first n digits is exactly the nth convergent of the infinite backward word viewed from position n. This states the index and reversal convention needed by the existing perronValue definition.

Preamble
import Definitions.Def_Freiman_cfValue
Formal statement
namespace Freiman

theorem perron_backward_prefix (a : ℤ → ℕ+) (n : ℕ) :
    finiteCF (((List.range n).map (fun k : ℕ => a (k : ℤ))).reverse) =
      cfConvergent (fun k : ℕ => a ((n : ℤ) - (k : ℤ) - 1)) n := by
  sorry

end Freiman
Source
Freiman's Hall ray: Proof report and corrected English text, 8 September 2026, §1.1, printed p. 7, equations found:continuants and found:continuity and the finite-tail paragraph after found:local-values; §1.2, Theorem 1.3 for the Perron/local comparison.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me