Lemma 11.10.2. (From affine selection to a convex maximum). Let be an open ball and let be continuous, with for affine . Then is Lipschitz on , with constant for the Euclidean norm. If has a local touching affine lower support at every point, it is convex and there is a nonempty subset such that
Argument in the manuscript
Proof. On a line segment in , restrict the finite list of affine functions and discard identical restrictions. Distinct restrictions intersect at at most one point. Between these finitely many intersection points, continuity forces to follow one affine restriction. Its slope on each interval is bounded by times the speed of the segment. Summing the interval estimates proves the Lipschitz bound.
At an interior breakpoint of the segment, a touching affine lower support has slope satisfying , where and are the left and right slopes of . Hence the slopes never decrease. The restriction to every segment is convex, so is convex on .
Discard duplicate affine functions on . The hyperplanes cut a dense open subset of into finitely many chambers. On each chamber the selected affine function is fixed. Let consist of the indices selected on some chamber. If , choose in that chamber. For any and sufficiently small , the point remains in the chamber. Convexity gives so . Equality with one of these supporting pieces holds on every chamber and hence, by continuity, throughout . This proves (11.10.2). For both assertions are immediate. ◻