The forcings for constructing paths on infinite binary trees, cohesive sets for arrays, and infinite transitive subsets of tournaments, all preserve complexity of sets. That is, sets which are complex relative to the ground model remain complex relative to the extension. Here, complex could mean $\Delta^0_2$ (Wang 2014) or hyperimmune (Patey 2015). We present their proofs and mention applications to reverse mathematics.