Full normalization for ${\kappa }^{+}$-supercompactness

We extend the normalization results of the author’s paper “Full normalization for transfinite stacks” [5] to mice at the level of ${\kappa }^{+}$-supercompactness: given a normal iteration strategy $\mathrm{\Sigma }$ for such a mouse $M$, with both $M$ and $\mathrm{\Sigma }$ satisfying certain condensation properties, we extend $\mathrm{\Sigma }$ to a strategy ${\mathrm{\Sigma }}^{\ast }$ for stacks of normal trees, such that every iterate via ${\mathrm{\Sigma }}^{\ast }$ is in fact a normal iterate via $\mathrm{\Sigma }$.