Computing one binomial-table entry
ProvedLax263307Proofs.NativeCombinations.entry_spec_nativealgorithmscomputational-complexitygraph-theory
Let and . Suppose the binomial table prefix before coordinate is stored, every required coefficient is below , and the complete table addresses fit the stated word bound. Then the fixed entry command returns
in at most thirty bounded operational steps. This is the local contract for building the subset-enumeration table.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeNextInterfaces namespace Lax263307Proofs.NativeCombinations end Lax263307Proofs.NativeCombinations
Formal statement
theorem Lax263307Proofs.NativeCombinations.entry_spec_native : ∀ (B n k i j : Nat),
@LE.le Nat instLENat i n →
@LE.le Nat instLENat j k →
@LT.lt Nat instLTNat
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) k
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
n)
k)
(@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
B →
(∀ (i : Nat),
@LE.le Nat instLENat i n → ∀ (j : Nat), @LE.le Nat instLENat j k → @LT.lt Nat instLTNat (i.choose j) B) →
Lax808846Proofs.Reasoning.Spec B
(fun (σ : Lax808846Proofs.Imp.Env) =>
And (@Eq Nat (σ.vars "choose.row") i)
(And (@Eq Nat (σ.vars "choose.col") j)
(And
(@Eq Nat (σ.vars "choose.cols")
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) k
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
(Lax455465Proofs.RamVirtualState.Prefix
(@List.take Nat
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
(@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) i
(@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) k
(@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
j)
(Lax263307Proofs.NativeCombinations.table n k))
"choose.table" σ))))
Lax263307Proofs.NativeCombinations.entry
(fun (x τ : Lax808846Proofs.Imp.Env) => @Eq Nat (τ.vars "choose.value") (i.choose j))
(@OfNat.ofNat Nat (nat_lit 30) (instOfNatNat (nat_lit 30))) := by sorrySource