Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Jensen maximum principle for locally semiconvex functions

Statement

Assume the Axiom of Choice. Let f be finite and locally semiconvex near 0∈Rm, m≥1: on some Euclidean ball (Open ball, closed ball and sphere in a metric space), f(x)+λ∣x∣2/2 is convex (Convex and strictly convex functions on Euclidean convex sets) for a finite λ≥0. Suppose 0 is a strict local maximum of f. For every sufficiently small r>0 and every δ>0, the set of points x∈Br(0) where f(x)+q⋅x has a local maximum for some ∣q∣≤δ contains a compact subset of positive Lebesgue outer measure. Consequently, given any Lebesgue null set N, such a maximum can be chosen with x∉N, ∣x∣<r, and ∣q∣≤δ.

Facts & Assumptions

Given: The function, strict maximum, and parameters in the Statement; assume The Axiom of Choice.

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice); this supplies the Countable Choice hypotheses of the cited outer-measure suppliers.

[F1]

Finite convex functions on open convex sets are locally Lipschitz (A convex function on an open convex set is locally Lipschitz).

[F2]

A Lipschitz map Rm→Rm sends cube-cover null sets (Measure zero and content zero in Rm by countable and finite cube covers) to null sets (A Lipschitz map Rm→Rm sends null sets to null sets). Cube-cover nullity agrees with zero Lebesgue outer measure (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure). Outer measure is monotone, and a nonempty open ball has positive outer measure because it contains a positive-volume half-open box (Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume).

[F3]

A continuous function on a compact Euclidean ball attains its maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

Proof

1.1F1F3givenchoose

Shrink to a ball B‾R⊆U on which g(x)=f(x)+λ∣x∣2/2 is convex and f(0)>f(x) for 0<∣x∣≤R. By [F1], f is continuous. Given 0<r<R/4, the compact annulus r≤∣x∣≤R has a strictly positive gap c=f(0)−max⁡f. Fix 0<η≤δ with ηR<c/2. For every ∣q∣≤η, all global maximizers of f(x)+q⋅x on B‾R lie in Br, since their value at zero is f(0) and annulus values are at most f(0)−c+ηR. Their maximizing pairs form a closed subset of the compact product B‾R×B‾η, so their set K is compact and lies in Br.

2.1step 1.1algebra

At a maximizing pair (x,q), f(z)≤f(x)−q⋅(z−x) on B‾R. Put v=−q+λx. Expanding the quadratic gives g(x+h)≤g(x)+v⋅h+λ∣h∣2/2. Convexity gives the reverse support g(z)≥g(x)+v⋅(z−x): for h=z−x and small t>0, convexity on the segment from x−th to z yields g(z)−g(x)≥(g(x)−g(x−th))/t≥v⋅h−λt∣h∣2/2, and let t↓0. Thus f is differentiable at x, px=Df(x)=−q, and f(x)+px⋅(z−x)−λ∣z−x∣2/2≤f(z)≤f(x)+px⋅(z−x) for z∈B‾R; in particular the slope at each x∈K is unique.

3.1step 2.1algebra

For distinct x,y∈K, set d=y−x. The support bounds in step 2.1 and f(y)≤f(x)+px⋅d give (px−py)⋅h≤λ∣d+h∣2/2 whenever y+h∈BR. If px≠py, take h=∣d∣(px−py)/∣px−py∣, which is admissible since ∣y+h∣<3r<R. Then ∣px−py∣∣d∣≤2λ∣d∣2. Equal slopes need no estimate, so x↦px is 2λ-Lipschitz on K.

4.1A1step 1.1step 3.1F2algebra

For each coordinate set Pj(z)=inf⁡x∈K(pxj+2λ∣z−x∣). Compactness makes this finite; the triangle inequality makes it 2λ-Lipschitz, and step 3.1 gives Pj(x)=pxj on K. Hence P=(P1,…,Pm) is 2λm-Lipschitz and, since each ∣q∣≤η has a maximizer in K with P(x)=−q, P(K)⊇B‾η. If K were null, [F2] would make P(K) null, contradicting the positive outer measure of Bη; thus K has positive outer measure. If λ=0, this same construction makes P constant while its image contains B‾η, a contradiction, so no strict-maximum case is missed. Countable Choice required by [F2] follows from [A1].

5.1A1step 4.1F2given∎

Since K has positive outer measure, it cannot be contained in the given null set N. Choose x∈K∖N and its maximizing slope q; then ∣x∣<r and ∣q∣≤η≤δ. This proves both conclusions.

Depends on

Used by

Dependency tree · two levels

58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources