Read the original rational accuracy from native input
ProvedLax263307Proofs.NativeOriginalAccuracy.command_spec_nativealgorithmscomputational-complexitygraph-theory
Let have vertices and let be rational input data. Suppose and both and are below the word bound . With the original order and full input tail stored, the fixed reader terminates in at most instructions and returns
This supplies the original rational accuracy to the native root-parameter computation.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativePhaseInterfaces namespace Lax263307Proofs.NativeOriginalAccuracy end Lax263307Proofs.NativeOriginalAccuracy
Formal statement
theorem Lax263307Proofs.NativeOriginalAccuracy.command_spec_native : ∀ {n : Nat} (B : Nat) (G : SimpleGraph (Fin n)) [inst : @DecidableRel (Fin n) (Fin n) (@SimpleGraph.Adj (Fin n) G)]
(weights : Fin n → Rat) (ε : Rat),
@LT.lt Nat instLTNat
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) n n)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3)))
n))
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
B →
@LT.lt Nat instLTNat ε.num.natAbs B →
@LT.lt Nat instLTNat ε.den B →
Lax808846Proofs.Reasoning.Spec B
(fun (σ : Lax808846Proofs.Imp.Env) =>
And (@Eq Nat (σ.vars "input.n") n)
(Lax455465Proofs.RamVirtualState.Prefix (@Lax263307Proofs.NativeFrontend.tailInput n G inst weights ε)
"input.data" σ))
Lax263307Proofs.NativeOriginalAccuracy.command
(fun (x τ : Lax808846Proofs.Imp.Env) =>
And (@Eq Nat (τ.vars "accuracy.n") ε.num.natAbs) (@Eq Nat (τ.vars "accuracy.d") ε.den))
(@OfNat.ofNat Nat (nat_lit 18) (instOfNatNat (nat_lit 18))) := by sorrySource