Proposition 19.15.1. The envelope satisfies monotonicity, translation invariance, concavity, and the sup-norm estimate f≤g⟹P(f)≤P(g),P(f+c)=P(f)+c,P((1−t)f+tg)≥(1−t)P(f)+tP(g)(0≤t≤1),∥P(f)−P(g)∥∞≤∥f−g∥∞. If u is an admitted obstacle, then P(u)=u.
Argument in the manuscript
Proof. Every competitor below f is below g when f≤g, proving monotonicity. Adding c gives a bijection between the two competitor sets for translation invariance. The convex combination (1−t)P(f)+tP(g) is admitted and lies below (1−t)f+tg, proving concavity. If ε=∥f−g∥∞, then g−ε≤f≤g+ε; monotonicity and translation invariance give the norm estimate. Finally u is its own largest competitor. ◻