Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Convex functions have countable supporting line representations

Statement

Let ϕ:R→R be finite and convex. For each q∈Q define ℓq(t)=ϕ(q)+ϕ−′(q)(t−q). Then ϕ(t)=sup⁡q∈Qℓq(t) for every real t. This is a countable family with deterministic real coefficients; the coefficients need not be rational. The function ϕ is locally Lipschitz and Borel measurable.

Facts & Assumptions

Given: A finite convex function ϕ:R→R.

[F2]

A slope between the one-sided derivatives defines a supporting line. (Every slope between the left and right derivatives of a convex function gives a supporting line)

[F3]

The rational contact points form a countable set. (Q is countably infinite)

[F4]

Rational points approximate each real point arbitrarily closely. (The rationals embed densely in the reals)

[F5]

A continuous real function is Borel measurable. (A continuous map has Borel preimages of Borel sets)

Proof

technique · direct
1.1F1F2F3

By [F1], mq=ϕ−′(q) is finite and lies between ϕ−′(q) and ϕ+′(q). Therefore [F2] gives ℓq(t)≤ϕ(t) for every t, with equality at t=q. The family is countable by [F3], and no slope choice is made.

1.2F1F5

Fix real a<b. For a≤u<v≤b, the inequalities in [F1], also applied between a−1,u and v,b+1, bound the secant slope between the finite numbers ϕ+′(a−1) and ϕ−′(b+1). The same bounds hold for ϕ−′(q) for q∈[a,b]. Let M be the maximum of their absolute values. Then ∣ϕ(v)−ϕ(u)∣≤M∣v−u∣, proving Lipschitz continuity on [a,b] and thus continuity everywhere; [F5] gives Borel measurability.

2.1step 1.1step 1.2F4∎

For fixed x use step 1.2 on [x−1,x+1]. Given ε>0, [F4] supplies rational q in this interval with ∣q−x∣<ε/(2M+1). Then 0≤ϕ(x)−ℓq(x)≤∣ϕ(x)−ϕ(q)∣+∣mq∣∣x−q∣≤2M∣x−q∣<ε. Thus the supremum of the supporting lines is at least ϕ(x)−ε for every positive ε, and at most ϕ(x) by step 1.1, proving equality. This also handles M=0 and affine functions with irrational slopes.

Source notes

Durrett Theorem 4.1.10 and countability remark, printed p.211, motivate the countable-support method. Here rational contact points with real slopes avoid any rational-coefficient ambiguity; the exact local supporting-line and derivative interfaces give the complete derivation.

Depends on

Used by

Dependency tree · two levels

37 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