Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 ∥z∥=(∑j=1dzj2)1/2, and balls B(a,r)={z:∥z−a∥<r}. A set is open if it contains a ball about each of its points. Let U⊂Rd be open and convex, and let f:U→R be finite and convex, meaning f((1−t)x+ty)≤(1−t)f(x)+tf(y) for every x,y∈U and t∈[0,1]. For every x0∈U, there are a neighborhood V of x0 and L<∞ such that ∣f(x)−f(y)∣≤L∥x−y∥ for all x,y∈V. The same conclusion holds for finite concave functions by applying the result to −f.

Facts & Assumptions

Given: The open convex domain, finite-valued function, and Euclidean norm.

[F1]

A convex subset of Rm 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

1.1givenF1construct

Choose a closed cube centered at x0 whose concentric dilation by factor 2 lies in U. Every point of the cube is a convex combination of its finitely many vertices, so [F1] and convexity bound f above there by the largest vertex value M. If x lies in the cube, then 2x0−x lies in the dilated cube; convexity gives f(x0)≤(f(x)+f(2x0−x))/2, hence f(x)≥2f(x0)−M′, where M′ is the largest value of f at the finitely many vertices of the dilated cube, an upper bound there by the same convex-combination argument. Thus f is bounded above and below on a ball about x0.

2.1step 1.1F1algebra∎

Choose concentric balls B(x0,r)⊂B(x0,2r)⊂U on which m≤f≤M. For distinct x,y∈B(x0,r/2), extend the segment from x through y to z=y+(r/2)(y−x)/∥y−x∥, which lies in B(x0,2r). Put θ=∥y−x∥/(r/2+∥y−x∥), so y=(1−θ)x+θz. Convexity yields f(y)−f(x)≤θ(M−m)≤(2(M−m)/r)∥y−x∥. Repeating with x,y interchanged gives the reverse bound. Negation proves the concave case.

Depends on

Dependency tree · 2 levels

Sources