How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite convex functions are locally Lipschitz
Statement
Use the Euclidean norm , and balls . A set is open if it contains a ball about each of its points. Let be open and convex, and let be finite and convex, meaning for every and . For every , there are a neighborhood of and such that for all . The same conclusion holds for finite concave functions by applying the result to .
Facts & Assumptions
Given: The open convex domain, finite-valued function, and Euclidean norm.
A convex subset of contains every line segment between two of its points: line segments and finite convex combinations of points in a convex set remain in that set.
Proof
Choose a closed cube centered at whose concentric dilation by factor lies in . Every point of the cube is a convex combination of its finitely many vertices, so [F1] and convexity bound above there by the largest vertex value . If lies in the cube, then lies in the dilated cube; convexity gives , hence , where is the largest value of at the finitely many vertices of the dilated cube, an upper bound there by the same convex-combination argument. Thus is bounded above and below on a ball about .
Choose concentric balls on which . For distinct , extend the segment from through to , which lies in . Put , so . Convexity yields . Repeating with interchanged gives the reverse bound. Negation proves the concave case.