The main theorem of this paper is: If ƒ is a partial function from ℵ1 to ℵ1 which is ∑11-bounded, then there is a weakly finite primitive recursive dilatorD such that for all infinite , . The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.