Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

Boundary limits of a normalized finite convex generator exist

Statement

Let f:(0,∞)→R be convex and satisfy f(1)=0. Then f is continuous on (0,∞), and both extended-real limits f(0):=lim⁡t↓0f(t),f∞:=lim⁡t→∞f(t)t exist in R∪{+∞}; neither limit is −∞.

Facts & Assumptions

Given: A finite convex function f:(0,∞)→R with f(1)=0.

[F1]

Convex and strictly convex functions on Euclidean convex sets: convexity means f((1−s)x+sy)≤(1−s)f(x)+sf(y) for positive x,y and s∈[0,1].

[F2]

The real numbers, The reals form a totally ordered field, The Cauchy-sequence reals have the least-upper-bound property, and Complete ordered field (least-upper-bound property): R is the Cauchy-sequence real field with the least-upper-bound property, so every nonempty set of real numbers bounded above has a real supremum and every nonempty set bounded below has a real infimum.

Proof

1.1F1givenconstructalgebra

Fix c>0 and let u=c/2, a=3c/4, b=5c/4, and v=3c/2. For r<s, write m(r,s)=(f(s)−f(r))/(s−r). If a≤x<y≤b, convexity at a between u,x, at x between u,y, at y between x,v, and at b between y,v gives m(u,a)≤m(u,x)≤m(x,y)≤m(y,v)≤m(b,v) by rearranging the four two-point inequalities in [F1]. All these endpoint slopes are finite. Thus with M=max⁡{∣m(u,a)∣,∣m(b,v)∣}, one has ∣f(y)−f(x)∣≤M∣y−x∣ for x,y∈[a,b], including x=y.

1.2F1F2givenalgebra

Fix a=1/2 and set n(x)=(f(a)−f(x))/(a−x) for 0<x<a. If 0<x<y<a, then y is a convex combination of x and a; [F1] gives f(y)≤a−ya−xf(x)+y−xa−xf(a). Rearranging yields n(x)≤n(y). Also a is a convex combination of x and 1, so another application of [F1] gives n(x)≤(f(1)−f(a))/(1−a), a finite upper bound. Therefore L:=inf⁡0<x<an(x) is either real or −∞; the infimum property from [F2] gives n(x)→L as x↓0 (if L is finite, approximate it within any ε>0; if L=−∞, use any real lower target). Since f(x)=f(a)−(a−x)n(x), its limit is f(a)−aL if L is finite and +∞ if L=−∞. Thus f(0) exists and is not −∞.

2.1step 1.1givenchoosealgebra

Given ε>0, choose δ=min⁡{c/4,ε/(M+1)}. If ∣x−c∣<δ, then x,c∈[a,b], and step 1.1 gives ∣f(x)−f(c)∣≤M∣x−c∣<ε. This is continuity at the arbitrary c>0, so f is continuous on (0,∞).

3.1F1F2givenalgebra∎

For t>1, put r(t)=f(t)/(t−1). If 1<s<t, then s is a convex combination of 1 and t. By [F1] and f(1)=0, this gives r(s)≤r(t). Hence r is nondecreasing on (1,∞) and bounded below on [2,∞) by the finite value r(2). By the supremum property in [F2], its limit is the real supremum R if it is bounded above, and is +∞ otherwise: for finite R, values eventually lie between R−ε and R; when unbounded, they eventually exceed any prescribed real number. Since f(t)/t=((t−1)/t)r(t) and (t−1)/t→1, this quotient tends to R if R is finite; if R=+∞, the factor is at least 1/2 for t≥2 and the quotient tends to +∞. Thus f∞ exists and is not −∞.

Depends on

Used by

Dependency tree · two levels

19 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