Consider a partially persistent array with elements and modifications, where is a constant fulfilling .
Assuming the space complexity of the array is for a constant ,
the lower bound on the lookup complexity in this partially persistent
array is . (en)