Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 can have a nonconvex maximum set

Statement refuted

The maximum set of a continuous convex real function on a compact convex set is always a face.

Here a face of a convex set K means a convex subset F⊆K such that, whenever x,y∈K, 0<r<1 and (1−r)x+ry∈F, both x,y belong to F. A subset with just this endpoint property is called extremal; convexity is an additional requirement for being a face.

Facts & Assumptions

Given: K=[−1,1]⊆R and q:K→R, q(t)=t2.

[F1]

Convexity uses real coefficients in [0,1] (Local convexity, convex and balanced sets, and the continuous dual).

Counterexample

1.1F1F2algebra

The interval [−1,1] is convex since −1≤s,t≤1 implies −1≤(1−r)s+rt≤1 for 0≤r≤1. It is closed, its complement being the open rays (−∞,−1) and (1,∞), and bounded by one in absolute value. Hence it is nonempty compact convex. For s,t∈K, ∣q(s)−q(t)∣=∣s−t∣∣s+t∣≤2∣s−t∣, which proves continuity on K directly.

1.2F1algebra

For s,t∈K and 0≤r≤1, (1−r)s2+rt2−((1−r)s+rt)2=r(1−r)(s−t)2≥0. Thus q((1−r)s+rt)≤(1−r)q(s)+rq(t), the defining convexity inequality for a function. It includes r=0,1 and s=t, where equality holds.

2.1step 1.1step 1.2algebra

On K, q(t)≤1 with equality exactly when t=−1 or t=1, because 1−t2=(1−t)(1+t) and both factors are nonnegative. The maximum set is therefore M={−1,1}. Its midpoint is zero, and q(0)=0<1, so 0∉M. Thus M is not convex and cannot be a face. This refutes the claim with a continuous convex function on a compact convex set.

3.1step 2.1algebra∎

Nevertheless M is extremal. If (1−r)s+rt=1 with s,t∈K and 0<r<1, then (1−r)(1−s)+r(1−t)=0. Each summand is nonnegative and each coefficient is positive, so s=t=1. Similarly a combination equal to −1 gives (1−r)(s+1)+r(t+1)=0 and forces s=t=−1. Thus the endpoint property holds even though convexity fails. All witnesses and computations are explicit and choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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