The phase retrieval problem is the problem of finding the intersections between a high-dimensional magnitude torus, A, in a Euclidean space and a second set, B, defined by the auxiliary data. The problem is difficult because the set A is not convex. In this chapter we give a very explicit description of the tangent and normal bundles of the torus in both the image-space and Fourier representations. Using this description, we show that, for practical support constraints, the intersections between A and B are not usually transversal. The chapter concludes with numerical examples demonstrating this phenomenon, with various types of images and support constraints. The chapter closes with appendices on the tangent and normal bundles of submanifolds of Euclidean spaces, and a fast algorithm for finding the orthogonal projections onto the tangent and normal bundles of a magnitude torus.