Alphabeta Math
LemmaStatement: 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.

For a convex function and x<y<z, the three secant slopes satisfy s(x,y)≤s(x,z)≤s(y,z)

Statement

Let f:I→R be convex on an interval and, for distinct a,b∈I, write s(a,b):=(f(b)−f(a))/(b−a). If x<y<z lie in I, then

s(x,y)≤s(x,z)≤s(y,z).

Facts & Assumptions

Given: A convex f:I→R and x<y<z in I.

[L1]

A function is convex when the convex-combination inequality holds for every weight in [0,1] (Convex, strictly convex, concave, strictly concave, and midpoint-convex real functions on an interval).

Proof

technique · direct
1.1

Put λ=(z−y)/(z−x)∈(0,1); then y=λx+(1−λ)z, so convexity gives f(y)≤λf(x)+(1−λ)f(z).

L1
2.1

Multiplying this inequality by the positive number z−x and rearranging gives (z−y)(f(y)−f(x))≤(y−x)(f(z)−f(y)).

step 1.1algebra
3.1

Dividing step 2.1 successively by the positive products (y−x)(z−x) and (z−y)(z−x) gives s(x,y)≤s(x,z)≤s(y,z).

step 1.1step 2.1∎

Depends on

Used by

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