Why can there be no reductions from NP-complete problems to P problems under P ≠ NP
It would contradict the assumption that P$\,\neq\,$NP. You could solve the NP-complete problem in polynomial time by reducing it to a problem in&nbsp;P and solving that.