Copy a rational feasibility query into its cleared integer workspace
ProvedLax109476Proofs.RamFeasibilityQuery.copyInput_spec_nativealgorithmscomputational-complexitygraph-theory
Let be a rational linear program and let be its binary encoding size. Suppose meets the decoding word bound at and the full stored rational query predicate holds. The fixed copying command produces the padded-feasibility input for the denominator-cleared integer system:
It runs in at most instructions. This supplies the exact data conversion consumed by rational feasibility execution.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBoundsInterfaces namespace Lax109476Proofs.RamFeasibilityQuery end Lax109476Proofs.RamFeasibilityQuery
Formal statement
theorem Lax109476Proofs.RamFeasibilityQuery.copyInput_spec_native : ∀ (m n : Nat) (P : Lax109476.LinearProgram.Program Rat m n) (w : Nat),
@LE.le Nat instLENat
(Lax109476Proofs.RamDecoder.wordWidth
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
(Lax759944.BinaryWordEncoding.bitSize (@Lax109476.RationalEncoding.encodeProgram m n P))))
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)
(@Lax109476Proofs.RamFeasibilityQuery.Input m n P) Lax109476Proofs.RamFeasibilityQuery.copyInput
(fun (x τ : Lax808846Proofs.Imp.Env) =>
@Lax109476Proofs.RamPaddedFeasibility.Input m n (@Lax109476Proofs.IntegerEncoding.integerProgram m n P)
(Lax759944.BinaryWordEncoding.bitSize (@Lax109476.RationalEncoding.encodeProgram m n P)) τ)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 71) (instOfNatNat (nat_lit 71)))
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) m n) m))
(@OfNat.ofNat Nat (nat_lit 58) (instOfNatNat (nat_lit 58)))) := by sorrySource