Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 FK such that, whenever x,yK, 0<r<1 and (1r)x+ryF, 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:KR, q(t)=t2.

[F1]

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

Counterexample

1.1

The interval [1,1] is convex since 1s,t1 implies 1(1r)s+rt1 for 0r1. 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,tK, q(s)q(t)=sts+t2st, which proves continuity on K directly.

F1F2algebra
1.2

For s,tK and 0r1, (1r)s2+rt2((1r)s+rt)2=r(1r)(st)20. Thus q((1r)s+rt)(1r)q(s)+rq(t), the defining convexity inequality for a function. It includes r=0,1 and s=t, where equality holds.

F1algebra
2.1

On K, q(t)1 with equality exactly when t=1 or t=1, because 1t2=(1t)(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 0M. Thus M is not convex and cannot be a face. This refutes the claim with a continuous convex function on a compact convex set.

step 1.1step 1.2algebra
3.1

Nevertheless M is extremal. If (1r)s+rt=1 with s,tK and 0<r<1, then (1r)(1s)+r(1t)=0. Each summand is nonnegative and each coefficient is positive, so s=t=1. Similarly a combination equal to 1 gives (1r)(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.

step 2.1algebra

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