Polynomial native execution of metric region rounding
OpenLax455465Proofs.RamUniformRounding.command_specLet be a rational network instance and 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 . Under the stated polynomial word budget and complete region workspace, the fixed rounding command returns the specified region-cut output within its polynomial clock:
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.
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
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