Define the P vs NP problem in the context of computational complexity theory. Explain the formal definitions of P (polynomial time) and NP (nondeterministic polynomial time). Discuss the theoretical consequences for cryptography, optimization, and mathematical proof if P were to equal NP versus if P does not equal NP.