Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execute bounded rational interval reconstruction

Proved
Lax109476Proofs.RamRationalReconstruction.reconstruct_spec_native

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

Let ℓ,u\ell,uℓ,u be rational endpoints with u≥0u\ge0u≥0, each of height at most 2S2^S2S, and let DDD be a natural denominator bound. Suppose the reconstruction stack has length NNN covering the source’s depth bound, the host width meets the reconstruction bound and D<2wD<2^wD<2w. The fixed native reconstruction command returns exactly

out⁡=reconstruct⁡(ℓ,u,D),\operatorname{out}=\operatorname{reconstruct}(\ell,u,D),out=reconstruct(ℓ,u,D),

with the source’s full optional-result encoding and instruction bound Treconstruct(S)T_{\rm reconstruct}(S)Treconstruct​(S). This equality covers every endpoint pair satisfying the stated bounds; no promised rational witness is required.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBoundsInterfaces
namespace Lax109476Proofs.RamRationalReconstruction
end Lax109476Proofs.RamRationalReconstruction
Formal statement
theorem Lax109476Proofs.RamRationalReconstruction.reconstruct_spec_native : ∀ (S N w D : Nat) (l u : Rat),
  @LE.le Rat Rat.instLE (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0))) u →
    Lax109476Proofs.RationalArithmeticBounds.Height l
        (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
          (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) S) →
      Lax109476Proofs.RationalArithmeticBounds.Height u
          (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
            (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) S) →
        @LE.le Nat instLENat
            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (Lax109476Proofs.RamRationalReconstruction.depthBound S)
              (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
            N →
          @LE.le Nat instLENat (Lax109476Proofs.RamRationalReconstruction.wordWidth S) w →
            @LT.lt Nat instLTNat D
                (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                  (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w) →
              Lax808846Proofs.Reasoning.Spec
                (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                  (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
                (fun (σ : Lax808846Proofs.Imp.Env) =>
                  And (Lax109476Proofs.RamRationalScalars.Value "recon.lo" l σ)
                    (And (Lax109476Proofs.RamRationalScalars.Value "recon.hi" u σ)
                      (And (@Eq Nat (σ.vars "recon.bound") D) (@Eq Nat (@List.length Nat (σ.arrs "cf.stack")) N))))
                Lax109476Proofs.RamRationalReconstruction.reconstruct
                (fun (x τ : Lax808846Proofs.Imp.Env) =>
                  Lax109476Proofs.RamReconstructionRecord.Output
                    (Lax109476Proofs.RationalReconstruction.reconstruct l u D) τ)
                (Lax109476Proofs.RamRationalReconstruction.instructionBound S) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamRationalReconstruction.lean, theorem Lax109476Proofs.RamRationalReconstruction.reconstruct_spec, line 34

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