TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02

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.

A convex function on an open interval has finite left and right derivatives everywhere, with $f_{-}^{'} (u) \leq f_{+}^{'} (u) \leq (f (v) - f (u)) / (v - u) \leq f_{-}^{'} (v) \leq f_{+}^{'} (v)$ for $u < v$

Statement

If $f : I \to R$ is convex on an open interval, then $f_{-}^{'} (c)$ and $f_{+}^{'} (c)$ are finite for every $c \in I$ . Moreover, for $u < v$ in $I$ ,

$f_{-}^{'} (u) \leq f_{+}^{'} (u) \leq \frac{f (v) - f (u)}{v - u} \leq f_{-}^{'} (v) \leq f_{+}^{'} (v) .$

Facts & Assumptions

Given: A convex $f : I \to R$ on an open interval and $u < v$ in $I$ .

[L1]

For a convex function and three ordered points, the three secant slopes satisfy $s (x, y) \leq s (x, z) \leq s (y, z)$ (For a convex function and $x < y < z$ , the three secant slopes satisfy $s (x, y) \leq s (x, z) \leq s (y, z)$ ).

[L2]

The left and right derivatives are the one-sided limits of the difference quotient (The left and right derivatives of a real function as one-sided limits of its difference quotient).

[L3]

A nondecreasing function on an interval has every well-posed one-sided limit, given by the corresponding supremum or infimum (One-sided limits of a monotone function always exist: for $f$ nondecreasing on an interval $I$ and $c \in I$ , $\lim_{x \to c^{-}} f (x) = \sup {f (x) : x \in I, x < c}$ whenever $I$ has points below $c$ , $\lim_{x \to c^{+}} f (x) = \inf {f (x) : x \in I, x > c}$ whenever it has points above $c$ , and these satisfy $\lim_{x \to c^{-}} f (x) \leq f (c) \leq \lim_{x \to c^{+}} f (x)$ ).

Proof

technique · direct

1.1

For fixed $c \in I$ , the functions $x \mapsto s (x, c)$ on $x < c$ and $x \mapsto s (c, x)$ on $x > c$ are nondecreasing by [L1]; choosing points on both sides of $c$ , [L1] bounds each near $c$ between two fixed finite outer secant slopes.

L1L2

2.1

The monotone one-sided-limit theorem [L3] therefore supplies finite one-sided limits of these two slope functions at $c$ , and [L2] identifies them respectively with $f_{-}^{'} (c)$ and $f_{+}^{'} (c)$ .

step 1.1L2L3

3.1

Apply [L1] to $x < u < v$ and let $x \to u^{-}$ , then to $u < v < z$ and let $z \to v^{+}$ ; together with $s (u, v) \leq f_{-}^{'} (v)$ and $f_{+}^{'} (u) \leq s (u, v)$ obtained in the same way, this gives the displayed chain.

step 1.1step 2.1L1∎

Depends on

Used by

Dependency tree · two levels

21 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

R. Gardner, Convex Functions, Notes 6.6 (standard reference, not scraped)

A convex function on an open interval has finite left and right derivatives everywhere, with f−′(u)≤f+′(u)≤(f(v)−f(u))/(v−u)≤f−′(v)≤f+′(v)f−′​(u)≤f+′​(u)≤(f(v)−f(u))/(v−u)≤f−′​(v)≤f+′​(v) for u<vu<v