Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial native execution of metric region rounding

Open
Lax455465Proofs.RamUniformRounding.command_spec

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

algorithmscomputational-complexitygraph-theory

Let III be a rational network instance and ddd its nonnegative rational metric. Assume positive support and total weight, zero diagonal, triangle inequalities, distance separation at least one, and metric height bounded by the polynomial input-size exponent P(L)P(L)P(L). Under the stated polynomial word budget and complete region workspace, the fixed rounding command returns the specified region-cut output within its polynomial clock:

Spec2W(MetricInputI,d,round,RegionCutOutputI,d,TP(L)).\mathrm{Spec}_{2^W}(\mathrm{MetricInput}_{I,d},\mathrm{round},\mathrm{RegionCutOutput}_{I,d},T_P(L)).Spec2W​(MetricInputI,d​,round,RegionCutOutputI,d​,TP​(L)).

This is a reusable source interface for composing the complete finite-program implementation.

Retired because the namespace-wrapped declaration compiled during publication but the proof-comparison parser rejects that header (expected token / unknown full theorem identifier). The mathematically identical, fully qualified declaration is Lax455465Proofs.RamUniformRounding.command_spec_native.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
Formal statement
namespace Lax455465Proofs.RamUniformRounding
theorem command_spec : ∀ (P : @Polynomial Nat Nat.instSemiring) {n : Nat} (kind : Lax455465.ProductNetwork.EdgeKind)
  (I : Lax455465.RationalEncoding.RationalInstance n) (d : Lax455465Proofs.MetricMatrix.Matrix n),
  (∀ (u v : Fin n),
      Lax455465Proofs.LpInputSize.Height
        (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
          ((2:Nat))
          (@Polynomial.eval Nat Nat.instSemiring
            (Lax759944.BinaryWordEncoding.bitSize (@Lax455465.RationalEncoding.encodeInput n kind I)) P))
        (@NNRat.cast Rat Rat.instNNRatCast (d u v))) →
    Nat.lt ((0:Nat))
        (@Lax455465Proofs.RamRoundingInit.support n (@Lax455465.RationalEncoding.RationalInstance.weight n I)) →
      @LT.lt Rat Rat.instLT (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0)))
          (@Lax455465Proofs.LargeBallRounding.total n I) →
        (∀ (v : Fin n),
            @Eq NNRat (d v v)
              (@OfNat.ofNat NNRat (nat_lit 0)
                (@Zero.toOfNat0 NNRat
                  (@MulZeroClass.toZero NNRat
                    (@instMulZeroClassOfSemiring NNRat
                      (@DivisionSemiring.toSemiring NNRat
                        (@Semifield.toDivisionSemiring NNRat NNRat.instSemifield))))))) →
          (∀ (u v t : Fin n),
              @LE.le Rat Rat.instLE (@NNRat.cast Rat Rat.instNNRatCast (d u t))
                (@HAdd.hAdd Rat Rat Rat (@instHAdd Rat Rat.instAdd) (@NNRat.cast Rat Rat.instNNRatCast (d u v))
                  (@NNRat.cast Rat Rat.instNNRatCast (d v t)))) →
            @LE.le Rat Rat.instLE (@OfNat.ofNat Rat (nat_lit 1) (@Rat.instOfNat (nat_lit 1)))
                (@Lax455465Proofs.LargeBallRounding.distanceSeparation n I
                  (@Lax455465Proofs.MetricMatrix.rational n d)) →
              ∀ (W : Nat),
                Nat.le
                    (@Polynomial.eval Nat Nat.instSemiring
                      (Lax759944.BinaryWordEncoding.bitSize (@Lax455465.RationalEncoding.encodeInput n kind I))
                      (Lax455465Proofs.RamRoundingResources.wordBound
                        (Lax455465Proofs.RamRoundingResources.baseBound P)))
                    W →
                  Lax808846Proofs.Reasoning.Spec
                    (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                      ((2:Nat)) W)
                    (fun (σ : Lax808846Proofs.Imp.Env) =>
                      And (@Lax455465Proofs.RamMetricRounding.Input n I d σ)
                        (And
                          (Lax455465Proofs.RamRegionInvariant.Room n
                            (@Lax455465Proofs.RamRoundingInit.support n
                              (@Lax455465.RationalEncoding.RationalInstance.weight n I))
                            σ)
                          (Lax455465Proofs.RamRegionCut.Room n σ)))
                    Lax455465Proofs.RamMetricRounding.command
                    (fun (x τ : Lax808846Proofs.Imp.Env) =>
                      @Lax455465Proofs.RamRegionCut.Output n I d
                        (@Lax455465Proofs.RamRoundingInit.support n
                          (@Lax455465.RationalEncoding.RationalInstance.weight n I))
                        τ)
                    (@Polynomial.eval Nat Nat.instSemiring
                      (Lax759944.BinaryWordEncoding.bitSize (@Lax455465.RationalEncoding.encodeInput n kind I))
                      (Lax455465Proofs.RamRoundingResources.timeBound
                        (Lax455465Proofs.RamRoundingResources.baseBound P))) := by sorry
end Lax455465Proofs.RamUniformRounding
Source
https://github.com/EdouardBonnet/lax-455465/blob/9988b9c5399185cfb3ca2129ca7c807fd80c2885/proofs/Lax455465Proofs/RamUniformRounding.lean, theorem command_spec (lines 53–82)

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