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.
For a convex function and , the three secant slopes satisfy
Statement
Let be convex on an interval and, for distinct , write . If lie in , then
Facts & Assumptions
Given: A convex and in .
A function is convex when the convex-combination inequality holds for every weight in (Convex, strictly convex, concave, strictly concave, and midpoint-convex real functions on an interval).
Proof
Put ; then , so convexity gives .
Multiplying this inequality by the positive number and rearranging gives .
Dividing step 2.1 successively by the positive products and gives .
Depends on
Used by
- Log-convex solutions of the Gamma recurrence obey the Bohr--Mollerup factorial squeeze Lemma
- 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) for u<v Theorem
- A convex real function is Lipschitz on every closed bounded subinterval of the interior of its domain, hence continuous throughout the interior Theorem
Dependency tree · two levels
2 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)