The standard envelope theorems apply to choice sets with convex and topological structure, providing sufficient conditions for the value function to be differentiable in a parameter and characterizing its derivative. This paper studies optimization with arbitrary choice sets and shows that the traditional envelope formula holds at any differentiability point of the value function. We also provide conditions for the value function to be, variously, absolutely continuous, left‐ and right‐differentiable, or fully differentiable. These results are applied to mechanism design, convex programming, continuous optimization problems, saddle‐point problems, problems with parameterized constraints, and optimal stopping problems.