File size: 3,533 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 | import OAI.Combinatorics.EditApproximation.Refinement.ComputedCoarseCopySpace
import OAI.Combinatorics.EditApproximation.Refinement.ComputedCoarseHistorySpace
namespace OAI
namespace EditApproximation
open Filter
/-- Retained dictionary, all copied coarse inputs, all coarse-array
capacities, and all local workspace allocations. Summing all allocations
is a conservative bound on simultaneous storage. -/
noncomputable def computedFamilyStorageCapacity (source target : List β) (N : β)
(input : ComputedFamilyInput source target N)
(localSpace : ComputedFamilyMemoKey source target N β β) : β :=
(computedFamilyResult source target N input).memory.rationalStorage +
computedFamilyCoarseCopyStorage source target N input +
computedFamilyCoarseArrayCapacity source target N input +
computedFamilyKernelWork source target N input localSpace
theorem computedFamilyKernelWork_polynomial (D : β) :
βαΆ N : β in atTop, β source target : List β, source.length + target.length β€ N β
β (input : ComputedFamilyInput source target N)
(cost : ComputedFamilyMemoKey source target N β β),
(β key, cost key β€ computedLocalKernelBudget D N) β
computedFamilyKernelWork source target N input cost β€ (N + 2) ^ 2 := by
filter_upwards [computedFamilyKernelWork_near_linear D 1 (by norm_num)] with N hN
intro source target hsize input cost hcost
have h := hN source target hsize input cost hcost
norm_num at h
exact_mod_cast h
private theorem storage_sum_bound (X K cache copied arrays localWork : β)
(hX : 2 β€ X) (hK : 39 β€ K)
(hcache : cache β€ X ^ K) (hcopy : copied β€ X ^ 18)
(harray : arrays β€ X ^ 39) (hlocal : localWork β€ X ^ 2) :
cache + copied + arrays + localWork β€ X ^ (K + 2) := by
have hbase : 0 < X := by omega
have hc := hcopy.trans (Nat.pow_le_pow_right hbase (show 18 β€ K by omega))
have ha := harray.trans (Nat.pow_le_pow_right hbase hK)
have hl := hlocal.trans (Nat.pow_le_pow_right hbase (show 2 β€ K by omega))
calc
_ β€ 4 * X ^ K := by omega
_ β€ X ^ 2 * X ^ K := Nat.mul_le_mul_right _ (by nlinarith only [hX])
_ = _ := by rw [β pow_add]; congr 1; omega
theorem computedFamilyStorageCapacity_polynomial (D : β) :
βαΆ N : β in atTop, β source target : List β, source.length + target.length β€ N β
(β a β source ++ target, Nat.size a β€ inputHeight N ^ 3) β
β (input : ComputedFamilyInput source target N)
(localSpace : ComputedFamilyMemoKey source target N β β),
(β key, localSpace key β€ computedLocalKernelBudget D N) β
computedFamilyStorageCapacity source target N input localSpace β€ (N + 2) ^ (65556 + 2) := by
filter_upwards [computedFamilyCoarseCopyStorage_polynomial,
computedFamilyCoarseArrayCapacity_polynomial, computedFamilyKernelWork_polynomial D,
computed_localOnlineMassBound_word, eventually_ge_atTop 1,
inputSmallLog_tendsto.eventually (eventually_ge_atTop (2 ^ 1000))]
with N hcopy harray hlocal hmass hN hell
intro source target hsize hsymbols input localSpace hcost
have hcache := computedFamilyResult_retained_storage source target N (by omega) hell hsize hmass input
have hc := hcopy source target hsize hsymbols input
have ha := harray source target hsize input
have hl := hlocal source target hsize input localSpace hcost
exact storage_sum_bound (N + 2) 65556 _ _ _ _ (by omega) (by decide)
hcache hc ha hl
end EditApproximation
end OAI
|