Review pending

Proposition 19.15.1

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∥∞.\begin{gather*} f\leq g\ \Longrightarrow\ P(f)\leq P(g),\qquad P(f+c)=P(f)+c,\\ P((1-t)f+tg)\geq(1-t)P(f)+tP(g)\quad(0\leq t\leq1),\\ \|P(f)-P(g)\|_\infty\leq\|f-g\|_\infty. \end{gather*} If uu is an admitted obstacle, then P(u)=uP(u)=u.

Argument in the manuscript

Proof. Every competitor below ff is below gg when f≤gf\leq g, proving monotonicity. Adding cc gives a bijection between the two competitor sets for translation invariance. The convex combination (1−t)P(f)+tP(g)(1-t)P(f)+tP(g) is admitted and lies below (1−t)f+tg(1-t)f+tg, proving concavity. If ε=∥f−g∥∞\varepsilon=\|f-g\|_\infty, then g−ε≤f≤g+εg-\varepsilon\leq f\leq g+\varepsilon; monotonicity and translation invariance give the norm estimate. Finally uu is its own largest competitor. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-900358.

Proof in chapter